| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loathit (0) - 2 freq loathin (1) - 4 freq gloatit (2) - 2 freq lootit (2) - 1 freq boathir (2) - 3 freq loathed (2) - 2 freq loathing (2) - 1 freq soothit (2) - 1 freq loadit (2) - 19 freq locatit (2) - 7 freq loathe (2) - 2 freq lathie (2) - 1 freq coatit (2) - 5 freq loutit (2) - 3 freq loohit (2) - 1 freq bloatit (2) - 3 freq floatit (2) - 7 freq loath (2) - 4 freq lowtit (2) - 2 freq clortit (3) - 2 freq laandit (3) - 4 freq vouchit (3) - 1 freq boltit (3) - 4 freq leuchit (3) - 4 freq loppit (3) - 1 freq |
loathit (0) - 2 freq loathin (2) - 4 freq lathie (3) - 1 freq loutit (3) - 3 freq soothit (3) - 1 freq loath (3) - 4 freq loohit (3) - 1 freq loathe (3) - 2 freq loathed (3) - 2 freq lootit (3) - 1 freq latt (4) - 3 freq lothian (4) - 81 freq leetit (4) - 6 freq latest (4) - 72 freq lottie (4) - 2 freq laughit (4) - 1 freq leatham (4) - 9 freq lathes (4) - 1 freq lacht (4) - 1 freq laichit (4) - 1 freq thit (4) - 568 freq ootht (4) - 4 freq laacht (4) - 6 freq loott (4) - 1 freq leathr (4) - 1 freq |
SoundEx code - L330 latehd - 1 freq loaded - 22 freq loadit - 19 freq loathit - 2 freq laidit - 9 freq laithed - 2 freq lootit - 1 freq leetit - 6 freq luddite - 1 freq loathed - 2 freq la-di-da - 1 freq leided - 1 freq leeted - 1 freq laded - 1 freq ledit - 1 freq ladit - 2 freq loddit - 2 freq loa-tyd - 1 freq laedit - 1 freq lowtit - 2 freq loutit - 3 freq leitit - 3 freq leeded - 1 freq ledeit - 2 freq laid-oot - 1 freq laid-out - 1 freq lauded - 1 freq |
MetaPhone code - L0T loathit - 2 freq laithed - 2 freq loathed - 2 freq |
LOATHIT |
| Time to execute Levenshtein function - 0.214790 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.368326 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.027499 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.037078 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.000871 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. |