The logic of typed feature structures
The logic of typed feature structures
LiLFeS: towards a practical HPSG parser
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Parsing ambiguous structures using controlled disjunctions and unary quasi-trees
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Constraint projection: an efficient treatment of disjunctive feature descriptions
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Conditioned unification for natural language processing
COLING '86 Proceedings of the 11th coference on Computational linguistics
Modularizing contexted constraints
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Computing phrasal-signs in HPSG prior to parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
The LiLFeS Abstract Machine and its evaluation with the LinGO grammar
Natural Language Engineering
Ambiguity packing in constraint-based parsing: practical results
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Optimal ambiguity packing in context-free parsers with interleaved unification
New developments in parsing technology
| Hi-index | 0.00 |
This paper proposes a method for packing feature structures, which automatically collapses equivalent parts of lexical/phrasal feature structures of HPSG into a single packed feature structure. This method avoids redundant repetition of unification of those parts. Preliminary experiments show that this method can significantly improve a unification speed in parsing.