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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cussens, J., & Pulman, S. (2000). Incorporating linguistics constraints into inductive logic programming. In Proc. LLL-2000. To appear.
Kazakov, D., Pulman, S., & Muggleton, S. (1998). The FraCaS dataset and the LLL challenge. Unpublished.
Mellish, C. (1989). Some chart based techniques for parsing ill-formed input. In Proc 27th ACL, pp. 102–109 Vancouver, BC. ACL.
Osborne, M., & Bridge, D. (1994). Learning unification-based grammars using the Spoken English Corpus. In Grammatical Inference and Applications, pp. 260–270. Springer Verlag.
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.
Pereira, F., & Warren, D. (1983). Parsing as deduction. In Proc 21st ACL, pp. 137–144 Cambridge Mass. ACL.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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