MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Memoization in Top-Down Parsing (1995) [7 citations — 0 self]

by Mark Johnson
Computational Linguistics
Add To MetaCart

Abstract:

this paper is to discover why this is the case and present a functional formalization of memoized top-down parsing for which this is not so. Specifically, I show how to formulate top-down parsers in a 'continuation-passing style,' which incrementally enumerates the right string positions of a category, rather than returning a set of such positions as a single value. This permits a type of memoization not described to my knowledge in the context of functional programming before. This kind of memoization is akin to that used in logic programming, and yields terminating parsers even in the face of left recursion

Citations

565 Structure and Interpretation of Computer Programs – Abelson, Sussman - 1996
131 Parsing as Deduction – Pereira, Warren - 1983
123 Principles and implementation of deductive parsing – Shieber, Schabes, et al. - 1995
92 Revised report on the algorithmic language scheme – Rees, Clinger - 1986
72 The revised 4 report on the algorithmic language Scheme – Clinger, Rees - 1991
44 Towards a uniform formal framework for parsing – Lang - 1991
28 The Functional Treatment of Parsing – Leermakers - 1993
15 Techniques for automatic memoization with applications to context-free parsing – Norvig - 1991
8 How to implement prolog on a LISP machine – Kahn, Carlsson - 1984
1 Computational Linguistics 21.3 – Sheil - 1976
1 Principles and Implementation of Deductive Parsing. CRCT TR-11-94 (also available from the cmp-lg server – Shieber, Schabes, et al. - 1994
1 Observations on context-free parsing – Shell - 1976