Abstract
Abstract Computational methods of language dating make inferences about the divergence times of protolanguages by evaluating the patterns of inheritance in the vocabulary of modern languages, given the specification of a model of vocabulary evolution. We consider a model that describes vocabulary evolution as the replacement of traits by new traits from an infinite state space along a tree. This model has been introduced in previous literature but so far it has not been used in many applications. We give a general recursive algorithm for calculating likelihoods and argue that the model gives a more realistic representation of vocabulary evolution over time, compared to existing models like the Stochastic Dollo model. We also provide a case study demonstrating the model’s potential applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
