A complexity measure for diachronic Chinese phonology
cmp-lg
2008-02-03 v3 Computation and Language
Abstract
This paper addresses the problem of deriving distance measures between parent and daughter languages with specific relevance to historical Chinese phonology. The diachronic relationship between the languages is modelled as a Probabilistic Finite State Automaton. The Minimum Message Length principle is then employed to find the complexity of this structure. The idea is that this measure is representative of the amount of dissimilarity between the two languages.
Keywords
Cite
@article{arxiv.cmp-lg/9708007,
title = {A complexity measure for diachronic Chinese phonology},
author = {Anand Raman and John Newman and Jon Patrick},
journal= {arXiv preprint arXiv:cmp-lg/9708007},
year = {2008}
}
Comments
uses psfig.sty, aclap.sty, fullname.bst, 9 pages, 2 ps figures