From Paraphrase Database to Compositional Paraphrase Model and Back
John Wieting, Mohit Bansal, Kevin Gimpel, Karen Livescu, and Dan Roth

TL;DR
This paper develops parametric models leveraging the Paraphrase Database to improve paraphrase scoring, coverage, and phrase embeddings, achieving state-of-the-art results on paraphrase and similarity tasks.
Contribution
It introduces models that enhance PPDB's utility by providing more accurate scores and better coverage, along with new datasets for short-phrase paraphrasing evaluation.
Findings
Achieved state-of-the-art results on word and bigram similarity tasks.
Outperformed strong baselines on new short phrase paraphrase datasets.
Improved phrase and word embeddings through the proposed models.
Abstract
The Paraphrase Database (PPDB; Ganitkevitch et al., 2013) is an extensive semantic resource, consisting of a list of phrase pairs with (heuristic) confidence estimates. However, it is still unclear how it can best be used, due to the heuristic nature of the confidences and its necessarily incomplete coverage. We propose models to leverage the phrase pairs from the PPDB to build parametric paraphrase models that score paraphrase pairs more accurately than the PPDB's internal scores while simultaneously improving its coverage. They allow for learning phrase embeddings as well as improved word embeddings. Moreover, we introduce two new, manually annotated datasets to evaluate short-phrase paraphrasing models. Using our paraphrase model trained using PPDB, we achieve state-of-the-art results on standard word and bigram similarity tasks and beat strong baselines on our new short phrase…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Text Readability and Simplification
