Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing - RTE '07 2007
DOI: 10.3115/1654536.1654570
|View full text |Cite
|
Sign up to set email alerts
|

Learning alignments and leveraging natural logic

Abstract: We describe an approach to textual inference that improves alignments at both the typed dependency level and at a deeper semantic level. We present a machine learning approach to alignment scoring, a stochastic search procedure, and a new tool that finds deeper semantic alignments, allowing rapid development of semantic features over the aligned graphs. Further, we describe a complementary semantic component based on natural logic, which shows an added gain of 3.13% accuracy on the RTE3 test set.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
46
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
4
1

Relationship

2
8

Authors

Journals

citations
Cited by 64 publications
(46 citation statements)
references
References 5 publications
(1 reference statement)
0
46
0
Order By: Relevance
“…However, its precision is comparatively high, which suggests a strategy of hybridizing with a broad-coverage RTE system. We were able to show that adding NatLog as a component in the Stanford RTE system (Chambers et al 2007) led to accuracy gains of 4%.…”
Section: Implementation and Evaluationmentioning
confidence: 88%
“…However, its precision is comparatively high, which suggests a strategy of hybridizing with a broad-coverage RTE system. We were able to show that adding NatLog as a component in the Stanford RTE system (Chambers et al 2007) led to accuracy gains of 4%.…”
Section: Implementation and Evaluationmentioning
confidence: 88%
“…Training and is performed using a logistic regression classifier. Chambers et al [4] improve the alignment stage in [17] and combine it with a logical framework for the second stage [16]. The inference in the logical framework is expressed by a sequence of edits over texts expressions, where the edits represent operations that affect monotonicity over texts expressions.…”
Section: Resultsmentioning
confidence: 99%
“…The string representation of this tree, including the parts of speech for its words is as follows: To match patterns against dependency trees, we use Stanford's semgrex utility [25]. In the following, we explain some of the basics of semgrex patterns that help the reader understand patterns presented in this paper using descriptions and examples from the authors of [25]. Figure 1 can be:…”
Section: Background On Dependency Treesmentioning
confidence: 99%