Extracting paraphrase patterns from bilingual parallel corpora

  • Authors:
  • Shiqi Zhao;Haifeng Wang;Ting Liu;Sheng Li

  • Affiliations:
  • Harbin institute of technology, no. 27 jiaohua street, nangang district, harbin 150001, china e-mails: zhaosq@ir.hit.edu.cn, tliu@ir.hit.edu.cn, lisheng@ir.hit.edu.cn;Toshiba (china) research and development center, no. 1, east chang an ave., dongcheng district, beijing 100738, chinawanghaifeng@rdc.toshiba.com.cn;Harbin institute of technology, no. 27 jiaohua street, nangang district, harbin 150001, china e-mails: zhaosq@ir.hit.edu.cn, tliu@ir.hit.edu.cn, lisheng@ir.hit.edu.cn;Harbin institute of technology, no. 27 jiaohua street, nangang district, harbin 150001, china e-mails: zhaosq@ir.hit.edu.cn, tliu@ir.hit.edu.cn, lisheng@ir.hit.edu.cn

  • Venue:
  • Natural Language Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Paraphrase patterns are semantically equivalent patterns, which are useful in both paraphrase recognition and generation. This paper presents a pivot approach for extracting paraphrase patterns from bilingual parallel corpora, whereby the paraphrase patterns in English are extracted using the patterns in another language as pivots. We make use of log-linear models for computing the paraphrase likelihood between pattern pairs and exploit feature functions based on maximum likelihood estimation (MLE), lexical weighting (LW), and monolingual word alignment (MWA). Using the presented method, we extract more than 1 million pairs of paraphrase patterns from about 2 million pairs of bilingual parallel sentences. The precision of the extracted paraphrase patterns is above 78%. Experimental results show that the presented method significantly outperforms a well-known method called discovery of inference rules from text (DIRT). Additionally, the log-linear model with the proposed feature functions are effective. The extracted paraphrase patterns are fully analyzed. Especially, we found that the extracted paraphrase patterns can be classified into five types, which are useful in multiple natural language processing (NLP) applications.