| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bhxhv (0) - 1 freq vhzhv (2) - 1 freq bhxxo (2) - 1 freq beh (3) - 18 freq bycht (3) - 1 freq fhv (3) - 1 freq hxdav (3) - 1 freq hkhb (3) - 1 freq bocht (3) - 219 freq huv (3) - 1243 freq ohhhh (3) - 1 freq xxhw (3) - 1 freq ohhh (3) - 5 freq hv (3) - 4 freq 'hav (3) - 1 freq ah'vv (3) - 1 freq huh (3) - 16 freq ba'ht (3) - 1 freq ohohj (3) - 1 freq ehh (3) - 1 freq hhx (3) - 1 freq gxdv (3) - 1 freq box (3) - 407 freq shiv (3) - 3 freq boxen (3) - 1 freq |
bhxhv (0) - 1 freq bhxxo (4) - 1 freq vhzhv (4) - 1 freq hxdav (5) - 1 freq behaiv (5) - 1 freq hoho (6) - 1 freq bxxgj (6) - 1 freq shhhh (6) - 3 freq uaxhu (6) - 1 freq borh (6) - 1 freq jhsh (6) - 1 freq ehhm (6) - 1 freq bah (6) - 4 freq thev (6) - 3 freq hrh (6) - 1 freq ixqv (6) - 1 freq hhy (6) - 1 freq lthv (6) - 2 freq fehv (6) - 1 freq xzv (6) - 1 freq ahh (6) - 9 freq bheil (6) - 2 freq shyv (6) - 1 freq ahpsv (6) - 1 freq hthy (6) - 1 freq |
SoundEx code - B210 bicep - 2 freq backup - 1 freq byzeeby - 3 freq beeeeeeeeceeeep - 1 freq basebaw - 4 freq bishop - 15 freq basebaa - 1 freq bookshop - 2 freq bashfu - 1 freq back-pey - 1 freq boxfu - 1 freq bags-up - 1 freq bee-skep - 2 freq base-baa - 1 freq beukshop - 2 freq buikshop - 1 freq boxfoo - 1 freq back-shoppie - 1 freq bak-fa - 1 freq beaucoup - 2 freq bvcskkebe - 1 freq bskkfv - 1 freq bxfb - 1 freq bukb - 1 freq bvjxb - 1 freq byohxbyi - 1 freq bsb - 1 freq bqkv - 1 freq bxp - 1 freq bkxb - 1 freq bagpie - 1 freq bugaboo - 1 freq bhxhv - 1 freq big-buy - 1 freq bxb - 1 freq bvkufffaoo - 1 freq bcp - 1 freq busby - 1 freq bjv - 1 freq |
MetaPhone code - BKSF boxfu - 1 freq boxfoo - 1 freq bhxhv - 1 freq |
BHXHV |
| Time to execute Levenshtein function - 0.240495 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.424881 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.030690 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.038358 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.000857 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. |