| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bodices (0) - 1 freq bodies (1) - 184 freq bodice (1) - 1 freq boxies (2) - 4 freq bodes (2) - 4 freq bodies' (2) - 2 freq bodine (2) - 1 freq boadies (2) - 49 freq bosies (2) - 18 freq abodies (2) - 1 freq bodie (2) - 443 freq bowies (2) - 3 freq bogies (2) - 3 freq bo'dies (2) - 1 freq boonces (2) - 4 freq bounces (2) - 4 freq bodie's (2) - 7 freq voices (2) - 113 freq boies (2) - 1 freq bodachs (2) - 2 freq booies (2) - 1 freq notices (2) - 16 freq bodied (2) - 2 freq comics (3) - 20 freq oxides (3) - 1 freq |
bodices (0) - 1 freq bodies (2) - 184 freq bodice (2) - 1 freq boonces (3) - 4 freq bounces (3) - 4 freq abodies (3) - 1 freq bodachs (3) - 2 freq bodie's (3) - 7 freq bodes (3) - 4 freq boadies (3) - 49 freq basics (4) - 7 freq baddies (4) - 3 freq body's (4) - 26 freq boadie's (4) - 2 freq beadies (4) - 1 freq bruces (4) - 13 freq reduces (4) - 1 freq bodeis (4) - 1 freq badges (4) - 11 freq dics (4) - 1 freq beeces (4) - 1 freq boccies (4) - 1 freq beddies (4) - 2 freq bides (4) - 230 freq induces (4) - 1 freq |
SoundEx code - B322 boytachs - 1 freq bitches - 6 freq bodices - 1 freq badges - 11 freq betsy's - 4 freq bite-sized - 1 freq bodachs - 2 freq bodychecks - 1 freq budgie's - 1 freq bitches - 1 freq badjokefriday - 1 freq bitchystichy - 5 freq bdjwj - 1 freq bitesize - 1 freq budgies - 1 freq |
MetaPhone code - BTSS bodices - 1 freq betsy's - 4 freq bitesize - 1 freq |
BODICES |
| Time to execute Levenshtein function - 0.392740 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.629383 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.066976 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.040861 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.000912 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. |