In the Recognizing Textual Entailment (RTE) task, sentence pairs are classified into one of three semantic relations: ENTAILMENT, CONTRADICTION or UNKNOWN. While we find some sentence pairs hold full entailments or contradictions, there are a number of pairs that partially entail or contradict one another depending on a specific situation. These partial contradiction sentence pairs contain useful information for opinion mining and other such tasks, but it is difficult for Internet users to access this knowledge because current frameworks do not differentiate between full contradictions and partial contradictions. In this paper, under current approaches to semantic relation recognition, we define a new semantic relation known as CONFINEMENT in order to recognize this useful information. This information is classified as either CONTRADICTION or ENTAILMENT. We provide a series of semantic templates to recognize CONFINEMENT relations in Web texts, and then implement a system for recognizing CONFINEMENT between sentence pairs. We show that our proposed system can obtains a F-score of 61% for recognizing CONFINEMENT in Japanese-language Web texts, and it outperforms a baseline which does not use a manually compiled list of lexico-syntactic patterns to instantiate the semantic templates.
|Number of pages
|Published - 2011
|9th International Conference on Computational Semantics, IWCS 2011 - Oxford, United Kingdom
Duration: 2011 Jan 12 → 2011 Jan 14
|9th International Conference on Computational Semantics, IWCS 2011
|11/1/12 → 11/1/14