Encyclopedia of Machine Learning

2010 Edition
| Editors: Claude Sammut, Geoffrey I. Webb

Grammatical Inference

  • Lorenza Saitta
  • Michele Sebag
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30164-8_346



Grammatical inference is concerned with inferring grammars from positive (and possibly negative) examples (Angluin,  1978; Korfiatis & Paliouras,  2008; Sakakibara,  2005). A context-free grammar (CFG) \(\mathcal{G}\)
This is a preview of subscription content, log in to check access.


  1. Angluin D. (1978). On the complexity of minimum inference of regular sets. Information and Control, 39, 337–350.MathSciNetMATHCrossRefGoogle Scholar
  2. Korfiatis, G., & Paliouras, G. (2008). Modeling web navogation using grammatical inference. Applied Artificial Intelligence, 22(1–2), 116–138.CrossRefGoogle Scholar
  3. Lang, K. J., Pearlmutter, B. A., & Price, R. A. (1998). Results of the abbadingo one dfa learning competition and a new evidence-driven state merging algorithm. In ICGI ’98: Proceedings of the 4th international colloquium on grammatical inference (pp. 1–12). Berlin: Springer.Google Scholar
  4. Oncina, J., & Garcia, P. (1992). Inferring regular languages in polynomial update time. In Pattern recognition and image analysis, (Vol. 1, pp. 49–61). World Scientific.Google Scholar
  5. Sakakibara, Y. (2005). Grammatical inference in bioinformatics. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7), 1051–1062.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Lorenza Saitta
    • 1
  • Michele Sebag
    • 2
  1. 1.Università del Piemonte OrientaleAlessandriaItaly
  2. 2.CNRS − INRIA − Université Paris-SudOrsayFrance