| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clamouran (0) - 1 freq clamour (2) - 8 freq flavourin (3) - 1 freq glamourit (3) - 1 freq clausura (3) - 1 freq louran (3) - 1 freq climmeran (3) - 1 freq clourin (3) - 1 freq glamour (3) - 29 freq clatteran (3) - 1 freq lamour (3) - 1 freq clamberin (3) - 4 freq glamour's (3) - 1 freq glamourie (3) - 20 freq labourin (3) - 3 freq amoral (4) - 1 freq labourin' (4) - 1 freq caperan (4) - 1 freq clankan (4) - 1 freq laufan (4) - 1 freq cameron (4) - 124 freq glaurin (4) - 1 freq clamberit (4) - 1 freq flavour (4) - 27 freq louman (4) - 1 freq |
clamouran (0) - 1 freq clamour (3) - 8 freq clourin (4) - 1 freq clamberin (4) - 4 freq climmeran (4) - 1 freq climban (5) - 2 freq catamaran (5) - 1 freq clewran (5) - 1 freq claiterin (5) - 1 freq cloorin (5) - 1 freq clairin (5) - 1 freq cullourin (5) - 1 freq claymore (5) - 8 freq claverin (5) - 8 freq clamin (5) - 1 freq climmirn (5) - 1 freq colourin (5) - 3 freq clampin (5) - 2 freq claymores (5) - 2 freq clearan (5) - 2 freq claiverin (5) - 1 freq glamour (5) - 29 freq clatteran (5) - 1 freq glamourie (5) - 20 freq louran (5) - 1 freq |
SoundEx code - C456 cleaner - 31 freq climmer - 1 freq clamour - 8 freq clammert - 1 freq chalmer - 2 freq claymore - 8 freq chaulmer - 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 calmer - 2 freq colineurosonic - 1 freq callumrwalker - 1 freq calumwright - 15 freq calmarkel - 1 freq |
MetaPhone code - KLMRN glamourie-nae - 1 freq clamberin - 4 freq glimmerin - 4 freq clamouran - 1 freq climmeran - 1 freq glimmrin - 3 freq climmirn - 1 freq glimmeran - 1 freq |
CLAMOURAN |
| Time to execute Levenshtein function - 0.295106 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.607707 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.060512 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.041105 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.000888 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. |