Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
name-caain (0) - 1 freq hame-farin (3) - 1 freq hame-cumin (3) - 1 freq hame-bakin (3) - 1 freq hame-comin (3) - 4 freq hame-gaein (3) - 1 freq sae-caad (4) - 1 freq sae-caa (4) - 1 freq recaain (4) - 1 freq aye-gauin (4) - 1 freq name-drappin (4) - 2 freq nae-tail (4) - 1 freq miscaain (4) - 3 freq mercatin (4) - 4 freq hamefarin (4) - 9 freq hamecomin (4) - 11 freq na-sayin (4) - 4 freq hame-combin (4) - 2 freq cake-makin (4) - 2 freq name-plate (4) - 1 freq hame-gaun (4) - 5 freq naecthin (4) - 1 freq naethin (5) - 800 freq sie-farin (5) - 5 freq ham-actin (5) - 1 freq |
name-caain (0) - 1 freq hame-gaein (5) - 1 freq hame-comin (5) - 4 freq hame-cumin (5) - 1 freq miscaain (6) - 3 freq na-sayin (6) - 4 freq hame-gaun (6) - 5 freq hame-farin (6) - 1 freq hame-bakin (6) - 1 freq namin (7) - 7 freq mercian (7) - 4 freq some-ean (7) - 28 freq ham-actin (7) - 1 freq time-in (7) - 1 freq naemin (7) - 1 freq me-an (7) - 1 freq neo-con (7) - 3 freq american (7) - 92 freq com-comin (7) - 1 freq can-can (7) - 3 freq nominatin (7) - 1 freq jamaican (7) - 13 freq menacin (7) - 3 freq nae-tail (7) - 1 freq naecthin (7) - 1 freq |
SoundEx code - N525 nonsense - 77 freq nonsense' - 1 freq non-accent - 1 freq nonagenarian - 1 freq non-committal - 1 freq non-commonity - 1 freq nansense - 1 freq name-caain - 1 freq nine-coonty - 1 freq noncommittal - 1 freq non-smoker - 1 freq noncombatant - 1 freq €œnonsense - 1 freq nonsensicaledonian - 1 freq naehamecomforts - 1 freq nonsinse - 1 freq nonsense- - 2 freq nonsence - 1 freq nonsensical - 1 freq nonacjiims - 1 freq |
MetaPhone code - NMKN name-caain - 1 freq |
NAME-CAAIN |
Time to execute Levenshtein function - 0.911315 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 - 1.284262 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.093513 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.105535 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.000940 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. |