| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| literally (0) - 42 freq iterally (1) - 1 freq liberally (1) - 1 freq literal (2) - 7 freq leeterally (2) - 2 freq literacy (2) - 34 freq unliterally (2) - 1 freq literary (2) - 63 freq internally (3) - 4 freq lit'rary (3) - 1 freq materially (3) - 1 freq literar (3) - 3 freq externally (3) - 1 freq generally (3) - 55 freq leiterary (3) - 3 freq literati (3) - 3 freq ideally (3) - 2 freq vitally (3) - 1 freq liberal (3) - 26 freq eternally (3) - 7 freq leiterallie (3) - 2 freq legally (3) - 13 freq naturally (3) - 42 freq naiturally (3) - 2 freq leiteracy (3) - 3 freq |
literally (0) - 42 freq liberally (2) - 1 freq leeterally (2) - 2 freq iterally (2) - 1 freq literal (3) - 7 freq unliterally (3) - 1 freq leiterallie (3) - 2 freq naturally (4) - 42 freq naitrally (4) - 1 freq naiturally (4) - 2 freq lateral (4) - 3 freq literacy (4) - 34 freq materially (4) - 1 freq literary (4) - 63 freq liberals (5) - 5 freq literate (5) - 9 freq literarie (5) - 1 freq laverell (5) - 1 freq culturally (5) - 8 freq unilaterally (5) - 5 freq littill (5) - 1 freq editorially (5) - 1 freq leeteral (5) - 2 freq litill (5) - 1 freq literar (5) - 3 freq |
SoundEx code - L364 literal - 7 freq literally - 42 freq leeteral - 2 freq lateral - 3 freq leeterally - 2 freq leiterallie - 2 freq litherlie - 1 freq leetral - 1 freq latterly - 4 freq latterlie - 2 freq leaderless - 1 freq |
MetaPhone code - LTRL literal - 7 freq literally - 42 freq leeteral - 2 freq lateral - 3 freq leeterally - 2 freq leiterallie - 2 freq leetral - 1 freq latterly - 4 freq latterlie - 2 freq |
LITERALLY |
| Time to execute Levenshtein function - 0.376347 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.639210 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.050601 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.037571 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.000868 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. |