Abstract
We show how several novel tools in logic programming for AI (namely, continuation based linear and timeless assumptions, and datalog grammars) can assist us in producing terse treatments of difficult language processing phenomena. As a proof of concept, we present a concise parser for datalog grammars (logic grammars where strings are represented with numbered word boundaries rather than as lists of words), that uses assumptions and a combination of left-corner parsing and charting. We then study two test cases of this parser's application: complete constituent coordination, and error diagnosis and correction.
Original language | English |
---|---|
Title of host publication | Proceedings - 12th IEEE Internationals Conference on Tools with Artificial Intelligence, ICTAI 2000 |
Publisher | IEEE Computer Society |
Pages | 11-18 |
Number of pages | 8 |
ISBN (Electronic) | 0769509096 |
DOIs | |
State | Published - 2000 |
Event | 12th IEEE Internationals Conference on Tools with Artificial Intelligence, ICTAI 2000 - Vancouver, Canada Duration: 13 Nov 2000 → 15 Nov 2000 |
Publication series
Name | Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI |
---|---|
Volume | 2000-January |
ISSN (Print) | 1082-3409 |
Conference
Conference | 12th IEEE Internationals Conference on Tools with Artificial Intelligence, ICTAI 2000 |
---|---|
Country/Territory | Canada |
City | Vancouver |
Period | 13/11/00 → 15/11/00 |
Bibliographical note
Publisher Copyright:© 2000 IEEE.
Keywords
- Artificial intelligence
- Automatic programming
- Databases
- Error correction
- Functional programming
- Logic programming
- Natural language processing
- Natural languages
- Testing