59 search results - page 3 / 12 » State Complexity of Union and Intersection of Finite Languag... |
ACL
1994
13 years 7 months ago
1994
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving t...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
WIA
2000
Springer
13 years 9 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...
EACL
2009
ACL Anthology
2009
ACL Anthology
Semitic Morphological Analysis and Generation Using Finite State Transducers with Feature Structures
14 years 6 months ago
This paper presents an application of finite state transducers weighted with feature structure descriptions, following Amtrup (2003), to the morphology of the Semitic language Tig...
RP
2010
Springer
13 years 3 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...