The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The augmented predictive analyzer for context-free languages—its relative efficiency
Communications of the ACM
Understanding Natural Language
Understanding Natural Language
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
PRELIMINARY ANALYSIS OF A BREADTH-FIRST PARSING ALGORITHM: THEORETICAL AND EXPERIMENTAL RESULTS
CRITAC—an experimental system for Japanese text proofreading
IBM Journal of Research and Development
Statistical parsing of messages
HLT '90 Proceedings of the workshop on Speech and Natural Language
Evaluating parsing strategies using standardized parse files
ANLC '92 Proceedings of the third conference on Applied natural language processing
CRITAC: a Japanese text proofreading system
COLING '86 Proceedings of the 11th coference on Computational linguistics
Construction of corpus-based syntactic rules for accurate speech recognition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
| Hi-index | 0.01 |
A description will be given of a procedure to assign the most likely probabilities to each of the rules of a given context-free grammar. The grammar developed by S. Kuno at Harvard University was picked as the basis and was successfully augmented with rule probabilities. A brief exposition of the method with some preliminary results, when used as a device for disambiguating parsing English texts picked from natural corpus, will be given.