DocumentCode :
2218842
Title :
Textual Entailment and anaphora resolution
Author :
Pakray, Partha ; Bandyopadhyay, Sivaji ; Gelbukh, Alexander
Author_Institution :
Comput. Sci. & Eng. Dept., Jadavpur Univ., Kolkata, India
Volume :
6
fYear :
2010
fDate :
20-22 Aug. 2010
Abstract :
Textual entailment has been recently defined as a common solution for modeling language variability in different NLP tasks. Textual Entailment is formally defined as a relationship between a coherent text T and a language expression, the hypothesis H. T is said to entail H (T → H) if the meaning of H can be inferred from the meaning of T. An entailment function e(T,H) thus maps an entailment pair T-H to a true value (i.e., true if the relationship holds, false otherwise). Alternatively, e(T,H) can be also intended as a probabilistic function mapping the pair T-H to a real value between 0 and 1, expressing the confidence with which a human judge or an automatic system estimate the relationship to hold.
Keywords :
natural language processing; text analysis; NLP tasks; anaphora resolution; language expression; natural language processing; probabilistic function mapping; textual entailment; Pragmatics; Probabilistic logic; Anaphora Resolution; Direct Implication; Semantic subsumption; Syntactic Subsumption; Text Entailment;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
Conference_Location :
Chengdu
ISSN :
2154-7491
Print_ISBN :
978-1-4244-6539-2
Type :
conf
DOI :
10.1109/ICACTE.2010.5579163
Filename :
5579163
Link To Document :
بازگشت