An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Structure sharing with binary trees
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Constraint projection: an efficient treatment of disjunctive feature descriptions
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Quasi-destructive graph unification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Unification with lazy non-redundant copying
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Unification of disjunctive feature descriptions
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Efficient disjunctive unification for bottom-up parsing
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Strategic lazy incremental copy graph unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
The interface between phrasal and functional constraints
Computational Linguistics
On building a more efficient grammar by exploiting types
Natural Language Engineering
Restructuring tagged corpora with morpheme adjustment rules
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A spoken language translation system: SL-trans2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
A spoken language translation system: SL-trans2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
On two classes of feature paths in large-scale unification grammars
New developments in parsing technology
| Hi-index | 0.02 |
This paper describes an empirical study on the optimal granularity of the phrase structure rules and the optimal strategy for interleaving CFG parsing with unification in order to implement an efficient unification-based parsing system. We claim that using "medium-grained" CFG phrase structure rules, which balance the computational cost of CFG parsing and unification, are a cost-effective solution for making unification-based grammar both efficient and easy to maintain. We also claim that "late unification", which delays unification until a complete CFG parse is found, saves unnecessary copies of DAGs for irrelevant subparses and improves performance significantly. The effectiveness of these methods was proved in an extensive experiment. The results show that, on average, the proposed system parses 3.5 times faster than our previous one. The grammar and the parser described in this paper are fully implemented and used as the Japanese analysis module in SL-TRANS, the speech-to-speech translation system of ATR.