Sciweavers

71 search results - page 2 / 15
» A Programming Language for Finite State Transducers
Sort
View
ACL
2009
13 years 3 months ago
A Stochastic Finite-State Morphological Parser for Turkish
This paper presents the first stochastic finite-state morphological parser for Turkish. The non-probabilistic parser is a standard finite-state transducer implementation of two-le...
Hasim Sak, Tunga Güngör, Murat Saraclar
FSMNLP
2005
Springer
13 years 10 months ago
Finite-State Registered Automata and Their Uses in Natural Languages
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...
Yael Cohen-Sygal, Shuly Wintner
ACL
2008
13 years 6 months ago
Arabic Language Modeling with Finite State Transducers
In morphologically rich languages such as Arabic, the abundance of word forms resulting from increased morpheme combinations is significantly greater than for languages with fewer...
Ilana Heintz
COLING
1994
13 years 6 months ago
Two Parsing Algorithms by Means of Finite State Transducers
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...
Emmanuel Roche