The complexity and generative capacity of lexicalized abstract categorial grammars

Ryo Yoshinaka, Makoto Kanazawa

研究成果: Conference contribution

9 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルLogical Aspects of Computational Linguistics - 5th International Conference, LACL 2005, Proceedings
出版社Springer Verlag
ページ330-346
ページ数17
ISBN(印刷版)3540257837, 9783540257837
DOI
出版ステータスPublished - 2005 1 1
外部発表はい
イベント5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005 - Bordeaux, France
継続期間: 2005 4 282005 4 30

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3492 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other5th International Conference on Logical Aspects of Computational Linguistics, LACL 2005
国/地域France
CityBordeaux
Period05/4/2805/4/30

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「The complexity and generative capacity of lexicalized abstract categorial grammars」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル