Skip to main content
Springer Nature Link
Log in

Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark’s Algorithm

  • Conference paper
Formal Grammar (FG 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8612))

Included in the following conference series:

  • 669 Accesses

Abstract

A. Clark[2] has shown that the class of languages which have a context-free grammar whose nonterminals can be defined by a finite set of contexts can be identified in the limit, given an enumeration of the language and a test for membership. We show by example that Clark’s algorithm may converge to a grammar that does not define the input language. We review the theoretical background, provide a non-obvious modification of the algorithm and prove its correctness.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. Clark, A.: A learnable representation for syntax using residuated lattices. In: de Groote, P., Egg, M., Kallmeyer, L. (eds.) FG 2009. LNCS, vol. 5591, pp. 183–198. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Clark, A.: Learning context free grammars with the syntactic concept lattice. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 38–51. Springer, Heidelberg (2010)

    Google Scholar 

  3. Harris, Z.S.: From morpheme to utterance. Language 22(3), 161–183 (1946)

    Article  Google Scholar 

  4. Jipsen, P., Tsinakis, C.: A survey of residuated lattices. In: Martinez, J. (ed.) Ordered Algebraic Structures, pp. 19–56. Kluwer (2002)

    Google Scholar 

  5. Leiß, H.: Learning CFGs with the finite context property. A note on A. Clark’s algorithm. Universität München, CIS, Manuscript (July 2012)

    Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)

    Google Scholar 

  7. Wurm, C.: Completeness of full Lambek calculus for syntactic concept lattices. In: Morrill, G., Nederhof, M.-J. (eds.) Formal Grammar 2012 and 2013. LNCS, vol. 8036, pp. 126–141. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Yoshinaka, R.: Towards dual approaches for learning context-free grammars based on syntactic concept lattices. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 429–440. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centrum für Informations- und Sprachverarbeitung, Universität München, Oettingenstr.67, 80538, München, Germany

    Hans Leiß

Authors
  1. Hans Leiß
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes,Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado,1-3, 08034, Barcelona, Spain

    Glyn Morrill

  2. Department of Philosophy, Tilburg University, P.O. Box 90153, NL 5000, LE Tilburg, The Netherlands

    Reinhard Muskens

  3. Department of Linguistics and Information Science, Heinrich-Heine-University Düsseldorf, Universitätsstrasse 1, 40225, Düsseldorf, Germany

    Rainer Osswald

  4. Institute for English and American Studies, Department of Linguistic, Goethe University Frankfurt am Main, Grüneburgplatz 1, 60323, Frankfurt, Germany

    Frank Richter

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leiß, H. (2014). Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark’s Algorithm. In: Morrill, G., Muskens, R., Osswald, R., Richter, F. (eds) Formal Grammar. FG 2014. Lecture Notes in Computer Science, vol 8612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44121-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44121-3_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44120-6

  • Online ISBN: 978-3-662-44121-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics