| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bankrupt (0) - 8 freq 'bankrupt' (2) - 1 freq bankruptit (2) - 1 freq banquet (3) - 7 freq abrupt (3) - 2 freq backruim (3) - 2 freq backup (3) - 1 freq bankit (3) - 1 freq mankit (4) - 8 freq rankit (4) - 1 freq disrupt (4) - 1 freq anycunt (4) - 12 freq brust (4) - 16 freq unkept (4) - 2 freq fankelt (4) - 10 freq backdraps (4) - 2 freq basturt (4) - 16 freq dandruff (4) - 12 freq backgrund (4) - 32 freq bannet (4) - 1 freq backdrop (4) - 1 freq beirut (4) - 1 freq bathruim (4) - 1 freq backit (4) - 8 freq bantu (4) - 1 freq |
bankrupt (0) - 8 freq bankruptit (3) - 1 freq 'bankrupt' (4) - 1 freq bankit (5) - 1 freq abrupt (5) - 2 freq binort (6) - 1 freq bankers (6) - 4 freq tankart (6) - 1 freq hankert (6) - 1 freq bonfrost (6) - 1 freq krept (6) - 1 freq cankert (6) - 1 freq banker (6) - 12 freq skript (6) - 1 freq backup (6) - 1 freq unkept (6) - 2 freq banquet (6) - 7 freq backruim (6) - 2 freq mankiest (7) - 1 freq brut (7) - 3 freq pankhurst (7) - 2 freq barbt (7) - 1 freq bunker' (7) - 1 freq bank-e (7) - 1 freq backchat (7) - 4 freq |
SoundEx code - B526 bouncer - 22 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 22 freq 'banks're - 1 freq banker - 12 freq bonkers - 5 freq bunkery - 2 freq baungarrif - 1 freq bunkers - 12 freq 'bankrupt' - 1 freq bankers - 4 freq banchory - 6 freq bonjoor - 2 freq bankrupt - 8 freq banger - 5 freq bangers - 3 freq bin-cairt - 1 freq banesair - 1 freq ben-gurion - 1 freq buncher - 1 freq booncers - 2 freq bunchrew - 1 freq bangordub - 1 freq bomscare - 1 freq bin-hoker's - 1 freq bunchry - 1 freq bonaccordcentre - 3 freq bunker' - 1 freq banjorennie - 1 freq bankruptit - 1 freq |
MetaPhone code - BNKRPT 'bankrupt' - 1 freq bankrupt - 8 freq |
BANKRUPT |
| Time to execute Levenshtein function - 0.231400 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.455893 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.062775 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.037998 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.000855 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. |