Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
newbattle (0) - 8 freq newcastle (2) - 24 freq seattle (3) - 3 freq €œbattle (3) - 1 freq battle (3) - 125 freq 'battle (3) - 1 freq nettle (3) - 8 freq newtyle (3) - 2 freq meirbattle (3) - 1 freq embattled (3) - 1 freq debatable (4) - 1 freq newfangles (4) - 1 freq wradtle (4) - 1 freq bastle (4) - 1 freq rewable (4) - 1 freq bottle (4) - 376 freq sattle (4) - 21 freq neukatyke (4) - 1 freq neatly (4) - 26 freq nattled (4) - 1 freq rettle (4) - 1 freq beattie (4) - 6 freq newance (4) - 4 freq negative (4) - 41 freq peattie (4) - 5 freq |
newbattle (0) - 8 freq newcastle (4) - 24 freq nettle (5) - 8 freq 'battle (5) - 1 freq meirbattle (5) - 1 freq newtyle (5) - 2 freq battle (5) - 125 freq €œbattle (5) - 1 freq sawbathlie (6) - 1 freq bittle (6) - 1 freq swittle (6) - 2 freq whittle (6) - 3 freq morebattle (6) - 1 freq nesbitt (6) - 5 freq baittle (6) - 2 freq boattle (6) - 41 freq muirbattle (6) - 1 freq bottle (6) - 376 freq embattled (6) - 1 freq seattle (6) - 3 freq newbie (7) - 2 freq prattle (7) - 29 freq etttle (7) - 1 freq wradtle (7) - 1 freq battlen (7) - 2 freq |
SoundEx code - N134 naebdy'll - 2 freq naebody'll - 6 freq nuptial - 8 freq newbattle - 8 freq naphtali - 4 freq 'nuptial - 1 freq nuptials - 1 freq |
MetaPhone code - NBTL naebdy'll - 2 freq naebody'll - 6 freq newbattle - 8 freq |
NEWBATTLE |
Time to execute Levenshtein function - 0.208781 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.362402 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.031577 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.036851 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.000887 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. |