The complexity and generative capacity of lexicalized abstract categorial grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3492 LNAI, Issue , 2005, Pages 330-346

  Yoshinaka, Ryo ^a,b   Kanazawa, Makoto ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; MEMBERSHIP FUNCTIONS; PROBLEM SOLVING;

ABSTRACT CATEGORIAL GRAMMARS; GENERATIVE CAPACITY; MEMBERSHIP PROBLEM; NP-COMPLETE LANGUAGES;

COMPUTATIONAL GRAMMARS;

EID: 33745138815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11422532_22     Document Type: Conference Paper

References (11)

1. Philippe de Groote. Towards abstract categorial grammars. In Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pages 148-155, 2001.
2. Philippe de Groote. Tree-adjoining grammars as abstract categorial grammars. In TAG+6, Proceedings of the 6th International Workshop on Tree Adjoining Grammars and Related Frameworks, pages 145-150. Università di Venezia, 2002.
3. Philippe de Groote, Bruno Guillaume, and Sylvain Salvati. Vector addition tree automata. In Proceedings of the 19th Annual IEEE symposium on Logic in Computer Science, pages 64-73, July 2004.
4. Philippe de Groote and Sylvain Pogodalla. m-linear context-free rewriting systems as abstract categorial grammars. In R.T. Oehrle et J.Rogers, editor, Proceedings of Mathematics of Language - MOL-8, Bloomington, Indiana, U. S., pages 71-80, June 2003.
5. Philippe de Groote and Sylvain Pogodalla. On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information, 13(4):421-438, 2004.
6. John E. Hopcroft and Jean-Jacques Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8(2):135-159, 1979.
7. Max I. Kanovich. The complexity of Horn fragments of linear logic. Annals of Pure and Applied Logic, 69:195-241, 1994.
8. Marcus Kracht. The Mathematics of Language, volume 63 of Studies in Generative Grammar, pages 447-459. Mouton de Gruyter, 2003.
9. Richard J. Lipton. The reachability problem requires exponential space. Technical Report 62, Department of Computer Science, Yale University, January 1976.
10. Reinhard Muskens. Language, lambdas, and logic. In Geert-Jan Kruijff and Richard Oehrle, editors, Resource Sensitivity in Binding and Anaphora, Studies in Linguistics and Philosophy, pages 23-54. Kluwer, 2003.
11. William C. Rounds. Complexity of recognition in intermediate-level languages. In Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, pages 145-158, October 1973.