Parsing MCS languages with thread automata

TAG+ 2002 - Proceedings of the 6th International Workshop on Tree Adjoining Grammar and Related Frameworks

Volumn , Issue , 2002, Pages 193-200

  de la Clergerie, Éric Villemonte ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (9)

1. Boullier, Pierre. 1999. On Multicomponent TAG Parsing. In TALN'99, pages 321-326, Cargèse, Corse, France, July.
2. Boullier, Pierre. 2000a. On TAG Parsing. Traitement Automatique des Langues (T.A.L.), 41(3):111-131. issued June 2001.
3. Boullier, Pierre. 2000b. Range Concatenation Grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT2000), pages 53-64, Trento, Italy, February.
4. Joshi, Aravind K. 1987. An Introduction to Tree Adjoining Grammars. In Alexis Manaster-Ramer, editor, Mathematics of Language. John Benjamins Publishing Co., Amsterdam/Philadelphia, pages 87-115.
5. Éric Villemonte de la Clergerie. 2001. Refining tabular parsers for TAGs. In Proceedings of NAACL'01, June.
6. Vijay-Shanker, K. 1988. A Study of Tree Adjoining Grammars. Ph.D. thesis, University of Pennsylvania, January. Available as Technical Report MS-CIS-88-03 LINC LAB 95 of the Department of Computer and Information Science, University of Pennsylvania.
7. Villemonte de la Clergerie, Eric and Miguel A. Alonso Pardo. 1998. A tabular interpretation of a class of 2-Stack Automata. In Proc. of ACL/COLING'98, August.
8. Weir, David. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania.
9. Weir, David. 1992. Linear context-free rewriting systems and deterministic tree-walking transducers. In Proc. of ACL'92.