8 search results - page 1 / 2 » Finite-State Phonology In HPSG |
COLING
1992
13 years 7 months ago
1992
ANLP
2000
13 years 7 months ago
2000
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
FSMNLP
2005
Springer
13 years 11 months ago
2005
Springer
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
COLING
2002
13 years 6 months ago
2002
The objective of this work is to disambiguate transducers which have the following form: T = R D and to be able to apply the determinization algorithm described in (Mohri, 1997)....
CICLING
2007
Springer
14 years 13 days ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...