Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
davygavin (0) - 33 freq navigatin (3) - 2 freq tyaavin (4) - 2 freq daavid (4) - 12 freq daarin (4) - 1 freq bargain (4) - 33 freq dravin (4) - 4 freq dailygan (4) - 9 freq driyvin (4) - 1 freq kayakin (4) - 2 freq damagin (4) - 3 freq deavin (4) - 8 freq managagin (4) - 1 freq day-suin (4) - 1 freq divvin (4) - 1 freq wavvin (4) - 3 freq dailygaun (4) - 20 freq derogatin (4) - 1 freq oangaein (4) - 6 freq byaavin (4) - 1 freq snyaavin (4) - 2 freq oangawin (4) - 1 freq day-in (4) - 1 freq dangin (4) - 1 freq again (4) - 2645 freq |
davygavin (0) - 33 freq devolvin (5) - 2 freq divvin (5) - 1 freq navigatin (5) - 2 freq navigation (6) - 2 freq devydin (6) - 1 freq dangin (6) - 1 freq dargin (6) - 7 freq derogatin (6) - 1 freq divvyin (6) - 1 freq delegatin (6) - 1 freq divven (6) - 1 freq gavin (6) - 42 freq danglin (6) - 16 freq dailygaun (6) - 20 freq daveraver (6) - 2 freq devaalin (6) - 1 freq damagin (6) - 3 freq driyvin (6) - 1 freq wavvin (6) - 3 freq dravin (6) - 4 freq deavin (6) - 8 freq dailygan (6) - 9 freq dovin (7) - 2 freq doggin (7) - 10 freq |
SoundEx code - D121 dub-spirkit - 1 freq divisive - 7 freq devisive - 2 freq dvcv - 3 freq duvxb - 1 freq davecbatchelor - 3 freq dfzvsquvu - 1 freq dofjafcw - 1 freq dpgfvxd - 1 freq dvhikpz - 1 freq dtbcbiqygj - 1 freq dfpxv - 1 freq davegiff - 1 freq dbbvjbopx - 1 freq davygavin - 33 freq |
MetaPhone code - TFKFN davygavin - 33 freq |
DAVYGAVIN |
Time to execute Levenshtein function - 0.234931 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.364711 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.027886 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.039844 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.000907 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. |