An automated framework for fast cognate detection and bayesian phylogenetic 
inference in computational historical linguistics

Rama, Taraka; List, Johann-Mattis

doi:10.18653/v1/P19-1627

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

An automated framework for fast cognate detection and bayesian phylogenetic inference in computational historical linguistics

MPS-Authors

/persons/resource/persons201886

List, Johann-Mattis
CALC, Max Planck Institute for the Science of Human History, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

shh2248.pdf
(Publisher version), 189KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Rama, T., & List, J.-M. (2019). An automated framework for fast cognate detection and bayesian phylogenetic inference in computational historical linguistics. In Proceedings of the 57th Conference of the Association for Computational Linguistics (pp. 6225-6235). Florence: Association for Computational Linguistics. doi:10.18653/v1/P19-1627.

Cite as: https://hdl.handle.net/21.11116/0000-0004-5B8D-8

Abstract

We present a fully automated workflow for phylogenetic reconstruction on large datasets, consisting of two novel methods, one for fast detection of cognates and one for fast Bayesian phylogenetic inference. Our results show that the methods take less than a few minutes to process language families that have so far required large amounts of time and computational power. Moreover, the cognates and the trees inferred from the method are quite close, both to gold standard cognate judgments and to expert language family trees. Given its speed and ease of application, our framework is specifically useful for the exploration of very large datasets in historical linguistics.