Transition network grammars for natural language analysis
Communications of the ACM
REL: A Rapidly Extensible Language system
ACM '69 Proceedings of the 1969 24th national conference
REL: a Rapidly Extensible Language System I. the REL language processor
COLING '69 Proceedings of the 1969 conference on Computational linguistics
REL: a Rapidly Extensible Language System II. REL English
COLING '69 Proceedings of the 1969 conference on Computational linguistics
Coping with syntactic ambiguity or how to put the block in the box on the table
Computational Linguistics
A finite-state parser for use in speech recognition
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Normalized data base structure: a brief tutorial
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
| Hi-index | 0.00 |
Ambiguity is a pervasive and important aspect of natural language. Ambiguities, which are disambiguated by context, contribute powerfully to the expressiveness of natural language as compared to formal languages. In computational systems using natural language, problems of properly controlling ambiguity are particularly large, partially because of the necessity to circumvent parsings due to multiple orderings in the application of rules.Features, that is, subcategorizations of parts-of-speech, constitute an effective means for controlling syntactic ambiguity through ordering the hierarchical organization of syntactic constituents. This is the solution adopted for controlling ambiguity in REL English, which is part of the REL (Rapidly Extensible Language) System. REL is a total software system for facilitating man/machine communications. The efficiency of processing natural language in REL English is achieved both by the detailed syntactic aspects which are incorporated into the REL English grammar, and by means of the particular implementation for processing features in the parsing algorithm.