| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leiterarie (0) - 43 freq literarie (1) - 1 freq leiterairie (1) - 1 freq 'leiterarie (1) - 1 freq leitherarie (1) - 1 freq leiterary (2) - 4 freq leiterate (2) - 1 freq leiterallie (2) - 2 freq leibrarie (2) - 4 freq leeteracies (3) - 2 freq leiteracy (3) - 3 freq leibraries (3) - 1 freq leeterar (3) - 14 freq leeterary (3) - 19 freq literar (3) - 3 freq librarie (3) - 1 freq leiterature (3) - 12 freq literacies (3) - 1 freq leeterati (3) - 1 freq literate (3) - 9 freq literati (3) - 3 freq leeterate (3) - 9 freq literary (3) - 63 freq leibertie (3) - 1 freq leitanie (3) - 1 freq |
leiterarie (0) - 43 freq leiterairie (1) - 1 freq literarie (1) - 1 freq leiterary (2) - 4 freq leitherarie (2) - 1 freq 'leiterarie (2) - 1 freq leeterar (3) - 14 freq leeterary (3) - 19 freq literar (3) - 3 freq literary (3) - 63 freq leibrarie (3) - 4 freq leiterate (3) - 1 freq literati (4) - 3 freq literate (4) - 9 freq loiterer (4) - 1 freq leeterati (4) - 1 freq leeterate (4) - 9 freq leiteratur (4) - 21 freq leiterallie (4) - 2 freq librarie (4) - 1 freq leiteracy (4) - 3 freq leiterature (4) - 12 freq loiterin (5) - 3 freq literal (5) - 7 freq leibrary (5) - 1 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 |
LEITERARIE |
| Time to execute Levenshtein function - 0.184829 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.350961 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.028495 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.037246 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.000876 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. |