Sciweavers

936 search results - page 47 / 188
» FSM-Hume is finite state
Sort
View
COLING
2002
13 years 8 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
COLING
2002
13 years 8 months ago
Disambiguation of Finite-State Transducers
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)....
N. Smaili, Patrick Cardinal, Gilles Boulianne, Pie...
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 8 months ago
Finite-State Non-Concatenative Morphotactics
Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generator...
Kenneth R. Beesley, Lauri Karttunen