Skip to main content
SpringerLink
Log in

Inference of context-free grammars by enumeration: Structural containment as an ordering bias

  • Conference paper
  • First Online:
Book cover Grammatical Inference and Applications (ICGI 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 862))

Included in the following conference series:

Abstract

The problem of inferring grammars from examples and counter-examples has been mostly studied for regular languages. Here we apply a classical approach, said by enumeration, to context-free grammars. Structural containment is used as an ordering relation, and associated operators are defined. Special attention is paid to computation time, hence our system cannot always reach all the solutions for a given problem. Though, our system is able to generalize efficiently, and the solutions found constitute a good description of the sample.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Vanlehn & W. Ball. A version space approach to learning context-free grammars. Machine learning, 2:39–74, 1987.

    Google Scholar 

  2. A.W. Biermann & J.A. Feldman. On the synthesis of finite-state machines from samples of their behaviour. IEEE Transactions on Computers, 1972.

    Google Scholar 

  3. A.W. Biermann & J.A. Feldman. A survey of results in grammatical inference. In Frontiers of pattern recognition, Academic Press, 1972.

    Google Scholar 

  4. J. Oncina & P. Garcia. Inferring regular languages in polynomial updated time. In IVth Spanish Symposium on Pattern Recognition and Image Analysis, 1992.

    Google Scholar 

  5. J-Y. Giordano. Version space for learning context-free grammars. In First International Colloquim on Grammatical Inference, 1993.

    Google Scholar 

  6. E. Gold. Identification in the limit. Information and control, 10:447–474, 1967.

    Article  Google Scholar 

  7. R. McNaughton. Parenthesis grammars. Journal of the association for computing machinery, 14:490–500, 1967.

    Google Scholar 

  8. L. Miclet. Regular inference with a tail clustering method. IEEE Transactions on SMC, 1980.

    Google Scholar 

  9. T.M. Mitchell. Generalization as search. Artificial Intelligence, 18:203–226, 1982.

    Google Scholar 

  10. A. Nijholt. Context-Free Grammars: Covers, Normal Forms and Parsing. Volume 93 of Lecture Notes in Computer Science, Springer Verlag, 1980.

    Google Scholar 

  11. H.B. Hunt & D.J. Rosenkrantz. Efficient algorithms for structural similarities of grammars. In Conference record of the 7th ACM Symposium on principals of programming languages, pages 213–219, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Recherche en Informatique et Systèmes Aléatoires, Campus de Beaulieu, 35042, Rennes, France

    Jean -Yves Giordano

Authors
  1. Jean -Yves Giordano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rafael C. Carrasco Jose Oncina

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giordano, J.Y. (1994). Inference of context-free grammars by enumeration: Structural containment as an ordering bias. In: Carrasco, R.C., Oncina, J. (eds) Grammatical Inference and Applications. ICGI 1994. Lecture Notes in Computer Science, vol 862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58473-0_150

Download citation

  • DOI: https://doi.org/10.1007/3-540-58473-0_150

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58473-5

  • Online ISBN: 978-3-540-48985-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation