[PDF] Top 20 A mostly unlexicalized model for recognizing textual entailment

... While most of the weights as generated by the classifier are intuitive, these features are clearly in- sufficient, as demonstrated by the low accuracy of the classifier. To address this we manually ana- lyzed 30 data ... See full document

... Yoshikawa[6] model shows that the processing time of a state-of-the-art logic-based RTE system can be significantly reduced by replacing its search-based axiom injection (abduction) mechanism by that based on ... See full document

... This paper proposes a knowledge repre- sentation model and a logic proving set- ting with axioms on demand success- fully used for recognizing textual entail- ments. It also details a lexical ... See full document

... Since the contradiction manifested between tweet pairs labeled was very fine grained, we ex- pected bag of word models to perform poorly and confusion between entailment and contradiction to be high. Also, since, ... See full document

... hybrid model that achieves an accuracy of ...their model increases the overall accuracy to ...for textual entailment based on graph matching theory applied to syntactic dependency ...two-way ... See full document

... of entailment rules and coref- erence substitutions are yet, in most cases, insuffi- cient in transforming T into H, our system allows on-the-fly ...language model, which yields lower costs for more ... See full document

... and textual entailment, is often hampered by use of a greedy 1-best pipeline archi- tecture, which causes errors to propagate and compound at each ...and recognizing textual entailment ... See full document

... corpus (Bowman et al., 2015) and the Sentences In- volving Compositional Knowledge (SICK) corpus (Marelli et al., 2014b). Although the experimental result of the SICK corpus rejects the null hypothesis, the result of the ... See full document

... In the distance-based framework adopted by EDITS, the interaction between algorithms and cost schemes plays a central role. Given a T-H pair, in fact, the distance score returned by an al- gorithm directly depends on the ... See full document

... partial textual entail- ...for recognizing (complete) textual entailment can be successfully adapted to this ...decomposition model – faceted ...for recognizing complete ... See full document

... to Recognizing Textual Entailment, identifying phrase-to- phrase semantic relations is still an un- solved ...nizing Textual Entailment when combined with specific linguistic and logic ... See full document

... unknown entailment examples is often due to the behavior of certain relations that either preclude certain other relations holding be- tween the same arguments (for example, winning a contest ... See full document

... Successful systems for recognizing textual en- tailment are usually complex and multi-tiered. The Stanford RTE system (MacCartney et al., 2006), for instance, has a linguistic analysis stage, an alignment ... See full document

... Chapter 2 - Background Work and Concepts - This chapter provides a general overview on supervised learning approaches and Support Vector Machines (SVMs) in particular. Specifically, we focused on classification and ... See full document

... we model pose a challenge for the formalization of an annotation ...in entailment pairs with no account for the full inferential process between the premise and the ... See full document

... In various AVE challenges, several methods have been applied. Most of these systems use some sort of lexical matching. A number of systems represent the texts as parse trees (e.g., syntactic or dependency trees) before ... See full document

... The second resource which we have used as a source of axioms is FrameNet, release 1.5, see Rup- penhofer et al. (2006). FrameNet has a shorter history in NLP applications than WordNet, but lately more and more ... See full document

... 2 General-purpose Semantic Parsing General-purpose, open-domain semantic parsing systems that output logical-form meaning rep- resentations are freely available today, but have not yet been widely used in TE systems. For ... See full document

... to textual entailment have more in common than meets the ...Many textual entailment problems used to test the Nutcracker system can be solved by the answer set solver DLV ... See full document

... participants, mostly employees (academic and non-academic) at University of Gothen- burg some of whom are native speakers of English but the majority of participants had Swedish as their first language with ... See full document