Proceedings of the ACL-IJCNLP 2009 Conference Short Papers on - ACL-IJCNLP '09 2009
DOI: 10.3115/1667583.1667603
|View full text |Cite
|
Sign up to set email alerts
|

A framework for entailed relation recognition

Abstract: We define the problem of recognizing entailed re-

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 8 publications
0
12
0
Order By: Relevance
“…Similar to the formulation in [24], the information need is modeled as a structured query consisting of three elements: the relation of interest, R, and the two entities, E1 and E2, participating in the relation. The entities take specific roles in the relation, i.e., the entities are "typed" for a particular relation.…”
Section: Searching For Evidencementioning
confidence: 99%
“…Similar to the formulation in [24], the information need is modeled as a structured query consisting of three elements: the relation of interest, R, and the two entities, E1 and E2, participating in the relation. The entities take specific roles in the relation, i.e., the entities are "typed" for a particular relation.…”
Section: Searching For Evidencementioning
confidence: 99%
“…Only a few works considered improving the evidence presentation in claim verification problems. Roth et al (2009) introduce the task of Entailed Relation Recognition -given a set of short paragraphs and a relational fact in the triple form of (argument 1 , relation, argument 2 ), finding the paragraphs that can entail this fact. They first use Expanded Lexical Retrieval to rank and keep the topk paragraphs as candidates, then build a TE classifier over each (candidate, statement) pair.…”
Section: Related Workmentioning
confidence: 99%
“…A simple approach to identifying evidence is to detect the top-k sentences that are lexically similar to the claim, as some pipeline systems (Roth et al, 2009;Thorne et al, 2018) do. However, a claimunaware fixed k is less optimal, adding noise or missing key supporting factors, consequently limiting the performance.…”
Section: Evidence Identificationmentioning
confidence: 99%
“…RTE is the task of determining, for two textual expressions T (text) and H (hypothesis), whether the meaning of H can be inferred from the meaning of T (Dagan and Glickman, 2004). In RE, RTE systems have been applied to validate a given relation instance (Wang and Neumann, 2008) and to extract instances entailing a given target relation (Romano et al, 2006;Bar-Haim et al, 2007;Roth et al, 2009). …”
Section: Related Workmentioning
confidence: 99%