| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chalmers (0) - 15 freq chalmer (1) - 2 freq chaumers (1) - 14 freq chalmeris (1) - 1 freq chollers (2) - 1 freq haimers (2) - 2 freq calders (2) - 2 freq chancers (2) - 3 freq chapters (2) - 9 freq chalets (2) - 1 freq hammers (2) - 6 freq chakkers (2) - 2 freq chanters (2) - 9 freq shalders (2) - 6 freq callers (2) - 2 freq chaumer's (2) - 1 freq calmer (2) - 3 freq chaamer (2) - 12 freq charmer (2) - 3 freq chaulmer (2) - 1 freq whalers (2) - 8 freq chappers (2) - 2 freq chaumer (2) - 117 freq chaummers (2) - 1 freq chambers (2) - 8 freq |
chalmers (0) - 15 freq chalmeris (1) - 1 freq chaumers (2) - 14 freq chalmer (2) - 2 freq chaummers (3) - 1 freq chollers (3) - 1 freq chaulmer (3) - 1 freq charmer (4) - 3 freq chaamer (4) - 12 freq calmer (4) - 3 freq chambers (4) - 8 freq chaldros (4) - 1 freq chaumer's (4) - 1 freq chaumer (4) - 117 freq chappers (4) - 2 freq whalers (4) - 8 freq chancers (4) - 3 freq haimers (4) - 2 freq callers (4) - 2 freq calders (4) - 2 freq chalets (4) - 1 freq chapters (4) - 9 freq chanters (4) - 9 freq shalders (4) - 6 freq hammers (4) - 6 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 - XLMRS chalmers - 15 freq chalmeris - 1 freq |
CHALMERS |
| Time to execute Levenshtein function - 0.197053 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.393263 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.027830 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.041800 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.000863 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. |