thank you for the responses.

more suggestions are welcome.

let us explain the problem further. actually, what we are wanting to make is a word separator, based on a lexicon and a set of phonetic rules (of any kind, for example, I am -> I'm, vowel + vowel = long vowel (a + a = â; a + a = aya))

an example of language that has these characteristics is Sanskrit. for example, "Krishnah" + "dhaavati" = "Krishnodhaavati", "namaH" + "te" = "namaste" (aH|dh -> odh; aH|t -> ast; as| -> aH (as at the end of the string turns to aH)), etc.

for making things easier, the lexicons used to form the strings are generally quite small, and how we generate it is actually irrelevant for this problem. for example, krishnodhaavati would be analysed by means of the lexicon ('krishnaH', 'dhaavati', 'naH', 'dhaa') (the set of chunks of the string that exist in the dictionary), but how we generate this lexicon doesn't matter, we just want to join its words based on a set of phonetic rules (aH|dh -> odh, a|e -> aye, a|e -> ai, aH|t -> ast, aH|n -> on, for example) in order to obtain back the original string segmented in all its possibilities (namaH-te; krishnaH-dhaavati; namaH-namaH; etc.). of course, there will not always be only one possibility of segmentation, given a big quantity of juncture rules and a (relatively) big lexicon of possible morphemes.