Generalized Left-Corner Parsing (1993)

by Mark-jan Nederhof
Venue:In Sixth Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference
Citations:23 - 7 self

Documents Related by Co-Citation

656 An Efficient Context-Free Parsing Algorithm – J Earley - 1970
188 Efficient Parsing for Natural Language – M Tomita - 1986
82 Deterministic techniques for efficient non-deterministic parsers – Bernard Lang - 1974
27 Polynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars – Yves Schabes, Of Arbitrary Context-free Grammars - 1991
120 The Structure of Shared Forests in Ambiguous Parsing – Sylvie Billot, Bernard Lang - 1989
17 A recursive ascent Earley parser – R Leermakers - 1992
49 Deterministic left corner parsing – S Rosenkrantz, P Lewis - 1970
17 An Optimal Tabular Parsing Algorithm – Mark-jan Nederhof
21 How to Cover a Grammar – RenĂ© Leermakers - 1989
3843 Introduction to Automata Theory, Languages, and Computation (2nd Edition – R M J E Hopcroft, J Ullman - 2000
95 Parser Generation for Interactive Environments – Jan Rekers - 1992
10 An Extended Theory Of Head-Driven Parsing – Mark-jan Nederhof - 1994
38 BUP: a bottom up parser embedded in Prolog – Y Matsumoto, H Tanaka, H Hirakawa, H Miyoshi, H Yasukawa - 1983
69 Parsing Schemata – Klaas Sikkel - 1993
188 An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities – Andreas Stolcke - 2002
83 An Improved Context-free Recognizer – Susan t Graham, Michael A Harrison, Walter L Ruzzo - 1980
344 Definite clause grammars for language analysis - a survey of the formalism and a comparison with augmented transition networks – Femando C N Pereira, H D David, Warren - 1980
13 On the relative efficiencies of context-free grammar recognizers – T Griffiths, S Petrick - 1965
48 Head-driven parsing – Martin Kay - 1990