The complexity and generative capacity of lexicalized abstract categorial grammars

Ryo Yoshinaka, Makoto Kanazawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Previous studies have shown that some well-known classes of grammars can be simulated by Abstract Categorial Grammars (de Groote 2001) in straightforward ways. These classes of grammars all generate subclasses of the PTIME languages. While the exact generative capacity of the class of ACGs and the complexity of its universal membership problem are both unknown, we show that the universal membership problem for the class of lexicalized ACGs is NP-complete and the languages generated by lexicalized ACGs form a subclass of NP which includes some NP-complete languages.

Original languageEnglish
Title of host publicationLogical Aspects of Computational Linguistics - 5th International Conference, LACL 2005, Proceedings
PublisherSpringer Verlag
Pages330-346
Number of pages17
ISBN (Print)3540257837, 9783540257837
DOIs
Publication statusPublished - 2005 Jan 1
Externally publishedYes
Event5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005 - Bordeaux, France
Duration: 2005 Apr 282005 Apr 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3492 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005
Country/TerritoryFrance
CityBordeaux
Period05/4/2805/4/30

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'The complexity and generative capacity of lexicalized abstract categorial grammars'. Together they form a unique fingerprint.

Cite this