Polynomial-time identification of an extension of very simple grammars from positive data

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

The class of very simple grammars is known to be polynomialtime identifiable in the limit from positive data. This paper introduces an extension of very simple grammars called right-unique simple grammars, and presents an algorithm that identifies right-unique simple grammars in the limit from positive data. The learning algorithm possesses the following three properties. It computes a conjecture in polynomial time in the size of the input data if we regard the cardinality of the alphabet as a constant. It always outputs a grammar which is consistent with the input data. It never changes the conjecture unless the newly provided example contradicts the previous conjecture. The algorithm has a sub-algorithm that solves the inclusion problem for a superclass of right-unique simple grammars, which is also presented in this paper.

本文言語English
ホスト出版物のタイトルGrammatical Inference
ホスト出版物のサブタイトルAlgorithms and Applications - 8th International Colloquium, ICGI 2006, Proceedings
出版社Springer Verlag
ページ45-58
ページ数14
ISBN(印刷版)3540452648, 9783540452645
DOI
出版ステータスPublished - 2006
外部発表はい
イベント8th International Colloquium on Grammatical Inference, ICGI 2006 - Tokyo, Japan
継続期間: 2006 9 202006 9 22

出版物シリーズ

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

Other

Other8th International Colloquium on Grammatical Inference, ICGI 2006
国/地域Japan
CityTokyo
Period06/9/2006/9/22

ASJC Scopus subject areas

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

フィンガープリント

「Polynomial-time identification of an extension of very simple grammars from positive data」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル