Bayesian Identification of Cognates and Correspondences

13Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a Bayesian approach to comparing languages: Identifying cognates and the regular correspondences that compose them. A simple model of language is extended to include these notions in an account of parent languages. An expression is developed for the posterior probability of child language forms given a parent language. Bayes' Theorem offers a schema for evaluating choices of cognates and correspondences to explain semantically matched data. An implementation optimising this value with gradient descent is shown to distinguish cognates from non-cognates in data from Polish and Russian.

Cite

CITATION STYLE

APA

Mark Ellison, T. (2007). Bayesian Identification of Cognates and Correspondences. In Proceedings of 9th Meeting of the ACL Special Interest Group in Computational Morphology and Phonology, SIGMORPHON 2007 - Held in conjunction with the 45th Annual Meeting of the Association of Computational Linguistics, ACL 2007 (pp. 15–22). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1626516.1626519

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free