Abstract
This article delves into the scoring function of the statistical paraphrase generation model. It presents an algorithm for exact computation and two applicative experiments. The first experiment analyses the behaviour of a statistical paraphrase generation decoder, and raises some issues with the ordering of n-best outputs. The second experiment shows that a major boost of performance can be obtained by embedding a true score computation inside a Monte-Carlo sampling based paraphrase generator.
| Original language | English |
|---|---|
| Pages | 144-152 |
| Number of pages | 9 |
| Publication status | Published - 2010 |
| Event | 23rd International Conference on Computational Linguistics, Coling 2010 - Beijing, China Duration: 2010 Aug 23 → 2010 Aug 27 |
Conference
| Conference | 23rd International Conference on Computational Linguistics, Coling 2010 |
|---|---|
| Country/Territory | China |
| City | Beijing |
| Period | 10/8/23 → 10/8/27 |
ASJC Scopus subject areas
- Language and Linguistics
- Computational Theory and Mathematics
- Linguistics and Language