| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refusin (0) - 16 freq refusit (1) - 6 freq refusing (1) - 5 freq resumin (2) - 1 freq refused (2) - 40 freq refinin (2) - 2 freq resin (2) - 6 freq refrain (2) - 13 freq refarin (2) - 1 freq refusal (2) - 2 freq revisin (2) - 5 freq refuse (2) - 24 freq referin (2) - 1 freq reducin (2) - 3 freq retumin (2) - 1 freq yeusin (2) - 1 freq reesin (2) - 1 freq reukin (2) - 1 freq reasin (2) - 2 freq refuses (2) - 17 freq defusing (2) - 1 freq rousin (2) - 5 freq resign (3) - 2 freq reelin (3) - 16 freq amusin (3) - 6 freq |
refusin (0) - 16 freq refusing (2) - 5 freq refusit (2) - 6 freq referin (3) - 1 freq refuse (3) - 24 freq reasin (3) - 2 freq rousin (3) - 5 freq revisin (3) - 5 freq refuses (3) - 17 freq reesin (3) - 1 freq refinin (3) - 2 freq refusal (3) - 2 freq resin (3) - 6 freq refused (3) - 40 freq refarin (3) - 1 freq refrain (3) - 13 freq ruffin (4) - 2 freq rinsin (4) - 3 freq riftin (4) - 6 freq refs (4) - 6 freq fusion (4) - 4 freq refine (4) - 4 freq ruisin (4) - 2 freq rasin (4) - 1 freq refuisal (4) - 1 freq |
SoundEx code - R125 revisin - 5 freq refusin - 16 freq rubicon - 3 freq revision - 9 freq robson - 14 freq rebiggin - 4 freq revisionist - 1 freq reveisioun - 1 freq robeson - 1 freq refusing - 5 freq ravishment - 1 freq €˜ravishin - 1 freq reveesions - 1 freq robson's - 1 freq robbycameron - 3 freq robgmacfarlane - 6 freq rufusmufasa - 1 freq rovcmuaxfs - 1 freq |
MetaPhone code - RFSN revisin - 5 freq refusin - 16 freq |
REFUSIN |
| Time to execute Levenshtein function - 0.203414 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.370670 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.035362 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.041122 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.000831 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. |