Skip to main content
SpringerLink
Log in

A Local Search Algorithm for Grammatical Inference

  • Conference paper
Grammatical Inference: Theoretical Results and Applications (ICGI 2010)

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

Included in the following conference series:

Abstract

In this paper, a heuristic algorithm for the inference of an arbitrary context-free grammar is presented. The input data consist of a finite set of representative words chosen from a (possibly infinite) context-free language and of a finite set of counterexamples—words which do not belong to the language. The time complexity of the algorithm is polynomially bounded. The experiments have been performed for a dozen or so languages investigated by other researchers and our results are reported.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D.: An application of the theory of computational complexity to the study of inductive inference. Doctoral Thesis. UMI Order Number: AAI7704361, University of California, Berkeley (1976)

    Google Scholar 

  2. Angluin, D.: Queries and concept learning. Mach. Learn. 2, 319–342 (1998)

    Google Scholar 

  3. Clark, A.: Learning deterministic context free grammars: The Omphalos competition. Mach. Learn. 66, 93–110 (2007)

    Article  Google Scholar 

  4. Du, D.-Z., Ko, K.-I.: Problem Solving in Automata, Languages, and Complexity. John Wiley & Sons, Chichester (2001)

    Book  Google Scholar 

  5. Dupont, P.: Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: the GIG Method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 236–245. Springer, Heidelberg (1994)

    Google Scholar 

  6. Eyraud, R., Higuera, C., Janodet, J.: LARS: A learning algorithm for rewriting systems. Mach. Learn. 66, 7–31 (2007)

    Article  Google Scholar 

  7. Giordano, J.Y.: Grammatical inference using tabu search. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol. 1147, pp. 292–300. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  8. Gold, E.M.: Language identification in the limit. Inform. and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  9. Gold, E.M.: Complexity of automaton identification from given data. Inform. and Control 37, 302–320 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  10. Grune, D., Jacobs, C.J.: Parsing Techniques: a Practical Guide. Ellis Horwood (2008)

    Google Scholar 

  11. Higuera, C.: A bibliographical study of grammatical inference. Pattern Recognition 38, 1332–1348 (2005)

    Article  Google Scholar 

  12. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  13. Lankhorst, M.M.: Breeding Grammars: Grammatical Inference with a Genetic Algorithm. Comp. Science Report CS-R9401, C.S. Department, Univ. of Gronigen, The Netherlands (1994)

    Google Scholar 

  14. Lothaire, M.: Algebraic Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications, Cambridge, vol. 90 (2002)

    Google Scholar 

  15. Lucas, S.M., Reynolds, T.J.: Learning deterministic finite automata with a smart state labelling evolutionary algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 1063–1074 (2005)

    Article  Google Scholar 

  16. Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages. Turku Centre for Computer Science Technical Report No. 222 (1998)

    Google Scholar 

  17. Miclet, L.: Grammatical inference. In: Syntactic and Structural Pattern Recognition, Theory and Applications, pp. 237–290. World Scientific, Singapore (1990)

    Google Scholar 

  18. Nakamura, K., Matsumoto, M.: Incremental learning of context free grammars based on bottom-up parsing and search. Pattern Recognition 38, 1384–1392 (2005)

    Article  MATH  Google Scholar 

  19. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Mineola (1998)

    Google Scholar 

  20. Pitt, L., Warmuth, M.: The minimum consistent DFA problem cannot be approximated within any polynomial. J. Assoc. Comput. Mach. 40, 95–142 (1993)

    MATH  MathSciNet  Google Scholar 

  21. Ryan, C., Colins, J., O’Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–95. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science 185, 15–45 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  23. Sakakibara, Y.: Learning context-free grammars using tabular representations. Pattern Recognition 38, 1372–1383 (2005)

    Article  MATH  Google Scholar 

  24. Tsoulos, I.G., Lagaris, I.E.: Grammar inference with grammatical evolution (2005), http://www.cs.uoi.gr/~lagaris/papers/PREPRINTS/meta_grammars.pdf

  25. Valiant, L.G.: A theory of the learnable. Communications of the ACM 27, 1134–1142 (1984)

    Article  MATH  Google Scholar 

  26. Wieczorek, W.: An algorithm for the decomposition of finite languages. Logic Journal of IGPL, 12 p. (2009), doi:10.1093/jigpal/jzp032

    Google Scholar 

  27. Wieczorek, W.: Metaheuristics for the Decomposition of Finite Languages. In: Recent Advances in Intelligent Information Systems, pp. 495–505 (2009) ISBN 978-83-60434-59-8

    Google Scholar 

  28. Yokomori, T., Kobayashi, S.: Inductive learning of regular sets from examples. In: Proceedings of International Workshop on Rough Sets and Soft Computing, pp. 570–577 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, Bedzinska 39, 41-200, Sosnowiec, Poland

    Wojciech Wieczorek

Authors
  1. Wojciech Wieczorek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Sistemas Informáticos y Computatión, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022, Valencia, Spain

    José M. Sempere  & Pedro García  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wieczorek, W. (2010). A Local Search Algorithm for Grammatical Inference. In: Sempere, J.M., García, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15488-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15487-4

  • Online ISBN: 978-3-642-15488-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation