| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bahoochies (0) - 1 freq bahoochie (1) - 6 freq behoochie (2) - 1 freq bahookies (2) - 2 freq bihoochie (2) - 1 freq hooches (3) - 1 freq cahootchie (3) - 2 freq brooches (3) - 1 freq bahoukies (3) - 1 freq bahookie (3) - 38 freq broonies (4) - 2 freq thochties (4) - 1 freq bahoukie (4) - 6 freq boonies (4) - 1 freq hoosies (4) - 9 freq pooches (4) - 44 freq bookies (4) - 25 freq boccies (4) - 1 freq shooched (4) - 1 freq choocher (4) - 1 freq chookies (4) - 19 freq bauchles (4) - 4 freq 'chookies (4) - 1 freq boories (4) - 1 freq thoochts (4) - 1 freq |
bahoochies (0) - 1 freq bahoochie (2) - 6 freq bihoochie (3) - 1 freq behoochie (3) - 1 freq hooches (4) - 1 freq brooches (4) - 1 freq bahookies (4) - 2 freq bourichies (5) - 1 freq boorachies (5) - 3 freq bahoukies (5) - 1 freq hoochin (6) - 2 freq blotches (6) - 3 freq brochires (6) - 3 freq benches (6) - 13 freq alchies (6) - 1 freq bothies (6) - 13 freq brochs (6) - 5 freq backies (6) - 5 freq hochles (6) - 1 freq hochs (6) - 12 freq bacchus (6) - 1 freq belches (6) - 1 freq breeches (6) - 1 freq beeches (6) - 1 freq beaches (6) - 12 freq |
SoundEx code - B220 beeches - 1 freq baukies - 2 freq because - 713 freq 'because - 44 freq busses - 18 freq beeswax - 5 freq beuchs - 4 freq baggage - 10 freq beukcase - 1 freq beseek - 1 freq bookies - 25 freq bushes - 41 freq bookie's - 12 freq buskis - 1 freq begeck - 14 freq buses - 45 freq baggies - 7 freq bessie's - 3 freq basic - 47 freq bakehoose - 1 freq buckie's - 3 freq bazooka - 2 freq boxes - 64 freq backies - 5 freq becis - 40 freq bosses - 9 freq backweys - 1 freq bikes - 31 freq bosy's - 1 freq basses - 2 freq buises - 1 freq beaches - 12 freq boughs - 7 freq beseiks - 1 freq baggy's - 5 freq becouse - 2 freq bicuss - 1 freq backswash - 1 freq bouzouki - 10 freq buzzes - 6 freq boaxes - 5 freq bakes - 17 freq boccies - 1 freq bicis - 1 freq basis - 46 freq bacchus - 1 freq bahoukies - 1 freq buses' - 1 freq bak-waash - 1 freq bases - 6 freq baecaas - 44 freq boyzees - 1 freq buggies - 3 freq buckies - 11 freq becas - 5 freq ''becas - 1 freq becas' - 1 freq backwyes - 1 freq beeces - 1 freq begowks - 1 freq begowk - 2 freq basics - 7 freq bahoochies - 1 freq bogies - 3 freq bagwash - 2 freq becaas - 9 freq becase - 15 freq beca'se - 1 freq bosies - 18 freq bekis - 6 freq boogie-woogie - 2 freq backhoose - 2 freq beciss - 1 freq becaase - 6 freq beseech - 2 freq buke's - 2 freq bookish - 1 freq 'becis - 2 freq buikies - 3 freq bogus - 3 freq boxies - 4 freq bacchic - 2 freq beseik - 1 freq bigake - 5 freq backwyse - 1 freq bakkies - 1 freq boxie's - 1 freq bykes - 1 freq bougies - 1 freq bakis - 1 freq bikies - 1 freq bukes - 1 freq buikish - 1 freq becise - 1 freq €œbecause - 8 freq basques - 1 freq becus - 1 freq biases - 1 freq bawsacks - 2 freq bashes - 1 freq biggish - 2 freq backsyke - 1 freq bookcase - 2 freq backwise - 1 freq bussies - 1 freq begecks - 1 freq bekiss - 2 freq bogeys - 1 freq bakehous - 1 freq biqyxh - 1 freq bugsyÂ’s - 1 freq bazuka - 1 freq bigsesh - 1 freq becky's - 1 freq bahookies - 2 freq bsauzee - 1 freq bfbaguzqha - 1 freq bxwojh - 1 freq backake - 1 freq bessieÂ’s - 1 freq bawjaws - 3 freq bsyz - 1 freq bakesy - 1 freq bizcocho - 1 freq bjawk - 1 freq becos - 1 freq bigissue - 1 freq bsuk - 3 freq bigjock - 1 freq |
MetaPhone code - BHXS bahoochies - 1 freq |
BAHOOCHIES |
| Time to execute Levenshtein function - 0.242349 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.418582 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.034242 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.037950 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.000934 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. |