| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blacklist (0) - 1 freq blacklisted (2) - 3 freq blackest (2) - 4 freq blackit (2) - 1 freq blacklistit (2) - 1 freq backlit (2) - 1 freq backless (3) - 1 freq bucklit (3) - 1 freq blackbird (3) - 4 freq blackwid (3) - 1 freq brackish (3) - 1 freq slackint (3) - 1 freq backit (3) - 8 freq blaikit (3) - 4 freq brakfist (3) - 4 freq backlins (3) - 18 freq blackens (3) - 1 freq black-out (3) - 1 freq blaist (3) - 1 freq blackies (3) - 1 freq blackin (3) - 5 freq blackoot (3) - 2 freq playlist (3) - 7 freq blackrigg (3) - 1 freq blackout (3) - 2 freq |
blacklist (0) - 1 freq blackest (3) - 4 freq blacklisted (3) - 3 freq blacklistit (3) - 1 freq backlit (4) - 1 freq blackit (4) - 1 freq bleckit (5) - 2 freq black-oot (5) - 1 freq blackout (5) - 2 freq blockit (5) - 11 freq backlash (5) - 1 freq blackside (5) - 2 freq blackness (5) - 11 freq blackies (5) - 1 freq blacks (5) - 3 freq bleckleidit (5) - 1 freq black's (5) - 3 freq blackoot (5) - 2 freq bucklit (5) - 1 freq blackleedit (5) - 1 freq backless (5) - 1 freq blackens (5) - 1 freq black-out (5) - 1 freq blockt (6) - 1 freq buckles (6) - 1 freq |
SoundEx code - B424 balaclavas - 3 freq balaclava - 5 freq blakley - 4 freq blackhill - 1 freq blackhall - 24 freq ballachulish - 5 freq ballaclava - 1 freq blacklist - 1 freq ballygellick - 16 freq blacklisted - 3 freq bellisle - 1 freq bylocal - 1 freq black-hole - 1 freq ballygawley - 1 freq blekly - 1 freq blackhall's - 4 freq block'll - 1 freq bellacaledonia - 27 freq bleckleid - 1 freq blacklistit - 1 freq bellshill - 2 freq 'bellshill - 1 freq ballygally - 1 freq blue-collar - 1 freq bleckleidit - 1 freq blackleedit - 1 freq ballyclare - 1 freq bellshillbaker - 2 freq blackwelledin - 1 freq blacklivesmatter - 2 freq |
MetaPhone code - BLKLST blacklist - 1 freq |
BLACKLIST |
| Time to execute Levenshtein function - 0.234063 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.372538 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.027878 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.037113 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.000803 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. |