| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nesbitt (0) - 5 freq nesbit (1) - 1 freq nebbit (2) - 5 freq nestit (2) - 3 freq nisbett (2) - 1 freq neebit (2) - 2 freq nesbitt's (2) - 1 freq neibit (2) - 3 freq neidit (3) - 1 freq corbitt (3) - 1 freq beskit (3) - 3 freq lestit (3) - 11 freq bitt (3) - 1 freq neist (3) - 561 freq testit (3) - 10 freq neckit (3) - 2 freq fessit (3) - 2 freq neebirs (3) - 9 freq nesty (3) - 38 freq despite (3) - 101 freq resist (3) - 47 freq nisbet (3) - 26 freq nestily (3) - 1 freq needit (3) - 167 freq respiyt (3) - 1 freq |
nesbitt (0) - 5 freq nisbett (2) - 1 freq nesbit (2) - 1 freq nestit (3) - 3 freq nisbet (4) - 26 freq neibit (4) - 3 freq nesbitt's (4) - 1 freq nebbit (4) - 5 freq neebit (4) - 2 freq restit (5) - 18 freq nabbit (5) - 2 freq nesbister (5) - 1 freq nestin (5) - 3 freq smitt (5) - 1 freq nestlt (5) - 1 freq nest (5) - 81 freq nests (5) - 27 freq inhabitit (5) - 1 freq nestie (5) - 7 freq nestis (5) - 1 freq jestit (5) - 1 freq nest- (5) - 1 freq vestit (5) - 1 freq neist (5) - 561 freq testit (5) - 10 freq |
SoundEx code - N213 nacbody - 6 freq nisbet - 26 freq nacboadie - 1 freq nacbdy - 1 freq nesbitt's - 1 freq nesbitt - 5 freq nisbett - 1 freq nesbit - 1 freq nicbhatair - 1 freq nickftof - 1 freq noxfd - 1 freq |
MetaPhone code - NSBT nisbet - 26 freq nesbitt - 5 freq nisbett - 1 freq nesbit - 1 freq |
NESBITT |
| Time to execute Levenshtein function - 0.170304 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.323729 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.027576 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.038263 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.000916 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. |