15 search results - page 2 / 3 » Two Parsing Algorithms by Means of Finite State Transducers |
CORR
2000
Springer
13 years 5 months ago
2000
Springer
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...
ACL
1998
13 years 6 months ago
1998
In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation as...
INTERSPEECH
2010
12 years 12 months ago
2010
The emergence of highly parallel computing platforms is enabling new trade-offs in algorithm design for automatic speech recognition. It naturally motivates the following investig...
ICFP
2006
ACM
14 years 5 months ago
2006
ACM
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
EURODAC
1994
IEEE
13 years 9 months ago
1994
IEEE
The paper presents a synthesis approach for pipelinelike controller structures. These structures allow to implement a built-in self-test in two sessions without any extra test reg...