By Topic

A combination of rule and supervised learning approach to recognize paraphrases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bing-Quan Liu ; Sch. of Comput. Sci. & Technol., Harbin Inst. of Technol., Harbin, China ; Shuai Xu ; Bao-Xun Wang

Paraphrase recognition is the basic of paraphrase researches. However, most of the existing researches mainly focus on the acquirement of paraphrases from a certain text corpus, or their methods are restricted to certain conditions. There is not a method that can decide whether two sentences are paraphrases generally. This paper presents a combination of rule and supervised learning method to recognize paraphrases. In this method, we make use of the classification of paraphrases and adopt different approaches to recognize paraphrases according to the types they belong to. And the key point is how to use a variety of strategies to get the semantic similarity of two sentences. As the system is mainly for question answering (QA), evaluations are conducted on a corpus of sentence pairs mainly collected from a QA system, Baidu zhidao. Results show that the precision exceeds 75% on the simple sentences whose syntax analyses are correct, which is significantly higher than most of the existing methods.

Published in:

Machine Learning and Cybernetics, 2009 International Conference on  (Volume:1 )

Date of Conference:

12-15 July 2009