Experiments in Inductive Chart Parsing

James Cussens, Stephen Pulman

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution


We use Inductive Logic Programming (ILP) within a chart-parsing 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 (P-Progol) and the latter are used as examples for the ILP algorithm. We demonstrate our approach with a number of experiments using context-free grammars and a feature grammar.
Original languageEnglish
Title of host publicationLearning Language in Logic
EditorsJames Cussens, Saso Dzeroski
Publication statusPublished - 2000

Publication series


Cite this