A complexity measure for diachronic Chinese phonology
| dc.creator | Raman, Anand | |
| dc.creator | Newman, John | |
| dc.creator | Patrick, Jon | |
| dc.date | 1997-08-14 | |
| dc.date | 1997-08-20 | |
| dc.date.accessioned | 2026-07-07T08:58:43Z | |
| dc.date.available | 2026-07-07T08:58:43Z | |
| dc.description | 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. | |
| dc.description | uses psfig.sty, aclap.sty, fullname.bst, 9 pages, 2 ps figures | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9708007 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9708007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/147438 | |
| dc.subject | Computation and Language | |
| dc.title | A complexity measure for diachronic Chinese phonology | |
| dc.type | text |