Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bountifae (0) - 1 freq bountifou (2) - 1 freq bluntie (3) - 2 freq bounties (3) - 2 freq bruntie (3) - 6 freq boutique (3) - 1 freq bontine (3) - 2 freq boontifu (3) - 1 freq counting (4) - 4 freq bow-tie (4) - 1 freq bonfire (4) - 28 freq boitie (4) - 2 freq counties' (4) - 1 freq roushiae (4) - 3 freq bourtree (4) - 3 freq bonilie (4) - 1 freq bounce (4) - 23 freq boughtie (4) - 1 freq poustie (4) - 2 freq buttie (4) - 2 freq youthfa (4) - 1 freq couttie (4) - 12 freq boatie (4) - 124 freq gounie (4) - 7 freq untie (4) - 2 freq |
bountifae (0) - 1 freq bountifou (2) - 1 freq boontifu (3) - 1 freq bontine (4) - 2 freq bounties (4) - 2 freq butif (5) - 1 freq bounty (5) - 10 freq antifa (5) - 1 freq bonnify (5) - 2 freq boontiefil (5) - 1 freq buntin (5) - 4 freq bountys (5) - 1 freq bantie (5) - 3 freq identifie (5) - 1 freq identifee (5) - 5 freq bount (5) - 1 freq bruntie (5) - 6 freq boutique (5) - 1 freq bounteous (5) - 1 freq bluntie (5) - 2 freq countrie (6) - 8 freq oantae (6) - 99 freq moontide (6) - 1 freq bouncin (6) - 12 freq boannie (6) - 59 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.223011 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.360891 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.027952 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.037577 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.000908 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. |