| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uighur (0) - 34 freq uighurs (1) - 20 freq higher (2) - 76 freq uighers (2) - 1 freq vigour (2) - 6 freq figur (2) - 2 freq uimour (2) - 3 freq rigeur (2) - 1 freq uthur (2) - 1 freq tighter (3) - 4 freq unther (3) - 9 freq fighter (3) - 9 freq ither (3) - 3062 freq nights (3) - 62 freq zither (3) - 6 freq uther (3) - 9 freq dights (3) - 5 freq €œthur (3) - 2 freq figurs (3) - 7 freq uisfu (3) - 2 freq high-up (3) - 1 freq digger (3) - 12 freq nighber (3) - 7 freq incur (3) - 2 freq heigher (3) - 1 freq |
uighur (0) - 34 freq uighurs (2) - 20 freq uthur (3) - 1 freq augher (3) - 1 freq uighers (3) - 1 freq higher (3) - 76 freq eight (4) - 66 freq eighty (4) - 12 freq ghud (4) - 4 freq udhr (4) - 1 freq gaur (4) - 8 freq usher (4) - 3 freq augur (4) - 1 freq ugh (4) - 12 freq oihyr (4) - 1 freq either (4) - 445 freq yoghurt (4) - 4 freq ihor (4) - 1 freq wiher (4) - 1 freq eimhir (4) - 1 freq ight (4) - 1 freq whur (4) - 63 freq gither (4) - 66 freq aither (4) - 140 freq hur (4) - 787 freq |
SoundEx code - U260 us're - 1 freq usher - 3 freq user - 3 freq ussr - 3 freq uiser - 5 freq usri - 3 freq uksrw - 1 freq uighur - 34 freq ukxkr - 1 freq ueweaoijur - 1 freq ushare - 1 freq 'ushare' - 1 freq |
MetaPhone code - UFR ufer - 1 freq uighur - 34 freq uvver - 10 freq uvyr - 1 freq |
UIGHUR |
| Time to execute Levenshtein function - 0.188849 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.336135 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.027111 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.036475 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.000828 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. |