Computer Science – Computation and Language
Scientific paper
1997-08-14
Computer Science
Computation and Language
uses psfig.sty, aclap.sty, fullname.bst, 9 pages, 2 ps figures
Scientific paper
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.
Newman John
Patrick Jon
Raman Anand
No associations
LandOfFree
A complexity measure for diachronic Chinese phonology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A complexity measure for diachronic Chinese phonology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A complexity measure for diachronic Chinese phonology will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-309210