3818 search results - page 16 / 764 » Word Problems on Compressed Words |
ICALP
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
DATESO
2007
14 years 11 months ago
2007
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transfor...
COLING
1996
14 years 11 months ago
1996
In this paper, we describe a new model for word alignment in statistical translation and present experimental results. The idea of the model is to make the alignment probabilities...
TCS
2008
14 years 9 months ago
2008
A two-dimensional word is a function on Z2 with finite number of values. The main problem we are interested in is periodicity of twodimensional words satisfying some local conditi...
ACL
2011
14 years 1 months ago
2011
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...