An efficient context-free parsing algorithm
Communications of the ACM
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Finite-state transducers in language and speech processing
Computational Linguistics
Efficient generation of random sentences
Natural Language Engineering
Approximating context-free grammars with a finite-state calculus
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Deterministic left corner parsing
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
Treatment of epsilon moves in subset construction
Computational Linguistics - Special issue on finite-state methods in NLP
Guided parsing of range concatenation languages
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Dependency Parsing with an Extended Finite-State Approach
Computational Linguistics
Development in parsing technology: from theory to application
New developments in parsing technology
| Hi-index | 0.00 |
We show that context-free parsing can be realised by a 2-phase process, relying on an approximated context-free grammar. In the first phase a finite transducer performs parsing according to the approximation. In the second phase, the approximated parses are refined according to the original grammar.