| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| belnaloob (0) - 4 freq belnaloob's (2) - 1 freq belnagoak (3) - 1 freq belnamore (3) - 3 freq bellpou (4) - 1 freq blakoot (4) - 1 freq yelloo (4) - 1 freq belabour (4) - 1 freq felloo (4) - 1 freq bellow (4) - 3 freq baloos (4) - 1 freq bubbaloo (4) - 2 freq boogaloo (4) - 1 freq balloon (4) - 37 freq bellows (4) - 6 freq belloch (4) - 3 freq felloot (4) - 1 freq binnatoon (4) - 1 freq blawoot (4) - 1 freq beena (5) - 1 freq cello (5) - 2 freq feenally (5) - 1 freq bell (5) - 210 freq affaloon (5) - 2 freq bentos (5) - 1 freq |
belnaloob (0) - 4 freq belnaloob's (4) - 1 freq belnamore (5) - 3 freq belnagoak (5) - 1 freq bellow (6) - 3 freq ballboy (6) - 2 freq balloon (6) - 37 freq bellpou (6) - 1 freq bellyfou (7) - 1 freq blinly (7) - 2 freq ballo (7) - 1 freq bennels (7) - 1 freq bellie (7) - 6 freq bellt (7) - 1 freq billo (7) - 1 freq belangt (7) - 8 freq bealin (7) - 32 freq belangit (7) - 5 freq bellum (7) - 3 freq bellynab (7) - 1 freq beltel (7) - 4 freq belanged (7) - 49 freq bellany (7) - 1 freq banality (7) - 1 freq belles (7) - 1 freq |
SoundEx code - B454 blameless - 2 freq belnaloob - 4 freq belnaloob's - 1 freq blinly - 2 freq blue-melt - 1 freq balloon'll - 1 freq |
MetaPhone code - BLNLB belnaloob - 4 freq |
BELNALOOB |
| Time to execute Levenshtein function - 0.204418 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.346820 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.027076 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.036666 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.000873 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. |