Chinese Textual Entailment Recognition Based on Syntactic Tree Clipping

نویسندگان

  • Zhichang Zhang
  • Dongren Yao
  • Songyi Chen
  • Huifang Ma
چکیده

Textual entailment has been proposed as a unifying generic framework for modeling language variability and semantic inference in different Natural Language Processing (NLP) tasks. This paper presents a novel statistical method for recognizing Chinese textual entailment in which lexical, syntactic with semantic matching features are combined together. In order to solve the problems of syntactic tree matching difficulty and tree structure errors caused by Chinese word segmentation, the method firstly clips the syntactic trees into minimum information trees and then computes syntactic matching similarity on them. All features will be used in a voting style under different machine learning methods to predict whether the text sentence can entail the hypothesis sentence in a text-hypothesis pair. The experimental results show that the feature on changing structure of syntactic tree is effective and efficient in Chinese textual entailment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chinese Textual Entailment Recognition Enhanced with Word Embedding

Textual entailment has been proposed as a unifying generic framework for modeling language variability and semantic inference in different Natural Language Processing (NLP) tasks. By evaluating on NTCIR-11 RITE3 Simplified Chinese subtask data set, this paper firstly demonstrates and compares the performance of Chinese textual entailment recognition models that combine different lexical, syntac...

متن کامل

Encoding Tree Pair-Based Graphs in Learning Algorithms: The Textual Entailment Recognition Case

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 Vec...

متن کامل

NTTCS Textual Entailment Recognition System for NTCIR-9 RITE

This paper describes initial Japanese Textual Entailment Recognition (RTE) systems that participated Japanese Binaryclass (BC) and Multi-class (MC) subtasks of NTCIR-9 RITE. Our approaches are based on supervised learning techniques: Decision Tree (DT) and Support Vector Machine (SVM) learners. The employed features for the learners include text fragment based features such as lexical, syntacti...

متن کامل

Syntactic/Semantic Structures for Textual Entailment Recognition

In this paper, we describe an approach based on off-the-shelf parsers and semantic resources for the Recognizing Textual Entailment (RTE) challenge that can be generally applied to any domain. Syntax is exploited by means of tree kernels whereas lexical semantics is derived from heterogeneous resources, e.g. WordNet or distributional semantics through Wikipedia. The joint syntactic/semantic mod...

متن کامل

Textual Entailment as Syntactic Graph Distance: a rule based and a SVM based approach

In this paper we define a measure for textual entailment recognition based on the graph matching theory applied to syntactic graphs. We describe the experiments carried out to estimate measure’s parameters with SVM and we report the results obtained on the Textual Entailment Challenge development and testing set.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014