A Graph-Based Approach to String Regeneration

A Graph-Based Approach to String Regeneration” by Matic Horvat and William Byrne. In Proceedings of the Student Research Workshop at the 14th Conference of the European Chapter of the Association for Computational Linguistics, (Gothenburg, Sweden), Apr. 2014, pp. 85-95 (11 pages).

Abstract

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 input bag of words under an N-gram language model. We describe a graph-based approach for finding the optimal permutation. The evaluation of the approach on a number of datasets yielded promising results, which were confirmed by conducting a manual evaluation study.

BibTeX entry:

@inproceedings{horvat-byrne:2014:SRW,
   author = {Matic Horvat and William Byrne},
   title = {A Graph-Based Approach to String Regeneration},
   booktitle = {Proceedings of the Student Research Workshop at the 14th
	Conference of the European Chapter of the Association for
	Computational Linguistics},
   pages = {85--95 (11 pages)},
   publisher = {Association for Computational Linguistics},
   address = {Gothenburg, Sweden},
   month = apr,
   year = {2014},
   url = {http://www.aclweb.org/anthology/E14-3010}
}

Back to Bill Byrne publications.