Algorithms for approximate string matching
Information and Control
The reconstruction engine: a computer implementation of the comparative method
Computational Linguistics - Special issue on computational phonology
An algorithm to align words for historical comparison
Computational Linguistics
A PL/1 program to assist the comparative linguist
Communications of the ACM
The Maximum Weight Trace Problem in Multiple Sequence Alignment
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
A new algorithm for the alignment of phonetic sequences
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Multipath translation lexicon induction via bridge languages
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Improved reconstruction of protolanguage word forms
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Multiple word alignment with profile hidden Markov models
SRWS '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium
Computing word similarity and identifying cognates with pair hidden Markov models
CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
| Hi-index | 0.00 |
An essential step in comparative reconstruction is to align corresponding phonological segments in the words being compared. To do this, one must search among huge numbers of potential alignments to find those that give a good phonetic fit. This is a hard computational problem, and it becomes exponentially more difficult when more than two strings are being aligned. In this paper I extend the guided-search alignment algorithm of Covington (Computational Linguistics, 1996) to handle more than two strings. The resulting algorithm has been implemented in Prolog and gives reasonable results when tested on data from several languages.