| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nisbet (0) - 26 freq nisbett (1) - 1 freq listet (2) - 1 freq tistet (2) - 2 freq wisset (2) - 1 freq nibblt (2) - 1 freq nibbelt (2) - 2 freq nesbit (2) - 1 freq nise (2) - 1 freq nittet (2) - 1 freq gibbet (2) - 5 freq tibet (2) - 10 freq bisset (2) - 4 freq nippet (2) - 10 freq nugget (3) - 8 freq gist (3) - 13 freq picket (3) - 24 freq hisel (3) - 18 freq mise (3) - 1 freq nikies (3) - 1 freq pished (3) - 31 freq nfqbt (3) - 1 freq libbed (3) - 1 freq neshed (3) - 1 freq wiet (3) - 2 freq |
nisbet (0) - 26 freq nisbett (2) - 1 freq nesbit (2) - 1 freq neebit (4) - 2 freq naist (4) - 7 freq nebbit (4) - 5 freq neist (4) - 560 freq neibit (4) - 3 freq nabbit (4) - 2 freq nusiret (4) - 37 freq nesbitt (4) - 5 freq niest (4) - 2 freq nest (4) - 81 freq noobut (4) - 1 freq onset (4) - 7 freq inset (4) - 2 freq nasuwt (4) - 1 freq nestit (4) - 3 freq bisset (4) - 4 freq nippet (4) - 10 freq nibblt (4) - 1 freq tibet (4) - 10 freq nibbelt (4) - 2 freq nittet (4) - 1 freq gibbet (4) - 5 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 |
NISBET |
| Time to execute Levenshtein function - 0.196604 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.334870 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.029449 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.038435 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.000824 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. |