Skip to main content

A Framework for Inductive Learning of Typed-Unification Grammars

  • Conference paper
  • First Online:
Grammatical Inference: Algorithms and Applications (ICGI 2002)

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

Included in the following conference series:

Abstract

LIGHT, the parsing system for typed-unification grammars [3], was recently extended so to allow the automate learning of attribute/feature paths values. Motivated by the logic design of these grammars [2], the learning strategy we adopted is inspired by Inductive Logic Programming [5]; we proceed by searching through hypothesis spaces generated by logic transformations of the input grammar. Two procedures — one for generalisation, the other for specialisation — are in charge with the creation of these hypothesis spaces.

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

Access this chapter

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
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. H. Aït-Kaci and A. Podelski. Towards a meaning of LIFE. Journal of Logic Programming, 16:195–234, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. B. Carpenter. The Logic of Typed Feature Structures-with applications to unification grammars, logic programs and constraint resolution. Cambridge University Press, 1992.

    Google Scholar 

  3. L. Ciortuz. LIGHT — a constraint language and compiler system for typed-unification grammars. In Proceedings of the 25th German Conference on Artificial Intelligence (KI-2002), Aachen, Germany, September 16–20, 2002. Springer-Verlag.

    Google Scholar 

  4. A. Copestake, D. Flickinger, and I. Sag. A Grammar of English in HPSG: Design and Implementations. Stanford: CSLI Publications, 1999.

    Google Scholar 

  5. S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19,20:629–679, 1994.

    Article  MathSciNet  Google Scholar 

  6. C. Pollard and I. Sag. Head-driven Phrase Structure Grammar. Center for the Study of Language and Information, Stanford, 1994.

    Google Scholar 

  7. S. M. Shieber, H. Uszkoreit, F. C. Pereira, J. Robinson, and M. Tyson. The formalism and implementation of PATR-II. In J. Bresnan, editor, Research on Interactive Acquisition and Use of Knowledge. SRI International, Menlo Park, Calif., 1983.

    Google Scholar 

  8. G. Smolka and R. Treinen, editors. The DFKI Oz documentation series. German Research Center for Artificail Intelligence (DFKI), Stuhlsatzenhausweg 3, Sarrbrücken, Germany, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciortuz, L. (2002). A Framework for Inductive Learning of Typed-Unification Grammars. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2002. Lecture Notes in Computer Science(), vol 2484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45790-9_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45790-9_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45790-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics