| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| literally (0) - 42 freq iterally (1) - 1 freq liberally (1) - 1 freq literary (2) - 63 freq unliterally (2) - 1 freq literacy (2) - 34 freq leeterally (2) - 2 freq literal (2) - 7 freq eternally (3) - 7 freq liberal (3) - 26 freq ideally (3) - 2 freq liberals (3) - 5 freq materially (3) - 1 freq generally (3) - 56 freq legally (3) - 13 freq externally (3) - 1 freq naturally (3) - 44 freq naitrally (3) - 1 freq lateral (3) - 3 freq literar (3) - 3 freq leiterallie (3) - 2 freq leiteracy (3) - 3 freq ritually (3) - 2 freq vitally (3) - 1 freq internally (3) - 4 freq |
literally (0) - 42 freq leeterally (2) - 2 freq liberally (2) - 1 freq iterally (2) - 1 freq leiterallie (3) - 2 freq literal (3) - 7 freq unliterally (3) - 1 freq naitrally (4) - 1 freq lateral (4) - 3 freq naturally (4) - 44 freq naiturally (4) - 2 freq materially (4) - 1 freq literacy (4) - 34 freq literary (4) - 63 freq leiterary (5) - 4 freq laverell (5) - 1 freq literati (5) - 3 freq literate (5) - 9 freq unilaterally (5) - 5 freq culturally (5) - 8 freq litill (5) - 1 freq editorially (5) - 1 freq litrle (5) - 1 freq leeteral (5) - 2 freq littill (5) - 1 freq |
SoundEx code - L364 literal - 7 freq literally - 42 freq litrle - 1 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 litrle - 1 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.205874 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.412625 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.030818 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.040242 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.000977 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. |