Name
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. |
Year | Venue | Keywords |
|---|---|---|
1999 | Learning Language in Logic | existing grammar,ilp algorithm,actual edge,grammar learning,feature grammar,inductive logic programming,grammar rule,needed edge,contextfree grammar,inductive chart parsing |
Field | DocType | ISBN |
Inductive logic programming,Attribute grammar,Top-down parsing,Programming language,Extended Affix Grammar,Lexical item,Computer science,Grammar,Artificial intelligence,Natural language processing,Parsing,Parser combinator | Conference | 3-540-41145-3 |
Citations | PageRank | References |
4 | 0.48 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Cussens | 1 | 503 | 50.29 |
| Stephen Pulman | 2 | 450 | 38.31 |