| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bank-burds (0) - 1 freq back-buirds (2) - 1 freq back-burden (3) - 1 freq back-burdeen (4) - 1 freq blackburd (4) - 1 freq bancouris (4) - 1 freq bankers (4) - 4 freq blakbirds (4) - 1 freq backgrunds (4) - 3 freq basturds (4) - 1 freq bakwards (4) - 2 freq back-burdeens (4) - 1 freq backwards (4) - 36 freq bunk-bed (4) - 1 freq backwirds (4) - 2 freq blaikbirds (4) - 1 freq cage-burd (4) - 1 freq binkibus (4) - 1 freq bakers (5) - 24 freq backdoors (5) - 1 freq backhaud (5) - 1 freq bak-raa (5) - 1 freq on-buird (5) - 1 freq backburner (5) - 1 freq bombards (5) - 1 freq |
bank-burds (0) - 1 freq back-buirds (3) - 1 freq back-burden (5) - 1 freq blaikbirds (6) - 1 freq blakbirds (6) - 1 freq back-burdeen (6) - 1 freq bunk-bed (6) - 1 freq back-burdeens (6) - 1 freq binkibus (7) - 1 freq kie-buirds (7) - 1 freq backwirds (7) - 2 freq backwards (7) - 36 freq bakwards (7) - 2 freq bankers (7) - 4 freq nine-bars (8) - 1 freq blakbird (8) - 1 freq wine-baurs (8) - 1 freq bunkers (8) - 12 freq grave-birds (8) - 1 freq bonkers (8) - 5 freq back-bowed (8) - 1 freq songbirds (8) - 2 freq len-wirds (8) - 4 freq sign-buirds (8) - 1 freq len-words (8) - 1 freq |
SoundEx code - B521 benchpresses - 1 freq bank-burds - 1 freq bink-bottom - 1 freq bannockburn - 6 freq bonus-bent - 1 freq bannik-foo - 1 freq bungfu - 2 freq 'bannockburn' - 1 freq bonspiel - 2 freq bumshayvilt - 1 freq bang-bang-bangin - 1 freq bunk-bed - 1 freq bumshayvelt - 2 freq bank-fiel - 3 freq bmejf - 1 freq bnspf - 1 freq bangbang - 1 freq benjypalmer - 1 freq beingbritisheastasian - 2 freq binkibus - 1 freq bmsfcfmngc - 1 freq beingaparentsometimesfuckingsucks - 1 freq bfmcp - 1 freq |
MetaPhone code - BNKBRTS bank-burds - 1 freq |
BANK-BURDS |
| Time to execute Levenshtein function - 0.614228 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.862846 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.028946 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.086622 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.000933 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. |