Paper: A Graph-Based Approach to String Regeneration

ACL ID E14-3010
Title A Graph-Based Approach to String Regeneration
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 2014

The string regeneration problem is the problem of generating a fluent sentence from a bag of words. We explore the N- gram language model approach to string regeneration. The approach computes the highest probability permutation of the in- put bag of words under an N-gram lan- guage model. We describe a graph-based approach for finding the optimal permuta- tion. The evaluation of the approach on a number of datasets yielded promising re- sults, which were confirmed by conduct- ing a manual evaluation study.