An optimal quadratic approach to monolingual paraphrase alignment


We model the problem of monolingual textual alignment as a Quadratic Assignment Problem (QAP) which simultaneously maximizes the global lexicosemantic and syntactic similarities of two sentence-level texts. Because QAP is an NP-complete problem, we propose a branch-and-bound approach to efficiently find an optimal solution. When compared with other methods and studies, our results are competitive.

Publication Title

Proceedings of the 20th Nordic Conference of Computational Linguistics, NODALIDA 2015

This document is currently not available here.