A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
A structure-sharing parser for lexicalized grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd 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
Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Disambiguation of super parts of speech (or supertags): almost parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A principle-based hierarchical representation of LTAGs
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
Computational Linguistics
Hi-index | 0.00 |
One of the claimed benefits of Tree Adjoining Grammars is that they have an extended domain of locality (EDOL). We consider how this can be exploited to limit the need for feature structure unification during parsing. We compare two wide-coverage lexicalized grammars of English, LEXSYS and XTAG, finding that the two grammars exploit EDOL in different ways.