Memoization of Top Down Parsing
Mark Johnson (Brown University)

TL;DR
This paper explores how memoization techniques can be applied to top-down parsers, linking them to chart parsers, and introduces a memoization method suitable for continuation-passing style programs to create a terminating parser.
Contribution
It presents a novel memoization approach for top-down recognizers, connecting them with chart parsers and enabling termination in continuation-passing style implementations.
Findings
Memoization of top-down recognizers can be related to chart parsing.
A version of memoization suitable for continuation-passing style is proposed.
The approach yields a terminating parser for a formalized top-down recognizer.
Abstract
This paper discusses the relationship between memoized top-down recognizers and chart parsers. It presents a version of memoization suitable for continuation-passing style programs. When applied to a simple formalization of a top-down recognizer it yields a terminating parser.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · semigroups and automata theory · Algorithms and Data Compression
