Weakly supervised learning of presupposition relations between verbs

Authors:
Galina Tremper
Affiliations:
Heidelberg University, Germany
Venue:
ACLstudent '10 Proceedings of the ACL 2010 Student Research Workshop
Year:
2010

Citing 5
Cited 1

Implementing the binding and accommodation theory for anaphora resolution and presupposition projection

Computational Linguistics
Discovery of inference rules for question-answering

Natural Language Engineering
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Espresso: leveraging generic patterns for automatically harvesting semantic relations

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Discovery of event entailment knowledge from text corpora

Computer Speech and Language

Learning verb inference rules from linguistically-motivated evidence

EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Presupposition relations between verbs are not very well covered in existing lexical semantic resources. We propose a weakly supervised algorithm for learning presupposition relations between verbs that distinguishes five semantic relations: presupposition, entailment, temporal inclusion, antonymy and other/no relation. We start with a number of seed verb pairs selected manually for each semantic relation and classify unseen verb pairs. Our algorithm achieves an overall accuracy of 36% for type-based classification.