- Your IPA output must be an exact match for at least 300 of the 400 words in the reference word list (the reference implementation gets 333 correct)
- Your program must make a guess for any plausibly German word. So we have a technical requirement, this will mean that for any input that matches the regex
[a-zA-ZäÄöÖüÜß]+ZäÄöÖüÜ][a-zäöüß]*and has at least one vowel (aeiouyäöü), you must produce non-whitespace-only output and not error out. - The program must be deterministic (always produce the same output given the same input)
- Otherwise, standard loopholes are forbidden (especially the one about fetching off-site resources)
