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 Fixed-Point Semantics for Feature Type Systems
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd 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
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Strategic lazy incremental copy graph unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Inheritance and constraint-based grammar formalisms
Computational Linguistics - Special issue on inheritance: I
Computing with features as formulae
Computational Linguistics
On building a more efficient grammar by exploiting types
Natural Language Engineering
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
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
Towards computer-aided linguistic engineering
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Feature structures, unification and finite-state transducers
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Large scale inference of deterministic transductions: tenjinno problem 1
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
| Hi-index | 0.00 |
This paper presents a unification procedure which eliminates the redundant copying of structures by using a lazy incremental copying approach to achieve structure sharing. Copying of structures accounts for a considerable amount of the total processing time. Several methods have been proposed to minimize the amount of necessary copying. Lazy Incremental Copying (LIC) is presented as a new solution to the copying problem. It synthesizes ideas of lazy copying with the notion of chronological dereferencing for achieving a high amount of structure sharing.