Efficient parsing for bilexical context-free grammars and head Automaton Grammars

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1999-June, Issue , 1999, Pages 457-464

  Eisner, Jason ^a   Satta, Giorgio ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; STOCHASTIC SYSTEMS;

BILEXICAL GRAMMARS; CONTEXT-FREE GRAMMARS; PARSING ALGORITHM; STOCHASTIC PARSERS; UPPER BOUND;

CONTEXT FREE GRAMMARS;

EID: 85149142007     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A. V. Aho and J. D. Ullman. 1972. The Theory of Parsing, Translation and Compiling, volume 1. Prentice-Hall, Englewood Cliffs, NJ.
2. H. Alshawi. 1996. Head automata and bilingual tiling: Translation with minimal representations. In Proc. ofACL, pages 167-176, Santa Cruz, CA.
3. Y. Bar-Hillel. 1953. A quasi-arithmetical notation for syntactic description. Language, 29:47-58.
4. E. Charniak. 1997. Statistical parsing with a context-free grammar and word statistics. In Proc. o]the l~th AAAI, Menlo Park.
5. C. Chelba and F. Jelinek. 1998. Exploiting syntactic structure for language modeling. In Proc. of COLING-ACL.
6. N. Chomsky. 1965. Aspects of the Theory o]Syntax. MIT Press, Cambridge, MA.
7. M. Collins and J. Brooks. 1995. Prepositional phrase attachment through a backed-off model. In Proe. of the Third Workshop on Very Large Corpora, Cambridge, MA.
8. M. Collins. 1997. Three generative, lexicalised models for statistical parsing. In Proc. of the 35th ACL and 8th European ACL, Madrid, July.
9. J. Eisner. 1996. An empirical comparison of probability models for dependency grammar. Technical Report IRCS-96-11, IRCS, Univ. of Pennsylvania.
10. J. Eisner. 1997. Bilexical grammars and a cubic-time probabilistic parser. In Proceedings of the ~th Int. Workshop on Parsing Technologies, MIT, Cambridge, MA, September.
11. R. C. Gonzales and M. G. Thomason. 1978. Syntactic Pattern Recognition. Addison-Wesley, Reading, MA.
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. M. Kay. 1986. Algorithm schemata and data structures in syntactic processing. In K. Sparck Jones B. J. Grosz and B. L. Webber, editors, Natural Language Processing, pages 35-70. Kaufmann, Los Altos, CA.
15. J. Lafferty, D. Sleator, and D. Temperley. 1992. Grammatical trigrams: A probabilistic model of link grammar. In Proc. of the AAAI Conf. on Probabilistic Approaches to Nat. Lang., October.
16. D. Magerman. 1995. Statistical decision-tree models for parsing. In Proceedings of the 33rd A CL.
17. I. Mel'~uk. 1988. Dependency Syntax: Theory and Practice. State University of New York Press.
18. C. Pollard and I. Sag. 1994. Head-Driven Phrase Structure Grammar. University of Chicago Press.
19. Y. Schabes, A. Abeill@, and A. Joshi. 1988. Parsing strategies with 'lexicalized' grammars: Application to Tree Adjoining Grammars. In Proceedings of COLING-88, Budapest, August.
20. Yves Schabes. 1992. Stochastic lexicalized tree-adjoining grammars. In Proc. of the l~th COL-ING, pages 426-432, Nantes, France, August.
21. C. S. Wetherell. 1980. Probabilistic languages: A review and some open questions. Computing Surveys, 12(4):361-379.
22. D. H. Younger. 1967. Recognition and parsing of context-free languages in time n 3. Information and Control, 10(2):189-208, February.