Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
PCFG models of linguistic tree representations
Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A General Technique to Train Language Models on Language Models
Computational Linguistics
fsm2 - a scripting language interpreter for manipulating weighted finite-state automata
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
| Hi-index | 0.00 |
It is well known that context-free parsing can be seen as the intersection of a context-free language with a regular language (or, equivalently, the intersection of a context-free grammar with a finite-state automaton). The present article provides a practical efficient way to compute this intersection by converting the grammar into a special finite-state automaton (the GLR(0)-automaton) which is subsequently intersected with the given finite-state automaton. As a byproduct, we present a generalisation of Tomita's algorithm to recognize several inputs simultaneously.