| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unloadin (0) - 6 freq unloadit (1) - 1 freq unladin (1) - 1 freq unloakin (1) - 1 freq uploadin (1) - 1 freq unloddan (2) - 1 freq reloadin (2) - 1 freq unlockin (2) - 2 freq unloaded (2) - 1 freq unload (2) - 3 freq unfoldin (2) - 3 freq loadin (2) - 5 freq kneadin (3) - 1 freq undain (3) - 1 freq pleadin (3) - 12 freq loadit (3) - 19 freq undoan (3) - 2 freq €œleadin (3) - 1 freq cloakin (3) - 1 freq ungoadly (3) - 1 freq uncorkin (3) - 1 freq unlockan (3) - 1 freq unleashin (3) - 2 freq unhovin (3) - 1 freq sloapin (3) - 1 freq |
unloadin (0) - 6 freq unladin (1) - 1 freq uploadin (2) - 1 freq unloakin (2) - 1 freq unloadit (2) - 1 freq unload (3) - 3 freq loadin (3) - 5 freq unloaded (3) - 1 freq unfoldin (3) - 3 freq reloadin (3) - 1 freq unloddan (3) - 1 freq floodin (4) - 9 freq unlivin (4) - 1 freq undoin (4) - 1 freq noddin (4) - 39 freq cloodin (4) - 3 freq bladin (4) - 1 freq unlairn (4) - 1 freq onlookin (4) - 2 freq leadin (4) - 67 freq doonloadin (4) - 1 freq noaddin (4) - 5 freq unlearn (4) - 2 freq undain (4) - 1 freq pleadin (4) - 12 freq |
SoundEx code - U543 unload - 3 freq unloadin - 6 freq unhealthy - 9 freq unilateral - 1 freq unloadit - 1 freq unwieldy - 1 freq umlaut - 3 freq unloddan - 1 freq unyauld - 1 freq unlatch - 1 freq unloaded - 1 freq unladin - 1 freq unilaterally - 5 freq umlauts - 2 freq unliterally - 1 freq |
MetaPhone code - UNLTN unloadin - 6 freq unloddan - 1 freq unladin - 1 freq |
UNLOADIN |
| Time to execute Levenshtein function - 0.294792 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.584533 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.028046 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.078104 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.001021 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. |