| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unliterally (0) - 1 freq literally (2) - 42 freq unilaterally (2) - 5 freq liberally (3) - 1 freq universally (3) - 5 freq iterally (3) - 1 freq naitrally (3) - 1 freq naiturally (3) - 2 freq politically (4) - 6 freq leeterally (4) - 2 freq literary (4) - 63 freq culturally (4) - 8 freq uniformally (4) - 1 freq naturally (4) - 42 freq naiteral (4) - 6 freq €˜literary (4) - 1 freq unlikely (4) - 22 freq unilateral (4) - 1 freq literal (4) - 7 freq literacy (4) - 34 freq internally (4) - 4 freq initially (4) - 4 freq miserably (5) - 3 freq habitually (5) - 3 freq unnerlay (5) - 1 freq |
unliterally (0) - 1 freq unilaterally (2) - 5 freq literally (3) - 42 freq naiturally (4) - 2 freq naitrally (4) - 1 freq culturally (5) - 8 freq liberally (5) - 1 freq naturally (5) - 42 freq iterally (5) - 1 freq leeterally (5) - 2 freq unilateral (5) - 1 freq initially (6) - 4 freq literal (6) - 7 freq internally (6) - 4 freq naiturallie (6) - 2 freq naitrallie (6) - 1 freq leiterallie (6) - 2 freq naaturall (6) - 1 freq politically (6) - 6 freq naiteral (6) - 6 freq universally (6) - 5 freq naitralie (7) - 1 freq neteral (7) - 1 freq politicially (7) - 1 freq walter'll (7) - 1 freq |
SoundEx code - U543 unload - 3 freq unloadin - 6 freq unilateral - 1 freq unloadit - 1 freq unwieldy - 1 freq unhealthy - 8 freq umlaut - 3 freq unloddan - 1 freq unyauld - 1 freq unlatch - 1 freq unloaded - 1 freq unladin - 1 freq unilaterally - 5 freq umlauts - 2 freq unliterally - 1 freq |
MetaPhone code - UNLTRL unilateral - 1 freq unilaterally - 5 freq unliterally - 1 freq |
UNLITERALLY |
| Time to execute Levenshtein function - 0.213832 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.369468 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.027195 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.036831 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.000879 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. |