| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bellochs (0) - 1 freq belloch (1) - 3 freq yellochs (1) - 1 freq bellocht (1) - 1 freq bollocks (2) - 7 freq belloched (2) - 21 freq yellocht (2) - 1 freq bellows (2) - 6 freq bellochin (2) - 3 freq yelloch (2) - 7 freq bullocks (2) - 2 freq belly's (3) - 7 freq bellies (3) - 22 freq becloods (3) - 1 freq gullocks (3) - 1 freq beuchs (3) - 4 freq mollochy (3) - 1 freq ellon's (3) - 1 freq yellochin (3) - 11 freq betocht (3) - 1 freq bellowed (3) - 2 freq kelsohs (3) - 1 freq bellas (3) - 1 freq billows (3) - 1 freq bourochs (3) - 1 freq |
bellochs (0) - 1 freq belloch (2) - 3 freq bellocht (2) - 1 freq yellochs (2) - 1 freq bullocks (3) - 2 freq bellochin (3) - 3 freq belloched (3) - 21 freq bollocks (3) - 7 freq bellicose (4) - 1 freq gollachs (4) - 3 freq mullachs (4) - 1 freq belches (4) - 1 freq yellocht (4) - 1 freq bellows (4) - 6 freq yelloch (4) - 7 freq belles (5) - 1 freq bellys (5) - 1 freq walloch (5) - 1 freq bedlicht (5) - 1 freq bealach (5) - 1 freq belle's (5) - 1 freq gellicks (5) - 5 freq pollocks (5) - 1 freq bullock (5) - 3 freq balloons (5) - 16 freq |
SoundEx code - B422 bellochs - 1 freq bellises - 1 freq bulges - 2 freq bleezes - 6 freq blackest - 4 freq bellycastle - 3 freq bellicose - 1 freq balzac - 1 freq blazes - 1 freq blushes - 3 freq blokes - 8 freq blisses - 3 freq blackie's - 2 freq blackjack - 1 freq bluschis - 1 freq bloosis - 1 freq blouses - 2 freq biological - 5 freq blakaz - 1 freq byological - 1 freq blasius - 1 freq bleckcocks - 1 freq belches - 1 freq blackies - 1 freq ball-cocks - 1 freq blackcock - 2 freq blackcockha - 1 freq black-hack - 1 freq blogosphere - 1 freq billykayscot - 341 freq blxwakw - 1 freq blazespage - 22 freq blessesd - 1 freq blackislepmd - 4 freq bloke's - 2 freq ballycastle - 3 freq |
MetaPhone code - BLXS bellochs - 1 freq blotches - 3 freq bloatches - 1 freq blushes - 3 freq belches - 1 freq |
BELLOCHS |
| Time to execute Levenshtein function - 0.227423 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.491861 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.039272 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.040922 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.000985 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. |