| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uighurs (0) - 20 freq uighers (1) - 1 freq uighur (1) - 34 freq highers (2) - 12 freq figgurs (2) - 1 freq figurs (2) - 7 freq vigurs (2) - 1 freq fingurs (3) - 6 freq figure (3) - 104 freq rights (3) - 32 freq eithers (3) - 1 freq nighbers (3) - 11 freq higher (3) - 76 freq highs (3) - 1 freq aithers (3) - 7 freq tighes (3) - 1 freq fighters (3) - 4 freq tights (3) - 15 freq fights (3) - 3 freq whurs (3) - 1 freq uthers (3) - 1 freq tigers (3) - 5 freq night's (3) - 7 freq figur (3) - 2 freq biggars (3) - 2 freq |
uighurs (0) - 20 freq uighers (1) - 1 freq uighur (2) - 34 freq highers (3) - 12 freq gaurs (4) - 2 freq uthers (4) - 1 freq gurs (4) - 1 freq ushers (4) - 2 freq thurs (4) - 16 freq ithers (4) - 574 freq ithirs (4) - 10 freq aithers (4) - 7 freq yoghurt (4) - 4 freq whurs (4) - 1 freq figurs (4) - 7 freq vigurs (4) - 1 freq hurs (4) - 4 freq eithers (4) - 1 freq figgurs (4) - 1 freq guisers (5) - 8 freq gethers (5) - 11 freq glaurs (5) - 1 freq thers (5) - 1 freq gaars (5) - 1 freq guiders (5) - 1 freq |
SoundEx code - U262 ushers - 2 freq users - 7 freq uisers - 17 freq usher's - 1 freq usurious - 1 freq uighurs - 20 freq uighers - 1 freq uuqrzgkz - 1 freq usherkomugisha - 1 freq |
MetaPhone code - UFRS uighurs - 20 freq uighers - 1 freq |
UIGHURS |
| Time to execute Levenshtein function - 0.212048 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.381203 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.028346 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.036914 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.000799 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. |