Algorithm schemata and data structures in syntactic processing
Readings in natural language processing
Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Computation of the probability of initial substring generation by stochastic context-free grammars
Computational Linguistics
Non-deterministic recursive ascent parsing
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Polynomial time and space shift-reduce parsing of arbitrary context-free grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Are very large context-free grammars tractable?
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
| Hi-index | 0.00 |