Question

i would like to explain my problem by the following example.

assume the word: abc
a has variants: ä, à
b has no variants.
c has variants: ç

so the possible words are:

abc
äbc
àbc
abç
äbç
àbç

now i am looking for the algorithm that prints all word variantions for abritray words with arbitray lettervariants.

Answer 1

I would recommend you to solve this recursively. Here’s some Java code for you to get started:

static Map<Character, char[]> variants = new HashMap<Character, char[]>() {{
    put('a', new char[] {'ä', 'à'});
    put('b', new char[] {        });
    put('c', new char[] { 'ç'    });
}}; 

public static Set<String> variation(String str) {

    Set<String> result = new HashSet<String>();

    if (str.isEmpty()) {
        result.add("");
        return result;
    }

    char c = str.charAt(0);
    for (String tailVariant : variation(str.substring(1))) {
        result.add(c + tailVariant);
        for (char variant : variants.get(c))
            result.add(variant + tailVariant);
    }

    return result;
}

Test:

public static void main(String[] args) {
    for (String str : variation("abc"))
        System.out.println(str);
}

Output:

abc
àbç
äbc
àbc
äbç
abç