Buscar
Mostrando ítems 1-2 de 2
Stochastic parsing and parallelism
(Springer-Verlag, 2001)
[Abstract] Parsing CYK-like algorithms are inherently parallel: there are a lot of cells in the chart that can be calculated simultaneously. In this work, we present a study on the appropriate techniques of paralle-lism ...
Compilation methods of minimal acyclic finite-state automata for large dictionaries.
(Springer-Verlag, 2001)
[Abstract] We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We outline the most important methods, including ...