| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bankruptit (0) - 1 freq bankrupt (2) - 8 freq 'bankrupt' (3) - 1 freq corruptit (4) - 2 freq brustit (4) - 2 freq bankit (4) - 1 freq affruntit (4) - 2 freq entrustit (4) - 1 freq backruim (4) - 2 freq bruitit (4) - 1 freq undauntit (5) - 2 freq interuppit (5) - 1 freq contractit (5) - 1 freq assautit (5) - 1 freq sautit (5) - 2 freq backlit (5) - 1 freq black-suitit (5) - 1 freq tauntit (5) - 2 freq bruisit (5) - 2 freq bandit (5) - 7 freq baptist (5) - 11 freq intristit (5) - 1 freq brankit (5) - 1 freq wautit (5) - 1 freq armpit (5) - 1 freq |
bankruptit (0) - 1 freq bankrupt (3) - 8 freq 'bankrupt' (5) - 1 freq entrustit (7) - 1 freq bankit (7) - 1 freq bruitit (7) - 1 freq brustit (7) - 2 freq corruptit (7) - 2 freq onroustit (8) - 1 freq barnett (8) - 1 freq burtit (8) - 1 freq interruptit (8) - 35 freq intrestit (8) - 4 freq abortit (8) - 2 freq abruptly (8) - 9 freq sunripit (8) - 1 freq blurtit (8) - 2 freq cairpetit (8) - 2 freq bruistit (8) - 1 freq unwrappit (8) - 2 freq barrett (8) - 1 freq backspeirt (8) - 1 freq snortit (8) - 16 freq barkitt (8) - 1 freq benifitit (8) - 1 freq |
SoundEx code - B526 bouncer - 24 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 23 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 - BNKRPTT bankruptit - 1 freq |
BANKRUPTIT |
| Time to execute Levenshtein function - 0.380130 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.711321 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.028752 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.065767 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.001015 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. |