| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banshees (0) - 6 freq banshee's (1) - 2 freq benshees (1) - 2 freq banshee (1) - 15 freq ganshes (2) - 11 freq punshees (2) - 1 freq bashes (2) - 1 freq 'banshees' (2) - 1 freq baesties (3) - 1 freq gantrees (3) - 1 freq bushes (3) - 41 freq baskets (3) - 8 freq bankers (3) - 4 freq banquets (3) - 1 freq washeen (3) - 11 freq bathers (3) - 2 freq bandages (3) - 5 freq mansheld (3) - 1 freq nashers (3) - 2 freq bedsheet (3) - 2 freq bushels (3) - 1 freq benches (3) - 13 freq mansie's (3) - 3 freq bananaes (3) - 1 freq gansies (3) - 3 freq |
banshees (0) - 6 freq benshees (1) - 2 freq banshee's (2) - 2 freq banshee (2) - 15 freq bashes (3) - 1 freq punshees (3) - 1 freq ganshes (3) - 11 freq blushes (4) - 3 freq banished (4) - 3 freq benches (4) - 13 freq vanishes (4) - 1 freq bunches (4) - 6 freq brushes (4) - 15 freq bushes (4) - 41 freq 'banshees' (4) - 1 freq banghs (4) - 1 freq bedsheets (5) - 2 freq ransels (5) - 1 freq bases (5) - 6 freq rashes (5) - 29 freq bangers (5) - 3 freq banties (5) - 1 freq bonsais (5) - 1 freq gansee's (5) - 1 freq bastes (5) - 4 freq |
SoundEx code - B522 banshee's - 2 freq benshees - 2 freq bunches - 6 freq benches - 13 freq bounces - 4 freq banshees - 6 freq benkis - 1 freq banjos - 2 freq binges - 1 freq 'banshees' - 1 freq bingos - 1 freq boonces - 4 freq 'boonce's - 1 freq boonce's - 3 freq boneshaker - 1 freq bunghsie - 2 freq banghs - 1 freq bonxie's - 1 freq bangkok - 2 freq bianco's - 1 freq benjy's - 1 freq bonsais - 1 freq bonxies - 4 freq boom-cognate-boom-hum-end-o-game - 1 freq bnqyikqq - 1 freq |
MetaPhone code - BNXS banshee's - 2 freq benshees - 2 freq bunches - 6 freq benches - 13 freq banshees - 6 freq 'banshees' - 1 freq |
BANSHEES |
| Time to execute Levenshtein function - 0.201795 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.407782 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.033109 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.041054 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.000852 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. |