Learning mildly context-sensitive languages with multidimensional substitutability from positive data

研究成果: Conference contribution

16 被引用数 (Scopus)

抄録

Recently Clark and Eyraud (2007) have shown that substitutable context-free languages, which capture an aspect of natural language phenomena, are efficiently identifiable in the limit from positive data. Generalizing their work, this paper presents a polynomial-time learning algorithm for new subclasses of mildly context-sensitive languages with variants of substitutability.

本文言語English
ホスト出版物のタイトルAlgorithmic Learning Theory - 20th International Conference, ALT 2009, Proceedings
ページ278-292
ページ数15
DOI
出版ステータスPublished - 2009 12 1
外部発表はい
イベント20th International Conference on Algorithmic Learning Theory, ALT 2009 - Porto, Portugal
継続期間: 2009 10 32009 10 5

出版物シリーズ

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

Other

Other20th International Conference on Algorithmic Learning Theory, ALT 2009
国/地域Portugal
CityPorto
Period09/10/309/10/5

ASJC Scopus subject areas

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

フィンガープリント

「Learning mildly context-sensitive languages with multidimensional substitutability from positive data」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル