Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
colmer (0) - 1 freq commer (1) - 1 freq comer (1) - 4 freq calmer (1) - 3 freq couser (2) - 2 freq comes (2) - 962 freq comers (2) - 2 freq palmer (2) - 3 freq dolder (2) - 1 freq coled (2) - 1 freq holler (2) - 2 freq collar (2) - 72 freq coster (2) - 1 freq culter (2) - 1 freq color (2) - 2 freq colleg (2) - 2 freq cooler (2) - 12 freq coles (2) - 4 freq colled (2) - 2 freq coomed (2) - 1 freq colour (2) - 259 freq golfer (2) - 1 freq calmed (2) - 14 freq cooker (2) - 21 freq cowper (2) - 2 freq |
colmer (0) - 1 freq calmer (1) - 3 freq comer (2) - 4 freq commer (2) - 1 freq cummer (3) - 6 freq colair (3) - 1 freq elmer (3) - 2 freq calmed (3) - 14 freq chalmer (3) - 2 freq caller (3) - 80 freq cler (3) - 1 freq claer (3) - 22 freq collier (3) - 2 freq balmer (3) - 2 freq clamar (3) - 1 freq czamer (3) - 1 freq calder (3) - 12 freq colour (3) - 259 freq calzer (3) - 1 freq coulter (3) - 6 freq caler (3) - 1 freq collar (3) - 72 freq palmer (3) - 3 freq cleer (3) - 6 freq couler (3) - 1 freq |
SoundEx code - C456 cleaner - 32 freq climmer - 1 freq clamour - 8 freq clammert - 1 freq chalmer - 2 freq claymore - 8 freq chaulmer - 1 freq calmer - 3 freq clamar - 1 freq coolnahoarna - 1 freq clammered - 2 freq cleaners - 8 freq claymores - 2 freq chalmers - 15 freq clawhammer - 1 freq clamouran - 1 freq climmeran - 1 freq clawmarks - 1 freq chalmeris - 1 freq colmer - 1 freq climmirn - 1 freq colineurosonic - 1 freq callumrwalker - 1 freq calumwright - 15 freq calmarkel - 1 freq |
MetaPhone code - KLMR glamourie - 20 freq climmer - 1 freq clamour - 8 freq glamorie - 1 freq glamour - 29 freq glimmer - 17 freq claymore - 8 freq glimer - 1 freq calmer - 3 freq clamar - 1 freq glaumourie - 1 freq glammery - 1 freq clamber - 5 freq glimro - 1 freq glaumer - 1 freq glaumrie - 5 freq colmer - 1 freq glamur - 1 freq gulmore - 1 freq |
COLMER |
Time to execute Levenshtein function - 0.201840 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.354750 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.028129 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.040520 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.001062 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. |