| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ukraine (0) - 10 freq urine (2) - 2 freq upraise (2) - 1 freq raine (2) - 1 freq sprains (3) - 1 freq irvine (3) - 21 freq araise (3) - 1 freq ermine (3) - 7 freq drane (3) - 1 freq upraised (3) - 2 freq kains (3) - 1 freq sardine (3) - 1 freq trainie (3) - 3 freq urie (3) - 1 freq trainer (3) - 10 freq crine (3) - 2 freq 'praise (3) - 2 freq kine (3) - 101 freq unreined (3) - 1 freq brainy (3) - 16 freq strain (3) - 22 freq chaine (3) - 6 freq 'drain (3) - 1 freq fraince (3) - 1 freq aine (3) - 4 freq |
ukraine (0) - 10 freq krone (3) - 2 freq raine (3) - 1 freq karine (3) - 2 freq urine (3) - 2 freq brain (4) - 151 freq rane (4) - 3 freq train (4) - 146 freq reine (4) - 2 freq rainy (4) - 15 freq orain (4) - 1 freq kain (4) - 2 freq drain (4) - 30 freq rainie (4) - 8 freq skrene (4) - 1 freq ukranian (4) - 1 freq werain (4) - 1 freq heroine (4) - 6 freq grainy (4) - 1 freq koran (4) - 1 freq kline (4) - 1 freq kairn (4) - 1 freq trine (4) - 2 freq rine (4) - 1 freq dorine (4) - 2 freq |
SoundEx code - U265 ukranian - 1 freq ukraine - 10 freq usherin - 2 freq ukrainian - 4 freq ujrnbpi - 1 freq |
MetaPhone code - UKRN ukraine - 10 freq |
UKRAINE |
| Time to execute Levenshtein function - 0.186222 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.368783 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027971 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039704 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000797 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |