| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hnb (0) - 1 freq hib (1) - 1 freq snb (1) - 2 freq hub (1) - 31 freq hny (1) - 1 freq hob (1) - 10 freq hnd (1) - 3 freq hvb (1) - 2 freq hb (1) - 9 freq bnb (1) - 1 freq hn (1) - 3 freq jnb (1) - 1 freq nb (1) - 4 freq heb (1) - 1 freq hnc (1) - 1 freq hlf (2) - 2 freq hm (2) - 12 freq fib (2) - 3 freq €œb (2) - 1 freq eb (2) - 6 freq hap (2) - 53 freq snab (2) - 1 freq xb (2) - 3 freq ohne (2) - 1 freq hof (2) - 1 freq |
hnb (0) - 1 freq hn (2) - 3 freq bnb (2) - 1 freq nb (2) - 4 freq heb (2) - 1 freq hnc (2) - 1 freq hb (2) - 9 freq jnb (2) - 1 freq hib (2) - 1 freq snb (2) - 2 freq hvb (2) - 2 freq hny (2) - 1 freq hub (2) - 31 freq hob (2) - 10 freq hnd (2) - 3 freq hank (3) - 7 freq hina (3) - 2 freq ahrb (3) - 1 freq hand (3) - 319 freq kneb (3) - 1 freq heni (3) - 2 freq hunk (3) - 5 freq honk (3) - 1 freq yhn (3) - 2 freq knob (3) - 12 freq |
SoundEx code - H510 hanfae - 3 freq hmph - 1 freq haanfae - 6 freq hump - 15 freq hmmph - 8 freq 'hmmph - 2 freq haunfu - 8 freq haunfa - 1 freq hemp - 3 freq humpf - 1 freq humpie - 1 freq hanfu - 10 freq hanf - 2 freq humph - 14 freq hmv - 2 freq hmyv - 1 freq haunfae - 8 freq humphy - 52 freq hamnivo - 1 freq hamnavoe - 4 freq hyne-aff - 1 freq hempie - 2 freq humbie - 1 freq hinny-bee - 1 freq hmfff - 1 freq humfy - 1 freq hmbbw - 1 freq hoomp - 1 freq hmmmph - 1 freq hannahb - 6 freq hanfuÂ’ - 1 freq hnb - 1 freq hmp - 1 freq |
MetaPhone code - NB neb - 274 freq nebbie - 9 freq nabbie - 7 freq nab - 10 freq nebby - 2 freq newbie - 2 freq nub - 5 freq nubbie - 1 freq nib - 10 freq knob - 12 freq nob - 1 freq neib - 1 freq kneb - 1 freq nebe - 4 freq knoab - 1 freq neeb - 2 freq knabbie - 4 freq naeb - 8 freq nibbie - 1 freq nb - 4 freq nebo - 1 freq ynbiw - 1 freq hnb - 1 freq nobby - 1 freq |
HNB |
| Time to execute Levenshtein function - 0.220076 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.347795 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.028248 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.037040 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.000756 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. |