| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| locatit (0) - 7 freq wotatit (2) - 1 freq located (2) - 5 freq loutit (2) - 3 freq relocatit (2) - 1 freq gloatit (2) - 2 freq locate (2) - 2 freq bloatit (2) - 3 freq flochtit (2) - 1 freq location (2) - 35 freq lochfit (2) - 2 freq loadit (2) - 19 freq lootit (2) - 1 freq lichtit (2) - 64 freq lowtit (2) - 2 freq coatit (2) - 5 freq locality (2) - 3 freq lockit (2) - 33 freq floatit (2) - 7 freq locail (2) - 44 freq loathit (2) - 2 freq donati (3) - 3 freq comatie (3) - 2 freq scantit (3) - 1 freq loupit (3) - 31 freq |
locatit (0) - 7 freq lowtit (3) - 2 freq lichtit (3) - 64 freq coatit (3) - 5 freq lockit (3) - 33 freq electit (3) - 22 freq location (3) - 35 freq locality (3) - 3 freq lootit (3) - 1 freq relocatit (3) - 1 freq located (3) - 5 freq locate (3) - 2 freq loutit (3) - 3 freq limitit (4) - 9 freq loott (4) - 1 freq lichtie (4) - 2 freq recitit (4) - 5 freq lantit (4) - 1 freq listit (4) - 7 freq coatet (4) - 3 freq lifitit (4) - 2 freq leetit (4) - 6 freq latt (4) - 3 freq localitie (4) - 1 freq leitit (4) - 3 freq |
SoundEx code - L233 lichtit - 64 freq lestit - 11 freq lasted - 16 freq lichted - 14 freq licht-heided - 1 freq least-at - 3 freq lastit - 13 freq lassitude - 1 freq licht-heidit - 4 freq listed - 7 freq luistit - 1 freq lichtet - 2 freq 'lichtet - 1 freq located - 5 freq lighted - 3 freq listet - 1 freq liquidation - 2 freq laistit - 2 freq lactatin - 1 freq lested - 4 freq locatit - 7 freq listit - 7 freq lightit - 1 freq laisted - 3 freq €˜last-ditch - 1 freq liquidate - 2 freq light-headed - 1 freq lichtheidit - 1 freq lucky-white-heather - 1 freq last-ditch - 1 freq liquidated - 1 freq 'lactate' - 1 freq looktothesea - 1 freq |
MetaPhone code - LKTT located - 5 freq locatit - 7 freq liquidate - 2 freq 'lactate' - 1 freq |
LOCATIT |
| Time to execute Levenshtein function - 0.185751 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.385416 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.027892 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.037332 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.000890 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. |