| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boontiefil (0) - 1 freq boontifu (3) - 1 freq coontie (4) - 8 freq coonties (4) - 5 freq boonie (4) - 2 freq bottleful (4) - 1 freq bountifae (4) - 1 freq booncie (4) - 1 freq coontiess (4) - 1 freq booties (4) - 1 freq bounties (4) - 2 freq toontie-six (4) - 1 freq bountifou (4) - 1 freq moothfil (4) - 1 freq coonterin (4) - 3 freq loonie'll (4) - 1 freq boonies (4) - 1 freq bootie (4) - 1 freq poostie (5) - 1 freq foostie (5) - 15 freq coonted (5) - 16 freq wonderfil (5) - 1 freq coonter' (5) - 1 freq counties (5) - 2 freq coortiers (5) - 3 freq |
boontiefil (0) - 1 freq boontifu (4) - 1 freq bountifou (5) - 1 freq bountifae (5) - 1 freq beautiful (6) - 132 freq bounties (6) - 2 freq boastful (6) - 1 freq brautiful (6) - 1 freq besutiful (6) - 1 freq bottleful (6) - 1 freq ontil (7) - 53 freq plentiful (7) - 1 freq oantil (7) - 1 freq bonniely (7) - 1 freq identifie (7) - 1 freq bentley (7) - 4 freq dootful (7) - 3 freq continual (7) - 2 freq byoo-ootiful (7) - 4 freq bottil (7) - 6 freq borthel (7) - 1 freq beauti-ful (7) - 3 freq gratefil (7) - 1 freq bantie (7) - 3 freq bonspiel (7) - 2 freq |
SoundEx code - B531 bountifae - 1 freq baund-practice - 1 freq bountifou - 1 freq boontiefil - 1 freq bane-deep - 3 freq bunnet-fou - 1 freq boontifu - 1 freq bye-and-bye - 1 freq bentaps - 1 freq bound-up - 1 freq behindthefolk - 1 freq bindvdn - 1 freq bandparts - 1 freq |
MetaPhone code - BNTFL boontiefil - 1 freq |
BOONTIEFIL |
| Time to execute Levenshtein function - 0.209989 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.385627 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.028217 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.039470 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.000909 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. |