Learning context-free grammars from partially structured examples

Yasubumi Sakakibara, Hidenori Muramatsu

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

29 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 languageEnglish
Title of host publicationGrammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings
PublisherSpringer Verlag
Pages229-240
Number of pages12
Volume1891
ISBN (Print)9783540452577
Publication statusPublished - 2000
Externally publishedYes
Event5th International Colloquium on Grammatical Inference, ICGI 2000 - Lisbon, Portugal
Duration: 2000 Sep 112000 Sep 13

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1891
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Colloquium on Grammatical Inference, ICGI 2000
CountryPortugal
CityLisbon
Period00/9/1100/9/13

Fingerprint

Context free grammars
Context-free Grammar
Learning algorithms
Learning Algorithm
Production Rules
Grammar
Eliminate
Strings
Learning
Gas

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Sakakibara, Y., & Muramatsu, H. (2000). Learning context-free grammars from partially structured examples. In Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings (Vol. 1891, pp. 229-240). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1891). Springer Verlag.

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

Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. Vol. 1891 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 proceedingConference contribution

Sakakibara, Y & Muramatsu, H 2000, Learning context-free grammars from partially structured examples. in Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. vol. 1891, 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.
Sakakibara Y, Muramatsu H. Learning context-free grammars from partially structured examples. In Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. Vol. 1891. Springer Verlag. 2000. p. 229-240. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sakakibara, Yasubumi ; Muramatsu, Hidenori. / Learning context-free grammars from partially structured examples. Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings. Vol. 1891 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",
year = "2000",
language = "English",
isbn = "9783540452577",
volume = "1891",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "229--240",
booktitle = "Grammatical Inference: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings",
address = "Germany",

}

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

M3 - Conference contribution

AN - SCOPUS:84974705310

SN - 9783540452577

VL - 1891

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: Algorithms and Applications - 5th International Colloquium, ICGI 2000, Proceedings

PB - Springer Verlag

ER -