| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| literary (0) - 63 freq leiterary (1) - 4 freq lit'rary (1) - 1 freq literacy (1) - 34 freq literar (1) - 3 freq library (2) - 174 freq leeterary (2) - 19 freq literate (2) - 9 freq literati (2) - 3 freq literal (2) - 7 freq literally (2) - 42 freq €˜literary (2) - 1 freq leiteracy (2) - 3 freq literarie (2) - 1 freq leebrary (3) - 4 freq libary (3) - 1 freq liter (3) - 1 freq aikeray (3) - 2 freq leibrary (3) - 1 freq liberals (3) - 5 freq itinerary (3) - 2 freq riteday (3) - 1 freq teary (3) - 3 freq librar (3) - 8 freq iterally (3) - 1 freq |
literary (0) - 63 freq literar (1) - 3 freq leiterary (1) - 4 freq leeterary (2) - 19 freq lit'rary (2) - 1 freq literarie (2) - 1 freq literacy (2) - 34 freq leiterarie (3) - 43 freq leiteracy (3) - 3 freq leeterar (3) - 14 freq loiterer (3) - 1 freq literate (3) - 9 freq literati (3) - 3 freq literal (3) - 7 freq library (3) - 174 freq librar (4) - 8 freq liturgy (4) - 3 freq leiterate (4) - 1 freq terry (4) - 16 freq leeteracy (4) - 15 freq libarry (4) - 1 freq leiterairie (4) - 1 freq €˜literary (4) - 1 freq literature (4) - 94 freq lateral (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 |
LITERARY |
| Time to execute Levenshtein function - 0.304120 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.511073 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.059517 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.037590 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. |