Aligning phonemes using finte-state methods

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review


The paper presents two finite-state methods which can be used for aligning pairs of cognate words or sets of different allomorphs of stems. Both methods use weighted finite-state machines for choosing the best alternative. Individual letter or phoneme correspondences can be weighted according to various principles, e.g. using distinctive features. The comparison of just two forms at a time is simple, so that method is easier to refine to include context conditions. Both methods are language independent and could be tuned for and applied to several types of languages for producing gold standard data. The algorithms were implemented using the HFST finite-state library from short Python programs. The paper demonstrates that the solving of some non-trivial problems has become easier and accessible for a wider range of scholars.
Titel på gästpublikation21st Nordic Conference of Computational Linguistics : Proceedings of the Conference
RedaktörerJörg Tiedeman
Antal sidor9
FörlagLinköping University Electronic Press
Utgivningsdatum8 maj 2017
ISBN (elektroniskt)978-91-7685-601-7
StatusPublicerad - 8 maj 2017
MoE-publikationstypA4 Artikel i en konferenspublikation
EvenemangNordic Conference on Computational Linguistics, NoDaLiDa - Gothenburg, Sverige
Varaktighet: 22 maj 201724 maj 2017
Konferensnummer: 21


NamnNEALT Proceedings Series
FörlagLinköping University Electronic Press
ISSN (tryckt)1650-3686
ISSN (elektroniskt)1650-3740


  • 6121 Språkvetenskaper

Citera det här