| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonanza (0) - 2 freq banana (2) - 45 freq bolanus (3) - 1 freq bonns (3) - 2 freq babaza (3) - 1 freq banzai (3) - 1 freq bryanca (3) - 4 freq montana (3) - 1 freq sosanna (3) - 1 freq oana (3) - 1 freq yolanta (3) - 2 freq onand (3) - 1 freq jonanan (3) - 1 freq donna (3) - 51 freq borna (3) - 1 freq banannas (3) - 1 freq bananas (3) - 17 freq binna (3) - 29 freq branta (3) - 1 freq hosanna (3) - 2 freq bonhoga (3) - 1 freq gonna (3) - 129 freq brianma (3) - 1 freq stanza (3) - 15 freq goanna (3) - 1 freq |
bonanza (0) - 2 freq banana (3) - 45 freq bonnet (4) - 34 freq bananas (4) - 17 freq binna (4) - 29 freq bananae (4) - 2 freq bonn (4) - 2 freq boanny (4) - 4 freq bonny (4) - 496 freq bonnie (4) - 805 freq bonns (4) - 2 freq banzai (4) - 1 freq bunny (5) - 4 freq bonnify (5) - 2 freq bannie (5) - 1 freq bannit (5) - 2 freq bosnia (5) - 3 freq boannie (5) - 59 freq bunnil (5) - 8 freq banned (5) - 34 freq bounin (5) - 1 freq benn (5) - 1 freq banns (5) - 3 freq bunnle (5) - 8 freq binne (5) - 1 freq |
SoundEx code - B552 bananas - 17 freq bonniness - 2 freq bunions - 2 freq bonnieness - 5 freq boomins - 1 freq bananaes - 1 freq ba'nahinch - 1 freq bumming - 2 freq bunemaist - 1 freq banning - 2 freq beaming - 2 freq €œbananas - 1 freq €˜bananas - 1 freq €œbonniness - 1 freq bonanza - 2 freq bananasmin - 8 freq banana's - 2 freq bananashot - 1 freq bananaskin - 1 freq banannas - 1 freq beaniemacintosh - 3 freq booming - 1 freq |
MetaPhone code - BNNS bananas - 17 freq bonniness - 2 freq bunions - 2 freq bonnieness - 5 freq bananaes - 1 freq €œbananas - 1 freq €˜bananas - 1 freq €œbonniness - 1 freq bonanza - 2 freq banana's - 2 freq banannas - 1 freq |
BONANZA |
| Time to execute Levenshtein function - 0.188365 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.348742 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.030024 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.038233 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.001019 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. |