15 search results - page 1 / 3 » Two Parsing Algorithms by Means of Finite State Transducers |
89
Voted
COLING
1994
14 years 11 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
115
click to vote
WIA
2000
Springer
15 years 1 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
114
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
96
Voted
FSMNLP
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes the implementation and system details of Klex, a finite-state transducer lexicon for the Korean language, developed using XRCE’s Xerox Finite State Tool (XF...
67
Voted
COLING
1996
14 years 11 months ago
1996
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...