Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
blackhall (0) - 24 freq blackhill (1) - 1 freq blackball (1) - 1 freq blackhall's (2) - 4 freq blackhaw (2) - 1 freq blairhall (2) - 1 freq blackmail (2) - 4 freq black-hole (3) - 1 freq backhaud (3) - 1 freq backhaan (3) - 1 freq blackpool (3) - 16 freq ackwall (3) - 1 freq placesall (3) - 1 freq beachball (3) - 1 freq backhaun (3) - 1 freq blacktap (3) - 1 freq blackcap (3) - 1 freq block'll (3) - 1 freq blackad (3) - 1 freq blackjack (3) - 1 freq black-hack (3) - 1 freq blakmail (3) - 1 freq blackheid (3) - 1 freq blackface (3) - 3 freq blackenin (4) - 2 freq |
blackhall (0) - 24 freq blackhill (1) - 1 freq blackball (2) - 1 freq block'll (4) - 1 freq blairhall (4) - 1 freq blackmail (4) - 4 freq blackhall's (4) - 4 freq blackhaw (4) - 1 freq blackpool (5) - 16 freq blackheid (5) - 1 freq black-hole (5) - 1 freq blackjack (6) - 1 freq blakmail (6) - 1 freq black-hack (6) - 1 freq mickhill (6) - 3 freq blackad (6) - 1 freq back-alley (6) - 1 freq blackmailed (6) - 1 freq blackface (6) - 3 freq blackcap (6) - 1 freq backhaan (6) - 1 freq backhaud (6) - 1 freq placesall (6) - 1 freq ackwall (6) - 1 freq beachball (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 blacklistin - 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 - BLKHL blackhill - 1 freq blackhall - 24 freq black-hole - 1 freq |
BLACKHALL blackhall - 24 freq |
Time to execute Levenshtein function - 0.197919 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.346651 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.027402 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.037551 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.000943 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. |