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
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
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Strategic lazy incremental copy graph unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Efficient feature structure operations without compilation
Natural Language Engineering
Parser engineering and performance profiling
Natural Language Engineering
A compact architecture for dialogue management based on scripts and meta-outputs
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Ambiguity packing in constraint-based parsing: practical results
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
ARIES: A lexical platform for engineering Spanish processing tools
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
Relating complexity to practical performance in parsing with wide-coverage unification grammars
ACL '94 Proceedings of the 32nd 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
Feature structure based semantic head driven generation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
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 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
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
A generic approach to parallel chart parsing with an application to LinGO
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Memory-efficient and thread-safe quasi-destructive graph unification
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Measure for measure: towards increased component comparability and exchange
New developments in parsing technology
Constraining robust constructions for broad-coverage parsing with precision grammars
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Large-scale corpus-driven PCFG approximation of an HPSG
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
| Hi-index | 0.00 |
Graph unification is the most expensive part of unification-based grammar parsing. It often takes over 90% of the total parsing time of a sentence. We focus on two speed-up elements in the design of unification algorithms: 1) elimination of excessive copying by only copying successful unifications, 2) Finding unification failures as soon as possible. We have developed a scheme to attain these two elements without expensive overhead through temporarily modifying graphs during unification to eliminate copying during unification. We found that parsing relatively long sentences (requiring about 500 top-level unifications during a parse) using our algorithm is approximately twice as fast as parsing the same sentences using Wroblewski's algorithm.