Skip to main content

Experiments in Inductive Chart Parsing

  • Chapter
  • First Online:

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

Abstract

We use Inductive Logic Programming (ILP) within a chartparsing framework for grammar learning. Given an existing grammar G, together with some sentences which G can not parse, we use ILP to find the “missing” grammar rules or lexical items. Our aim is to exploit the inductive capabilities of chart parsing, i.e. the ability to efficiently determine what is needed for a parse. For each unparsable sentence, we find actual edges and needed edges: those which are needed to allow a parse. The former are used as background knowledge for the ILP algorithm (PProgol) and the latter are used as examples for the ILP algorithm. We demonstrate our approach with a number of experiments using contextfree grammars and a feature grammar.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cussens, J., & Pulman, S. (2000). Incorporating linguistics constraints into inductive logic programming. In Proc. LLL-2000. To appear.

    Google Scholar 

  2. Kazakov, D., Pulman, S., & Muggleton, S. (1998). The FraCaS dataset and the LLL challenge. Unpublished.

    Google Scholar 

  3. Mellish, C. (1989). Some chart based techniques for parsing ill-formed input. In Proc 27th ACL, pp. 102–109 Vancouver, BC. ACL.

    Google Scholar 

  4. Osborne, M., & Bridge, D. (1994). Learning unification-based grammars using the Spoken English Corpus. In Grammatical Inference and Applications, pp. 260–270. Springer Verlag.

    Google Scholar 

  5. Parson, R., Khan, K., & Muggleton, S. (1999). Theory recovery. In Proc. of the 9th International Workshop on Inductive Logic Programming (ILP-99) Berlin. Springer-Verlag.

    Google Scholar 

  6. Pereira, F., & Warren, D. (1983). Parsing as deduction. In Proc 21st ACL, pp. 137–144 Cambridge Mass. ACL.

    Google Scholar 

  7. Shieber, S. M., Schabes, Y., & Pereira, F. C. N. (1995). Principles and implementation of deductive parsing. Journal of Logic Programming, 24 (1-2), 3–26.

    Article  MATH  MathSciNet  Google Scholar 

  8. Zelle, J. M., & Mooney, R. J. (1996). Learning to parse database queries using inductive logic programming. In Proceedings of the Thirteenth National Conference on Artificial Intelligence Portland, OR.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cussens, J., Pulman, S. (2000). Experiments in Inductive Chart Parsing. In: Cussens, J., Džeroski, S. (eds) Learning Language in Logic. LLL 1999. Lecture Notes in Computer Science(), vol 1925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40030-3_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-40030-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41145-1

  • Online ISBN: 978-3-540-40030-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics