Left-to-right parsing and bilexical context-free grammars

1st Meeting of the North American Chapter of the Association for Computational Linguistics, NAACL 2000 - co-located with 6th Applied Natural Language Processing Conference, ANLP 2000 - Proceedings

Volumn , Issue , 2000, Pages 272-279

  Nederhof, Mark Jan ^a   Satta, Giorgio ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES;

ASYMPTOTIC TIME COMPLEXITY; COMPLEXITY RESULTS; CONTEXT-FREE GRAMMARS; GRAMMAR FORMALISMS; LANGUAGE MODEL; PROPERTY; REAL-WORLD; STATE OF THE ART; TIME BOUND;

CONTEXT FREE GRAMMARS;

EID: 84895854631     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
2. thACL, pages 167-176, Santa Cruz, CA.
3. E. Charniak. 1997. Statistical parsing with a context-free grammar and word statistics. In Proc. of AAAI-97, Menlo Park, CA.
4. thACL, Montreal, Canada.
5. thACL, Madrid, Spain.
6. J. Earley. 1970. An efficient context-free parsing algorithm. Communications of the Association for Computing Machinery, 13 (2) :94-102.
7. thACL, pages 457-464, College Park, Maryland.
8. J. Eisner. 1996. An empirical comparison of probability models for dependency grammar. Technical Report IRCS-96-11, IRCS, Univ. of Pennsylvania.
9. J. Eisner. 1997. Bilexical grammars and a cubictime probabilistic parser. In Proceedings of the 4th Int. Workshop on Parsing Technologies, MIT, Cambridge, MA, September.
10. R. C. Gonzales and M. G. Thomason. 1978. Syntactic Pattern Recognition. Addison-Wesley, Reading, MA.
11. D. Gusfield. 1997. Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge, UK.
12. M. A. Harrison. 1978. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA.
13. J. E. Hopcroft and J. D. Ullman. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA.
14. A. R. Meyer and M. J. Fisher. 1971. Economy of description by automata, grammars and formal systems. In 12th Annual Symp. on Switching and Automata Theory, pages 188-190, New York. IEEE.
15. thACL, pages 239-246, Santa Cruz, CA.
16. ndACL, pages 117-124, Las Cruces, New Mexico.
17. A. Ratnaparkhi. 1997. A linear observed time statistical parser based on maximum entropy models. In Second Conference on Empirical Methods in Natural Language Processing, Brown University, Providence, Rhode Island.
18. thAnnual Symposium on Switching and Automata Theory, pages 139-152.
19. G. Satta and O. Stock. 1994. Bidirectional contextfree grammar parsing for natural language processing. Artificial Intelligence, 69:123-164.
20. S. Sippu and E. Soisalon-Soininen. 1988. Parsing Theory: Languages and Parsing, volume 1. Springer-Verlag, Berlin, Germany.
21. S. Sippu and E. Soisalon-Soininen. 1990. Parsing Theory: LR (k) and LL (k) Parsing, volume 2. Springer-Verlag, Berlin, Germany.
22. R. E. Stearns and H. B. Hunt. 1981. On the equivalence and containment problem for unambiguous regular expressions, grammars, and automata. In 22nd Annual Symp. on Foundations of Computer Science, pages 74-81, New York. IEEE.
23. M. Tomita. 1986. Efficient Parsing for Natural Language. Kluwer, Boston, Mass.
24. G. van Noord. 1997. An efficient implementation of the head-corner parser. Computational Linguistics, 23 (3) :425-456.
25. C. S. Wetherell. 1980. Probabilistic languages: A review and some open questions. Computing Surveys, 12 (4) :361-379.
26. rdEACL, pages 226-233, Copenhagen, Denmark.