Learning context-free grammars from partially structured examples

Yasubumi Sakakibara; Hidenori Muramatsu

doi:10.1007/978-3-540-45257-7_19

Learning context-free grammars from partially structured examples

Yasubumi Sakakibara, Hidenori Muramatsu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

33 Citations (Scopus)

Abstract

In this paper, we consider the problem of inductively learning context-free grammars from partially structured examples. A structured example is represented by a string with some parentheses inserted to indicate the shape of the derivation tree of a grammar. We show that the partially structured examples contribute to improving the efficiency of the learning algorithm. We employ the GA-based learning algorithm for context-free grammars using tabular representations which Sakakibara and Kondo have proposed previously [7], and present an algorithm to eliminate unnecessary nonterminals and production rules using the partially structured examples at the initial stage of the GA-based learning algorithm. We also show that our learning algorithm from partially structured examples can identify a context-free grammar having the in- tended structure and is more flexible and applicable than the learning methods from completely structured examples [5].

Original language	English
Title of host publication	Grammatical Inference
Subtitle of host publication	Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings
Editors	Arlindo L. Oliveira
Publisher	Springer Verlag
Pages	229-240
Number of pages	12
ISBN (Print)	9783540452577
DOIs	https://doi.org/10.1007/978-3-540-45257-7_19
Publication status	Published - 2000
Externally published	Yes
Event	5th International Colloquium on Grammatical Inference, ICGI 2000 - Lisbon, Portugal Duration: 2000 Sept 11 → 2000 Sept 13

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1891
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	5th International Colloquium on Grammatical Inference, ICGI 2000
Country/Territory	Portugal
City	Lisbon
Period	00/9/11 → 00/9/13

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-45257-7_19

Cite this

Sakakibara, Y., & Muramatsu, H. (2000). Learning context-free grammars from partially structured examples. In A. L. Oliveira (Ed.), Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings (pp. 229-240). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1891). Springer Verlag. https://doi.org/10.1007/978-3-540-45257-7_19

Learning context-free grammars from partially structured examples. / Sakakibara, Yasubumi; Muramatsu, Hidenori.

Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. ed. / Arlindo L. Oliveira. Springer Verlag, 2000. p. 229-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1891).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sakakibara, Y & Muramatsu, H 2000, Learning context-free grammars from partially structured examples. in AL Oliveira (ed.), Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1891, Springer Verlag, pp. 229-240, 5th International Colloquium on Grammatical Inference, ICGI 2000, Lisbon, Portugal, 00/9/11. https://doi.org/10.1007/978-3-540-45257-7_19

Sakakibara Y, Muramatsu H. Learning context-free grammars from partially structured examples. In Oliveira AL, editor, Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. Springer Verlag. 2000. p. 229-240. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-45257-7_19

Sakakibara, Yasubumi ; Muramatsu, Hidenori. / Learning context-free grammars from partially structured examples. Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. editor / Arlindo L. Oliveira. Springer Verlag, 2000. pp. 229-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{02f93741b0cb47dd91e47defbd2a4b0c,

title = "Learning context-free grammars from partially structured examples",

abstract = "In this paper, we consider the problem of inductively learning context-free grammars from partially structured examples. A structured example is represented by a string with some parentheses inserted to indicate the shape of the derivation tree of a grammar. We show that the partially structured examples contribute to improving the efficiency of the learning algorithm. We employ the GA-based learning algorithm for context-free grammars using tabular representations which Sakakibara and Kondo have proposed previously [7], and present an algorithm to eliminate unnecessary nonterminals and production rules using the partially structured examples at the initial stage of the GA-based learning algorithm. We also show that our learning algorithm from partially structured examples can identify a context-free grammar having the in- tended structure and is more flexible and applicable than the learning methods from completely structured examples [5].",

author = "Yasubumi Sakakibara and Hidenori Muramatsu",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 5th International Colloquium on Grammatical Inference, ICGI 2000 ; Conference date: 11-09-2000 Through 13-09-2000",

year = "2000",

doi = "10.1007/978-3-540-45257-7_19",

language = "English",

isbn = "9783540452577",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "229--240",

editor = "Oliveira, {Arlindo L.}",

booktitle = "Grammatical Inference",

}

TY - GEN

T1 - Learning context-free grammars from partially structured examples

AU - Sakakibara, Yasubumi

AU - Muramatsu, Hidenori

PY - 2000

Y1 - 2000

N2 - In this paper, we consider the problem of inductively learning context-free grammars from partially structured examples. A structured example is represented by a string with some parentheses inserted to indicate the shape of the derivation tree of a grammar. We show that the partially structured examples contribute to improving the efficiency of the learning algorithm. We employ the GA-based learning algorithm for context-free grammars using tabular representations which Sakakibara and Kondo have proposed previously [7], and present an algorithm to eliminate unnecessary nonterminals and production rules using the partially structured examples at the initial stage of the GA-based learning algorithm. We also show that our learning algorithm from partially structured examples can identify a context-free grammar having the in- tended structure and is more flexible and applicable than the learning methods from completely structured examples [5].

AB - In this paper, we consider the problem of inductively learning context-free grammars from partially structured examples. A structured example is represented by a string with some parentheses inserted to indicate the shape of the derivation tree of a grammar. We show that the partially structured examples contribute to improving the efficiency of the learning algorithm. We employ the GA-based learning algorithm for context-free grammars using tabular representations which Sakakibara and Kondo have proposed previously [7], and present an algorithm to eliminate unnecessary nonterminals and production rules using the partially structured examples at the initial stage of the GA-based learning algorithm. We also show that our learning algorithm from partially structured examples can identify a context-free grammar having the in- tended structure and is more flexible and applicable than the learning methods from completely structured examples [5].

UR - http://www.scopus.com/inward/record.url?scp=84974705310&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84974705310&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-45257-7_19

DO - 10.1007/978-3-540-45257-7_19

M3 - Conference contribution

AN - SCOPUS:84974705310

SN - 9783540452577

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

SP - 229

EP - 240

BT - Grammatical Inference

A2 - Oliveira, Arlindo L.

PB - Springer Verlag

T2 - 5th International Colloquium on Grammatical Inference, ICGI 2000

Y2 - 11 September 2000 through 13 September 2000

ER -

Learning context-free grammars from partially structured examples

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this