An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
The acquisition and application of context sensitive grammar for English
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
| Hi-index | 0.00 |
We describe an approach to training a statistical parser from a bracketed corpus, and demonstrate its use in a software testing application that translates English specifications into an automated testing language. A grammar is not explicitly specified; the rules and contextual probabilities of occurrence are automatically generated from the corpus. The parser is extremely successful at producing and identifying the correct parse, and nearly deterministic in the number of parses that it produces. To compensate for undertraining, the parser also uses general, linguistic subtheories which aid in guessing some types of novel structures.