| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bountifae (0) - 1 freq bountifou (2) - 1 freq boontifu (3) - 1 freq boutique (3) - 1 freq bontine (3) - 2 freq bounties (3) - 2 freq bluntie (3) - 2 freq bruntie (3) - 6 freq poustie (4) - 2 freq voustie (4) - 1 freq chuntie (4) - 4 freq bouncin (4) - 12 freq moontide (4) - 1 freq montie (4) - 1 freq doontime (4) - 1 freq bowelfae (4) - 1 freq haunfae (4) - 9 freq bounteous (4) - 1 freq countit (4) - 3 freq moothfae (4) - 10 freq identifie (4) - 1 freq coontie (4) - 8 freq bonxie (4) - 8 freq buntings (4) - 1 freq oantae (4) - 99 freq |
bountifae (0) - 1 freq bountifou (2) - 1 freq boontifu (3) - 1 freq bounties (4) - 2 freq bontine (4) - 2 freq bount (5) - 1 freq bounteous (5) - 1 freq bounty (5) - 10 freq identifie (5) - 1 freq bantie (5) - 3 freq butif (5) - 1 freq bountys (5) - 1 freq antifa (5) - 1 freq buntin (5) - 4 freq identifee (5) - 5 freq bonnify (5) - 2 freq bruntie (5) - 6 freq bluntie (5) - 2 freq boutique (5) - 1 freq boontiefil (5) - 1 freq beautify (6) - 4 freq countra (6) - 5 freq countrie (6) - 8 freq countan (6) - 1 freq buttie (6) - 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 - BNTF bountifae - 1 freq bountifou - 1 freq bunnet-fou - 1 freq boontifu - 1 freq |
BOUNTIFAE |
| Time to execute Levenshtein function - 0.224137 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.396712 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.028646 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.038156 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.000921 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. |