Parsing with an extended domain of locality

9th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1999

Volumn , Issue , 1999, Pages 217-224

  Carroll, John ^a   Nicolov, Nicolas ^a   Shaumyan, Olga ^a   Smets, Martine ^a   Weir, David ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE STRUCTURE; TREE ADJOINING GRAMMARS;

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

References (18)

1. Hassan Ait-Kaci. 1984. A Lattice Theoretic Approach to Computation Based on a Calculus of Partially Ordered Type Structures. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA.
2. Marie-Hélène Candito. 1996. A principle-based hierarchical representation of LTAGs. In Proceedings of the 16th International Conference on Computational Linguistics, Copenhagen, Denmark, August.
3. John Carroll, Nicolas Nicolov, Olga Shaumyan, Martine Smets, and David Weir. 1998. The LEXSYS Project. In Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, pages 29-33.
4. Martin Emele. 1991. Unification with lazy non-redundant copying. In Proceedings of the 29th Meeting of the Association for Computational Linguistics, pages 323-330, Berkeley, CA.
5. Roger Evans and David Weir. 1998. A structure-sharing parser for lexicalized grammars. In Proceedings of the 36th Meeting of the Association for Computational Linguistics and the 17th International Conference on Computational Linguistics, pages 372-378.
6. Roger Evans, Gerald Gazdar, and David Weir. 1995. Encoding lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy. In Proceedings of the 33rd Meeting of the Association for Computational Linguistics, pages 77-84.
7. G. P. Huet. 1975. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57.
8. Aravind Joshi and B. Srinivas. 1994. Disambiguation of super parts of speech (or supertags): Almost parsing. In Proceedings of the 15th International Conference on Computational Linguistics, pages 154-160.
9. Aravind Joshi. 1994. Preface to special issue on Tree-Adjoining Grammars. Computational Intelligence, 10(4):vii-xv.
10. Lauri Karttunen. 1986. D-PATR: A development environment for unification-based grammars. In Proceedings of the 11th International Conference on Computational Linguistics, pages 74-80, Bonn, Germany.
11. Kiyoshi Kogure. 1990. Strategic lazy incremental copy graph unification. In Proceedings of the 13th International Conference on Computational Linguistics, pages 223-228, Helsinki.
12. Fernando Pereira. 1985. A structure-sharing representation for unification-based grammar formalisms. In Proceedings of the 23rd Meeting of the Association for Computational Linguistics, pages 137-144.
13. Carl Pollard and Ivan Sag. 1994. Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago.
14. Owen Rambow, K. Vijay-Shanker, and David Weir. 1995. D-Tree Grammars. In Proceedings of the 33rd Meeting of the Association for Computational Linguistics, pages 151-158.
15. Yves Schabes. 1990. Mathematical and Computational Aspects of Lexicalized Grammars. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.
16. Hideto Tomabechi. 1991. Quasi-destructive graph unification. In Proceedings of the 29th Meeting of the Association for Computational Linguistics, pages 315-322, Berkeley, CA.
17. The XTAG-Group. 1995. A lexicalized Tree Adjoining Grammar for English. Technical Report IRCS Report 95-03, The Institute for Research in Cognitive Science, University of Pennsylvania.
18. The XTAG-Group. 1999. A lexicalized Tree Adjoining Grammar for English. Technical Report http://www.cis.upenn.edu/~xtag/tech.-report/tech.-report.html, The Institute for Research in Cognitive Science, University of Pennsylvania.