| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chamour (0) - 1 freq clamour (1) - 8 freq famour (2) - 1 freq chamber (2) - 16 freq lamour (2) - 1 freq chamoix (2) - 1 freq l'amour (2) - 1 freq glamour (2) - 29 freq humour (2) - 73 freq amour (2) - 1 freq cawdour (3) - 1 freq clamber (3) - 5 freq chaiper (3) - 2 freq ah'mur (3) - 3 freq famous (3) - 105 freq airmour (3) - 7 freq charger (3) - 7 freq chamber' (3) - 1 freq champs (3) - 2 freq char (3) - 2 freq czamer (3) - 1 freq whanur (3) - 1 freq rumour (3) - 21 freq chair (3) - 219 freq cursour (3) - 1 freq |
chamour (0) - 1 freq clamour (2) - 8 freq chamoix (3) - 1 freq humour (3) - 73 freq chamber (3) - 16 freq chaumer (3) - 117 freq chaamer (3) - 12 freq chaummer (4) - 2 freq chaper (4) - 3 freq hamar (4) - 5 freq chair (4) - 219 freq achmore (4) - 1 freq champ (4) - 17 freq humor (4) - 1 freq chaucer (4) - 4 freq curmur (4) - 3 freq choir (4) - 16 freq chimera (4) - 2 freq clamar (4) - 1 freq chawer (4) - 2 freq chalmer (4) - 2 freq chaer (4) - 1 freq amour (4) - 1 freq charmer (4) - 3 freq glamour (4) - 29 freq |
SoundEx code - C560 canary - 14 freq c'mere - 7 freq chaumer - 117 freq camera - 57 freq comer - 4 freq cinner - 1 freq caumer - 1 freq cummer - 6 freq 'c'mere' - 1 freq cymru - 5 freq canner - 1 freq come-ower - 1 freq conrie - 1 freq ceannmor - 4 freq commer - 1 freq comrie - 1 freq chamour - 1 freq cannier - 1 freq 'c'mere - 2 freq conneree - 1 freq cunnar - 1 freq cenrre - 1 freq czamer - 1 freq chaamer - 12 freq cannery - 1 freq connor - 5 freq chaummer - 2 freq canaria - 1 freq chinnery - 1 freq connery - 5 freq chimera - 2 freq conor - 10 freq €œconor - 1 freq conner - 2 freq cmuir - 1 freq |
MetaPhone code - XMR chaumer - 117 freq shimmer - 4 freq chamber - 16 freq chamour - 1 freq chaamer - 12 freq chamber' - 1 freq chaummer - 2 freq €˜chamber - 1 freq chimera - 2 freq |
CHAMOUR |
| Time to execute Levenshtein function - 0.263027 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.405327 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.029301 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.043442 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.001266 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. |