S-restricted monotone alignments
Steffen Eger; Proceedings of KONVENS 2012 (Main track: oral presentations), pp. 155-164, September 2012.
We present an alignment algorithm for monotone many-to-many alignments, which are relevant e.g. in the field of grapheme-to-phoneme conversion (G2P). Moreover, we specify the size of the search space for monotone many-to-many alignments in G2P, which indicates that exhaustive enumeration is generally possible, so that some limitations of our approach can easily be overcome. Finally, we present a decoding scheme, within the monotone many-to-many alignment paradigm, that relates the decoding problem to restricted integer compositions and that is, putatively, superior to alternatives suggested in the literature.