110 search results - page 5 / 22 » Finite-State Registered Automata and Their Uses in Natural L... |
FSMNLP
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents a method for converting back and forth between the Perso-Arabic and a Romanized writing systems for Persian. Given a word in one writing system, we use finite ...
CICLING
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
COLING
2002
13 years 7 months ago
2002
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...
ACL
1997
13 years 8 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
GRC
2005
IEEE
14 years 1 months ago
2005
IEEE
: This study presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata w...