| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leeterar (0) - 14 freq leeterary (1) - 19 freq leeteral (1) - 2 freq literar (2) - 3 freq leeberal (2) - 3 freq leeterati (2) - 1 freq leebrar (2) - 1 freq leeterate (2) - 9 freq lÃterar (2) - 1 freq leeteratur (2) - 21 freq leiterary (2) - 4 freq leetral (2) - 1 freq leeteracy (2) - 15 freq leeterature (3) - 15 freq retenar (3) - 1 freq leeberty (3) - 4 freq laeter (3) - 1 freq leear (3) - 16 freq leeterally (3) - 2 freq letter (3) - 240 freq bleeter (3) - 3 freq ceterae (3) - 1 freq gleeterin (3) - 1 freq weeter (3) - 2 freq letteris (3) - 1 freq |
leeterar (0) - 14 freq leeterary (1) - 19 freq leiterary (2) - 4 freq literar (2) - 3 freq leeteral (2) - 2 freq leetral (3) - 1 freq leeteracy (3) - 15 freq leiterarie (3) - 43 freq loiterer (3) - 1 freq literary (3) - 63 freq leeteratur (3) - 21 freq leebrar (3) - 1 freq leeterati (3) - 1 freq leeterate (3) - 9 freq leiterairie (4) - 1 freq lecturer (4) - 17 freq literal (4) - 7 freq leetratur (4) - 6 freq leiteratur (4) - 21 freq leiterate (4) - 1 freq laeter (4) - 1 freq lateral (4) - 3 freq leeterature (4) - 15 freq lÃterar (4) - 1 freq leeberal (4) - 3 freq |
SoundEx code - L366 leiterarie - 43 freq leiterary - 4 freq literary - 63 freq leader-writers - 1 freq literarie - 1 freq leitherarie - 1 freq 'leiterarie - 1 freq letter-huird - 2 freq lit'rary - 1 freq looderhorns - 1 freq leeterary - 19 freq leiterairie - 1 freq leeterar - 14 freq lÃterar - 1 freq loiterer - 1 freq €˜literary - 1 freq literar - 3 freq |
MetaPhone code - LTRR leiterarie - 43 freq leiterary - 4 freq literary - 63 freq literarie - 1 freq 'leiterarie - 1 freq lit'rary - 1 freq leeterary - 19 freq leiterairie - 1 freq leeterar - 14 freq lÃterar - 1 freq loiterer - 1 freq €˜literary - 1 freq literar - 3 freq |
LEETERAR |
| Time to execute Levenshtein function - 0.217853 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.388640 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.027709 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.037494 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.000892 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. |