The predictive analyzer and a path elimination technique

Authors:
Susumu Kuno
Affiliations:
Harvard Univ., Cambridge, UK
Venue:
Communications of the ACM
Year:
1965

Citing 3
Cited 22

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Journal of the ACM (JACM)
Formal parsing systems

Communications of the ACM
An error-correcting parse algorithm

Communications of the ACM

Resolving lexical ambiguity in a deterministic parser

Computational Linguistics
An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic parsing for content analysis

Communications of the ACM
The teachable language comprehender: a simulation program and theory of language

Communications of the ACM
Computational linguistics in a Ph.D. computer science program

Communications of the ACM
The augmented predictive analyzer for context-free languages—its relative efficiency

Communications of the ACM
The competence/performance dichotomy in programming preliminary report

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The construction of recognizers

ACM '66 Proceedings of the 1966 21st national conference
Compose-reduce parsing

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A context-free grammar of French

COLING '80 Proceedings of the 8th conference on Computational linguistics
A system for transformational analysis

COLING '65 Proceedings of the 1965 conference on Computational linguistics
A new predictive analyzer of English

COLING '86 Proceedings of the 11th coference on Computational linguistics
Information storage and retrieval: a survey and functional description

ACM SIGIR Forum
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)
An economical program for limited parsing of English

AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Modular and efficient top-down parsing for ambiguous left-recursive grammars

IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Lexical ambiguity as a touchstone for theories of language analysis

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
LINGOL: a progress repor

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
An on-line computational model of human sentence interpretation

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Simple, functional, sound and complete parsing for all context-free grammars

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
A semantics for context-sensitive reduction semantics

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems

Quantified Score

Hi-index	48.28

Visualization

Abstract

Some of the characteristic features of a predictive analyzer, a system of syntactic analysis now operational at Harvard on an IBM 7094, are delineated. The advantages and disadvantages of the system are discussed in comparison to those of an immediate constituent analyzer, developed at the RAND Corporation with Robinson's English grammar. In addition, a new technique is described for repetitive path elimination for a predictive analyzer, which can now claim efficiency both in processing time and core storage requirement.