| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bananasmin (0) - 8 freq bananaskin (1) - 1 freq bananas (3) - 17 freq bananashot (3) - 1 freq analysin (4) - 1 freq lananin (4) - 1 freq bannerman (4) - 1 freq baundsmen (4) - 1 freq banana's (4) - 2 freq canvassin (4) - 3 freq balancin (4) - 9 freq bannan (4) - 1 freq banannas (4) - 1 freq mannaquin (4) - 1 freq banana (4) - 45 freq managagin (4) - 1 freq bananaes (4) - 1 freq bannin (4) - 5 freq bannisment (4) - 1 freq handfastin (4) - 1 freq benjamin (4) - 7 freq bananae (4) - 2 freq bandagin (4) - 1 freq bartesin (5) - 1 freq mandarin (5) - 9 freq |
bananasmin (0) - 8 freq bananaskin (2) - 1 freq bannerman (5) - 1 freq baundsmen (5) - 1 freq bannisment (5) - 1 freq bananashot (5) - 1 freq bananas (5) - 17 freq bananaes (6) - 1 freq benjamin (6) - 7 freq bannin (6) - 5 freq bannan (6) - 1 freq bondsmen (6) - 2 freq finnishin (7) - 1 freq binnerin (7) - 1 freq beanston (7) - 1 freq bannister (7) - 2 freq branson (7) - 25 freq unassumin (7) - 2 freq binnatoon (7) - 1 freq boonsin (7) - 1 freq cinnamon (7) - 5 freq banns (7) - 3 freq bannos (7) - 1 freq mansmen (7) - 1 freq clansmen (7) - 5 freq |
SoundEx code - B552 bananas - 17 freq bonniness - 2 freq bunions - 2 freq bonnieness - 5 freq booming - 2 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 |
MetaPhone code - BNNSMN bananasmin - 8 freq |
BANANASMIN |
| Time to execute Levenshtein function - 0.192116 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.367909 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.028257 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.037735 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.000841 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. |