Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Inheritance, defaults and the lexicon
Inheritance, defaults and the lexicon
Restriction and termination in parsing with feature-theoretic grammars
Computational Linguistics
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
Generalized left-corner parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
An extended LR parsing algorithm for grammars using feature-based syntactic categories
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Letting the cat out of the bag: generation for shake-and-bake MT
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Connectivity in bag generation
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars, in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much information from the grammars as possible, using negative restriction to define equivalence classes. Addition of a simple data structure leads to an order of magnitude improvement in execution time over a naive implementation.