A program for the syntactic analysis of English sentences
Communications of the ACM
The predictive analyzer and a path elimination technique
Communications of the ACM
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
Understanding Natural Language
Understanding Natural Language
A finite and real-time processor for natural language
Communications of the ACM
Impact of a restricted natural language interface on ease of learning and productivity
Communications of the ACM
Communications of the ACM
Compansion: From research prototype to practical integration
Natural Language Engineering
Parsing with a small dictionary for applications such as text to speech
Computational Linguistics
The recognition capacity of local syntactic constraints
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Acquiring disambiguation rules from text
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Design of a hybrid deterministic parser
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
| Hi-index | 0.05 |
Lexical ambiguity and especially part-of-speech ambiguity is the source of much non-determinism in parsing. As a result, the resolution of lexical ambiguity presents deterministic parsing with a major test. If deterministic parsing is to be viable, it must be shown that lexical ambiguity can be resolved easily deterministically. In this paper, it is shown that Marcus's "diagnostics" can be handled without any mechanisms beyond what is required to parse grammatical sentences and reject ungrammatical sentences. It is also shown that many other classes of ambiguity can be easily resolved as well.