| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| belmont (0) - 6 freq belong (2) - 14 freq beyont (2) - 7 freq beckont (2) - 1 freq bellend (3) - 7 freq remant (3) - 1 freq belting (3) - 2 freq belongs (3) - 14 freq seicont (3) - 18 freq weldone (3) - 1 freq bell-it (3) - 1 freq felon (3) - 2 freq beluvit (3) - 7 freq lemons (3) - 2 freq beckons (3) - 5 freq kemonn (3) - 1 freq sermon (3) - 29 freq sermons (3) - 9 freq begoot (3) - 2 freq reliant (3) - 3 freq demons (3) - 36 freq seemon (3) - 17 freq ailmint (3) - 1 freq elon (3) - 1 freq melon (3) - 6 freq |
belmont (0) - 6 freq ailmint (4) - 1 freq beaminit (4) - 1 freq element (4) - 45 freq blint (4) - 3 freq boldint (4) - 1 freq ailment (4) - 2 freq blinnt (4) - 1 freq rolment (4) - 1 freq blent (4) - 6 freq lamont (4) - 8 freq ballant (4) - 11 freq bellement (4) - 3 freq beyont (4) - 7 freq beckont (4) - 1 freq belong (4) - 14 freq blunt (4) - 9 freq lemon (5) - 23 freq kelman (5) - 6 freq blaming (5) - 4 freq behint (5) - 5 freq balcony (5) - 19 freq ballot (5) - 10 freq bellany (5) - 1 freq bolton (5) - 2 freq |
SoundEx code - B455 blamin - 6 freq beelin-eened - 2 freq bloomin - 28 freq blumin - 1 freq bluimin - 1 freq baal-hamon - 1 freq blimmin - 4 freq belnamore - 3 freq blinnin - 1 freq belmont - 6 freq blinninly - 2 freq bellymoney - 2 freq bellamaina - 2 freq blooman - 8 freq bellement - 3 freq bloomeen - 1 freq ballymena - 6 freq blaming - 4 freq bioluminescent - 1 freq bull-man - 1 freq blooming - 33 freq bloomin' - 2 freq ballynahinch - 1 freq blumenthal - 1 freq ballymenabap - 1 freq belmontedinbur - 4 freq billyneymates - 1 freq ballamena - 1 freq |
MetaPhone code - BLMNT belmont - 6 freq bellement - 3 freq |
BELMONT |
| Time to execute Levenshtein function - 0.184426 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.346120 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.028114 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.037435 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.000895 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. |