An economical program for limited parsing of English

Authors:
D. C. Clarke;R. E. Wall
Affiliations:
IBM San Jose Research Laboratory, San Jose, California;IBM San Jose Research Laboratory, San Jose, California
Venue:
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Year:
1965

Citing 4
Cited 1

A Computational Approach to Grammatical Coding of English Words

Journal of the ACM (JACM)
The predictive analyzer and a path elimination technique

Communications of the ACM
COMIT as an IR language

Communications of the ACM
Syntactic analysis of English by computer: a survey

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference

Machine-to-man communication by speech part II: synthesis of prosodic features of speech by rule

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

Automatic syntactic analysis has often been proposed as a component of mechanized indexing systems. However, up to this time, frequency counting and statistical association techniques have been more favored, since these involve operations which can be performed with great speed on present day computers. Syntactic analysis programs, especially the few which have relatively complete grammars, have suffered from the disadvantage of slow and expensive operation and consequently have seldom been applied beyond the field of mechanical translation. In this paper, we report the design and testing of a limited syntactic recognition program for English which shows promise of becoming accurate enough to aid in mechanized indexing, yet sufficiently inexpensive to make large-scale use practicable.