Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
leitit (0) - 3 freq leirit (1) - 24 freq leitil (1) - 1 freq lestit (1) - 11 freq leimit (1) - 1 freq leipit (1) - 1 freq leivit (1) - 3 freq leetit (1) - 6 freq lettir (2) - 2 freq fleetit (2) - 2 freq lestin (2) - 2 freq ruitit (2) - 7 freq greitit (2) - 1 freq lifitit (2) - 2 freq lernit (2) - 1 freq unitit (2) - 29 freq fleimit (2) - 3 freq leevit (2) - 4 freq smitit (2) - 1 freq peintit (2) - 8 freq eijit (2) - 1 freq leivin (2) - 62 freq maitit (2) - 1 freq rentit (2) - 6 freq neibit (2) - 3 freq |
leitit (0) - 3 freq leetit (1) - 6 freq litt (2) - 2 freq leirit (2) - 24 freq loutit (2) - 3 freq leitil (2) - 1 freq lootit (2) - 1 freq leimit (2) - 1 freq lestit (2) - 11 freq leipit (2) - 1 freq leivit (2) - 3 freq flaitit (3) - 3 freq leits (3) - 1 freq ectit (3) - 1 freq pleatit (3) - 3 freq electit (3) - 22 freq luftit (3) - 7 freq leetin (3) - 5 freq letft (3) - 1 freq likit (3) - 158 freq ledeit (3) - 2 freq leukit (3) - 305 freq eatit (3) - 1 freq leimitit (3) - 6 freq seatit (3) - 7 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 - LTT latehd - 1 freq loaded - 22 freq loadit - 19 freq laidit - 9 freq lootit - 1 freq leetit - 6 freq luddite - 1 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 ltd - 8 freq leeded - 1 freq ledeit - 2 freq laid-oot - 1 freq laid-out - 1 freq lauded - 1 freq |
LEITIT |
Time to execute Levenshtein function - 0.271412 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.388975 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.029141 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.041738 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.000974 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. |