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
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '79 Proceedings of the 17th annual meeting on Association for Computational Linguistics
An efficient augmented-context-free parsing algorithm
Computational Linguistics
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
A parsing algorithm for unification grammar
Computational Linguistics
Layer sharing: an improved structure-sharing framework
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient feature structure operations without compilation
Natural Language Engineering
Parser engineering and performance profiling
Natural Language Engineering
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
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
Types in Functional Unification Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
ACL '90 Proceedings of the 28th annual meeting on 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
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Conditioned unification for natural language processing
COLING '86 Proceedings of the 11th coference on Computational linguistics
Another stride towards knowledge-based machine translation
COLING '86 Proceedings of the 11th coference on Computational linguistics
Discourse, anaphora and parsing
COLING '86 Proceedings of the 11th coference on Computational linguistics
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
Alignment of shared forests for bilingual corpora
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Strategic lazy incremental copy graph unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Memory-efficient and thread-safe quasi-destructive graph unification
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Learning attribute values in typed-unification grammars: on generalised rule reduction
COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
On two classes of feature paths in large-scale unification grammars
New developments in parsing technology
Nondestructive graph unification
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Nondestructive graph unification
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
This paper describes a structure-sharing method for the representation of complex phrase types in a parser for PATR-II, a unification-based grammar formalism.In parsers for unification-based grammar formalisms, complex phrase types are derived by incremental refinement of the phrase types defined in grammar rules and lexical entries. In a naïve implementation, a new phrase type is built by copying older ones and then combining the copies according to the constraints stated in a grammar rule. The structure-sharing method was designed to eliminate most such copying; indeed, practical tests suggest that the use of this technique reduces parsing time by as much as 60%.The present work is inspired by the structure-sharing method for theorem proving introduced by Boyer and Moore and on the variant of it that is used in some Prolog implementations.