Lenient default unification for robust processing within unification based grammar formalisms

Authors:
Takashi Ninomiya;Yusuke Miyao;Jun'ichi Tsujii
Affiliations:
University of Tokyo;University of Tokyo;University of Tokyo
Venue:
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Year:
2002

Citing 9
Cited 3

Skeptical and credulous default unification with applications to templates and inheritance

Inheritance, defaults and the lexicon
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
Default representation in constraint-based frameworks

Computational Linguistics
Linguistic knowledge acquisition from parsing failures

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Multiple default inheritance in a unification-based lexicon

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Defaults in unification grammar

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Towards robust PATR

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Statistical parsing with an automatically-extracted tree adjoining grammar

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Integration of syntactic, semantic and contextual information in processing grammatically III-formed inputs

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Maximal Consistent Subsets

Computational Linguistics
Deterministic shift-reduce parsing for unification-based grammars by using default unification

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
CuteForce: deep deterministic HPSG parsing

IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes new default unification, lenient default unification. It works efficiently, and gives more informative results because it maximizes the amount of information in the result, while other default unification maximizes it in the default. We also describe robust processing within the framework of HPSG. We extract grammar rules from the results of robust parsing using lenient default unification. The results of a series of experiments show that parsing with the extracted rules works robustly, and the coverage of a manually-developed HPSG grammar for Penn Treebank was greatly increased with a little overgeneration.