Skip to main content
Springer Nature Link
Log in

The Boisdale Algorithm – An Induction Method for a Subclass of Unification Grammar from Positive Data

  • Conference paper
Grammatical Inference: Algorithms and Applications (ICGI 2004)

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

Included in the following conference series:

  • 372 Accesses

Abstract

This paper introduces a new grammatical inference algorithm called the Boisdale algorithm. This algorithm can identify a class of context-free unification grammar in the limit from positive data only. The Boisdale algorithm infers both the syntax and the semantics of the language, where the semantics of the language can be described using arbitrarily complex data structures represented as key value pairs. The Boisdale algorithm is an alignment based learning algorithm that executes in polynomial time with respect to the length of the training data and can infer a grammar when presented with any set of sentences tagged with any data structure. This paper includes a description of the algorithm, a description of a class of language that it can identify in the limit and some experimental results.

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.

Similar content being viewed by others

References

  1. Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Prentice-Hall, Englewood Cliffs (1972)

    Google Scholar 

  2. Allen, J.: Natural language understanding, 2nd edn. Benjamin/ Cummings Pub. Co, Redwood City (1995)

    MATH  Google Scholar 

  3. Angluin, D.: Inductive inference of formal grammars from positive data. Information and Control 45, 117–135 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. de la Higuera, C., Oncina, J.: Learning context-free grammars. In: Proceedings of ECML Workshop and Tutorial on Learning Context-free Grammars, Cavtat-Dubrovnik Croatia, pp. 6–19 (2003)

    Google Scholar 

  5. Gold, E.M.: Grammar identification in the limit. Information and Control 10(5), 447–474 (1967)

    Article  MATH  Google Scholar 

  6. Otto, F.: On deciding the confluence of a finite string-rewriting system on a given congruence class. Journal of Computer and System Sciences 35, 285–310 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pereira, F.C.N., Warren, D.H.D.: Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence Review 13(3), 231–278 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  8. Starkie, B.: Inferring attribute grammars with structured data for natural language processing. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 237–248. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Starkie, B.: Left aligned grammars - Identifying a class of context-free grammar in the limit from positive data. In: Proceedings of ECML Workshop and Tutorial on Learning Context-free Grammars, Cavtat-Dubrovnik Croatia, pp. 90–101 (2003)

    Google Scholar 

  10. Starkie, B., Fernau, H.: The Boisdale algorithm - Identifying a class of unification grammar in the limit from positive data. Addendum A - Proof sketches.University of Newcastle School of Electrical Engineering and Computer Science, Callaghan, NSW Australia 2308 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Telstra Research Laboratories, 770 Blackburn Rd Clayton, Melbourne, Victoria, 3127, Australia

    Bradford Starkie

  2. School of Electrical Engineering and Computer Science, University of Newcastle, University Drive, NSW 2308, Callaghan, Australia

    Bradford Starkie & Henning Fernau

  3. Theoretische Informatik, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Henning Fernau

Authors
  1. Bradford Starkie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics and Telecommunications, National Centre for Scientific Research “Demokritos”, Athens, Greece

    Georgios Paliouras

  2. Department of Biosciences and Informatics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223-8522, Yokohama, Japan

    Yasubumi Sakakibara

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Starkie, B., Fernau, H. (2004). The Boisdale Algorithm – An Induction Method for a Subclass of Unification Grammar from Positive Data. In: Paliouras, G., Sakakibara, Y. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2004. Lecture Notes in Computer Science(), vol 3264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30195-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30195-0_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23410-4

  • Online ISBN: 978-3-540-30195-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics