2467 search results - page 75 / 494 » Finite State Machines |
90
Voted
REX
1993
15 years 4 months ago
1993
101
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
88
Voted
MOVEP
2000
15 years 4 months ago
2000
SPIN
2000
Springer
15 years 4 months ago
2000
Springer
143
click to vote
WIA
2000
Springer
15 years 4 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...