Techniques for automatic memoization with applications to context-free parsing

Authors:
Peter Norvig
Affiliations:
University of California
Venue:
Computational Linguistics
Year:
1991

Citing 6
Cited 17

Lazy memo-functions

Proc. of a conference on Functional programming languages and computer architecture
Readings in natural language processing

Readings in natural language processing
Structure and interpretation of computer programs

Structure and interpretation of computer programs
An efficient context-free parsing algorithm

Communications of the ACM
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
Language As a Cognitive Process: Syntax

Language As a Cognitive Process: Syntax

Using memorization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers

ACM SIGPLAN Notices
Memoization in top-down parsing

Computational Linguistics
Selective memoization

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Review of "The functional treatment of parsing" by René Leermakers. Kluwer Academic Publishers 1993.

Computational Linguistics
TDL: a type description language for constraint-based grammars

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time

ACM SIGPLAN Notices
Realization of natural language interfaces using lazy functional programming

ACM Computing Surveys (CSUR)
Modular and efficient top-down parsing for ambiguous left-recursive grammars

IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Selective Memoization with Box Types

Electronic Notes in Theoretical Computer Science (ENTCS)
Monadic memoization towards correctness-preserving reduction of search

AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Parser combinators for ambiguous left-recursive grammars

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Automatic detection of previously-unseen application states for deployment environment testing and analysis

Proceedings of the 5th Workshop on Automation of Software Test
A type system for reflective program generators

Science of Computer Programming
Parsing mixfix operators

IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Lazy combinators for executable specifications of general attribute grammars

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Modular natural language processing using declarative attribute grammars

MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Property-preserving program refinement

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that a process similar to Earley's algorithm can be generated by a simple top-down backtracking parser, when augmented by automatic memoization. The memoized parser has the same complexity as Earley's algorithm, but parses constituents in a different order. Techniques for deriving memo functions are described, with a complete implementation in Common Lisp, and an outline of a macro-based approach for other languages.