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
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th 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
Efficient feature structure operations without compilation
Natural Language Engineering
Disjunctions and inheritance in the context feature structure system
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A tractable extension of Linear Indexed Grammars
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Parsing with an extended domain of locality
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Strategies for adding control information to declarative grammars
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
Japanese sentence analysis as argumentation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Structure sharing problem and its solution in graph unification
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A treatment of negative descriptions of typed feature structures
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Quasi-destructive graph unification with structure-sharing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
| Hi-index | 0.00 |
The strategic lazy incremental copy graph unification method is a combination of two methods for unifying feature structures. One, called the lazy incremental copy graph unification method, achieves structure sharing with constant order data access time which reduces the required memory. The other, called the strategic incremental copy graph unification method, uses an early failure finding strategy which first tries to unify substructures tending to fail in unification; this method is based on stochastic data on the likelihood of failure and reduces unnecessary computation. The combined method makes each feature structure unification efficient and also reduces garbage collection and page swapping occurrences, thus increasing the total efficiency of natural language processing systems mainly based on typed feature structure unification such as natural language analysis and generation systems.