Sciweavers

60 search results - page 8 / 12
» Disambiguation of Finite-State Transducers
Sort
View
CICLING
2008
Springer
13 years 9 months ago
Arabic Morphology Parsing Revisited
In this paper we propose a new approach to the description of Arabic morphology using 2-tape finite state transducers, based on a particular and systematic use of the operation of ...
Suhel Jaber, Rodolfo Delmonte
NAACL
2003
13 years 8 months ago
Simpler and More General Minimization for Weighted Finite-State Automata
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...
Jason Eisner
FUIN
2007
93views more  FUIN 2007»
13 years 7 months ago
Finitary Compositions of Two-way Finite-State Transductions
Abstract. The hierarchy of arbitrary compositions of two-way nondeterministic finite-state transductions collapses when restricted to finitary transductions, i.e., transductions ...
Joost Engelfriet, Hendrik Jan Hoogeboom
CSL
2006
Springer
13 years 7 months ago
The architecture and the implementation of a finite state pronunciation lexicon for Turkish
This paper describes the architecture and the implementation of a full-scale pronunciation lexicon for Turkish using finite state technology. The system produces at its output, a ...
Kemal Oflazer, Sharon Inkelas
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 7 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