Robert M. Harlan
Abstract
Developing laboratory assignments on natural language processing in an introductory AI course is difficult. One reason is that the interpreter that applies a grammar to input is often a complex, hard to understand system. One is forced either to treat the interpreter as a black box, restricting students to extending the grammar that it applies, or to spend an inordinate amount of time mastering the interpreter. We present an alternative that enables students to master an interpreter in fairly short order. Approaching parsing as a search problem, an interpreter is presented that is based on a search engine with which students have had previous experience. This paper discusses an interpreter for an RTN grammar. A subsequent paper shows how the interpreter can be modified to handle an ATN grammar. The grammar and interpreter are available via ftp.
- Allen, James. Natural Language Understanding. Reading, MA: Benjamin/Cummings Publishing, 1987.Google Scholar
- Johnson, Roderick. "Parsing with Transition Networks," Parsing Natural Language. New York: Academic Press, 1983.Google Scholar
- Winston, Patrick. Lisp: Second Addition. Reading, MA: Addison-Wesley Publishing, 1984.Google Scholar
Index Terms
- Parsing as search: an easy-to-understand RTN interpreter
Recommendations
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
Left recursion in Parsing Expression Grammars
Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of rules that specify a top-down parser for some language. PEGs are easy to use, and there are efficient implementations of PEG ...
Comments