论文信息 - Squibs and Discussions: Memoization in Top-Down Parsing

Squibs and Discussions: Memoization in Top-Down Parsing

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.

Mark Johnson | Mark Johnson

[1] Bernard Lang,et al. Towards a Uniform Formal Framework for Parsing , 1991 .

[2] Peter Norvig,et al. Techniques for Automatic Memoization with Applications to Context-Free Parsing , 1991, CL.

[3] Masaru Tomita,et al. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[4] Masaru Tomita,et al. Efficient parsing for natural language , 1985 .

[5] David H. D. Warren,et al. Parsing as Deduction , 1983, ACL.

[6] Stuart M. Shieber,et al. Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..

[7] Rene Leermakers,et al. The Functional Treatment of Parsing , 1993 .

[8] Mats Carlsson,et al. How to Implement Prolog on a LISP Machine , 1984, Implementations of Prolog.

[9] M. F.,et al. Bibliography , 1985, Experimental Gerontology.

[10] Gerald J. Sussman,et al. Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.

[11] D. H. Bartley,et al. Revised4 report on the algorithmic language scheme , 1991, LIPO.