Encoding tree pair-based graphs in learning algorithms

The textual entailment recognition case

Alessandro Moschitti, Fabio Massimo Zanzotto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In this paper, we provide a statistical machine learning representation of textual entailment via syntactic graphs constituted by tree pairs. We show that the natural way of representing the syntactic relations between text and hypothesis consists in the huge feature space of all possible syntactic tree fragment pairs, which can only be managed using kernel methods. Experiments with Support Vector Machines and our new kernels for paired trees show the validity of our interpretation.

Original languageEnglish
Title of host publicationProceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008
PublisherAssociation for Computational Linguistics and Chinese Language Processing
Pages25-32
Number of pages8
ISBN (Electronic)9781905593576
Publication statusPublished - 1 Jan 2008
Event3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008 - Manchester, United Kingdom
Duration: 24 Aug 2008 → …

Publication series

NameProceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008

Conference

Conference3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008
CountryUnited Kingdom
CityManchester
Period24/8/08 → …

Fingerprint

Syntactics
Learning algorithms
Support vector machines
Learning systems
Experiments

ASJC Scopus subject areas

  • Software

Cite this

Moschitti, A., & Zanzotto, F. M. (2008). Encoding tree pair-based graphs in learning algorithms: The textual entailment recognition case. In Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008 (pp. 25-32). (Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008). Association for Computational Linguistics and Chinese Language Processing.

Encoding tree pair-based graphs in learning algorithms : The textual entailment recognition case. / Moschitti, Alessandro; Zanzotto, Fabio Massimo.

Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008. Association for Computational Linguistics and Chinese Language Processing, 2008. p. 25-32 (Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Moschitti, A & Zanzotto, FM 2008, Encoding tree pair-based graphs in learning algorithms: The textual entailment recognition case. in Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008. Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008, Association for Computational Linguistics and Chinese Language Processing, pp. 25-32, 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008, Manchester, United Kingdom, 24/8/08.
Moschitti A, Zanzotto FM. Encoding tree pair-based graphs in learning algorithms: The textual entailment recognition case. In Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008. Association for Computational Linguistics and Chinese Language Processing. 2008. p. 25-32. (Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008).
Moschitti, Alessandro ; Zanzotto, Fabio Massimo. / Encoding tree pair-based graphs in learning algorithms : The textual entailment recognition case. Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008. Association for Computational Linguistics and Chinese Language Processing, 2008. pp. 25-32 (Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008).
@inproceedings{654504e201b04138a34d238fcd38dea1,
title = "Encoding tree pair-based graphs in learning algorithms: The textual entailment recognition case",
abstract = "In this paper, we provide a statistical machine learning representation of textual entailment via syntactic graphs constituted by tree pairs. We show that the natural way of representing the syntactic relations between text and hypothesis consists in the huge feature space of all possible syntactic tree fragment pairs, which can only be managed using kernel methods. Experiments with Support Vector Machines and our new kernels for paired trees show the validity of our interpretation.",
author = "Alessandro Moschitti and Zanzotto, {Fabio Massimo}",
year = "2008",
month = "1",
day = "1",
language = "English",
series = "Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008",
publisher = "Association for Computational Linguistics and Chinese Language Processing",
pages = "25--32",
booktitle = "Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008",

}

TY - GEN

T1 - Encoding tree pair-based graphs in learning algorithms

T2 - The textual entailment recognition case

AU - Moschitti, Alessandro

AU - Zanzotto, Fabio Massimo

PY - 2008/1/1

Y1 - 2008/1/1

N2 - In this paper, we provide a statistical machine learning representation of textual entailment via syntactic graphs constituted by tree pairs. We show that the natural way of representing the syntactic relations between text and hypothesis consists in the huge feature space of all possible syntactic tree fragment pairs, which can only be managed using kernel methods. Experiments with Support Vector Machines and our new kernels for paired trees show the validity of our interpretation.

AB - In this paper, we provide a statistical machine learning representation of textual entailment via syntactic graphs constituted by tree pairs. We show that the natural way of representing the syntactic relations between text and hypothesis consists in the huge feature space of all possible syntactic tree fragment pairs, which can only be managed using kernel methods. Experiments with Support Vector Machines and our new kernels for paired trees show the validity of our interpretation.

UR - http://www.scopus.com/inward/record.url?scp=84937508367&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937508367&partnerID=8YFLogxK

M3 - Conference contribution

T3 - Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008

SP - 25

EP - 32

BT - Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing, TextGraphs 2008

PB - Association for Computational Linguistics and Chinese Language Processing

ER -