| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nabob (0) - 1 freq abou (2) - 1 freq tabor (2) - 1 freq nab (2) - 10 freq nibon (2) - 1 freq nebo (2) - 1 freq narb (2) - 2 freq nato- (2) - 1 freq labor (2) - 1 freq nato (2) - 5 freq jacob (2) - 42 freq abo (2) - 2 freq kabb (2) - 1 freq nob (2) - 1 freq aboo (2) - 2 freq abot (2) - 1 freq taboo (2) - 4 freq nrbo (2) - 1 freq jabot (2) - 1 freq nahor (2) - 3 freq nibor (2) - 2 freq naxos (2) - 2 freq bob (2) - 214 freq naeb (2) - 8 freq jakob (2) - 1 freq |
nabob (0) - 1 freq nrbo (3) - 1 freq nob (3) - 1 freq nibor (3) - 2 freq bob (3) - 214 freq nabbie (3) - 7 freq nebby (3) - 2 freq naeb (3) - 8 freq kabb (3) - 1 freq nobby (3) - 1 freq nibon (3) - 1 freq nab (3) - 10 freq narb (3) - 2 freq nebo (3) - 1 freq nebdy (4) - 1 freq nub (4) - 5 freq enable (4) - 4 freq nxb (4) - 1 freq bebo (4) - 1 freq gibb (4) - 12 freq nitb (4) - 1 freq bobo (4) - 9 freq ngobo (4) - 4 freq ncb (4) - 1 freq nobel (4) - 9 freq |
SoundEx code - N110 nippy-yappy - 1 freq navefu - 1 freq neive-fu - 1 freq neivefu - 1 freq nabob - 1 freq nefife - 1 freq |
MetaPhone code - NBB nabob - 1 freq |
NABOB |
| Time to execute Levenshtein function - 0.231087 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.372402 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.028312 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.038173 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.000920 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. |