| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caldwell (0) - 1 freq carswell (2) - 3 freq cantwell (2) - 3 freq alsweill (3) - 1 freq indwell (3) - 1 freq castell (3) - 1 freq calder (3) - 12 freq cromwell (3) - 8 freq farewell (3) - 13 freq cadboll (3) - 1 freq maxwell (3) - 16 freq campbell (3) - 96 freq dwell (3) - 11 freq dalyell (3) - 6 freq ladywell (3) - 2 freq aswell (3) - 6 freq waxwell (3) - 1 freq calders (3) - 2 freq candill (3) - 1 freq waddell (3) - 1 freq aideeal (4) - 1 freq dayell (4) - 1 freq ill-wull (4) - 5 freq boswell (4) - 3 freq calmly (4) - 14 freq |
caldwell (0) - 1 freq ladywell (4) - 2 freq cantwell (4) - 3 freq carswell (4) - 3 freq dwell (5) - 11 freq candill (5) - 1 freq cromwell (5) - 8 freq cadboll (5) - 1 freq indwell (5) - 1 freq alsweill (5) - 1 freq ackwall (6) - 1 freq lexwell (6) - 7 freq ill-will (6) - 6 freq dwall (6) - 10 freq colmonell (6) - 1 freq colinbell (6) - 13 freq beldhill (6) - 2 freq guidwull (6) - 6 freq cornwall (6) - 9 freq holdall (6) - 14 freq ull-wull (6) - 2 freq hold-all (6) - 3 freq cod'll (6) - 1 freq liddell (6) - 4 freq cauldly (6) - 4 freq |
SoundEx code - C434 childlik - 1 freq claith'll - 1 freq childline - 1 freq cloodless - 3 freq cauldly - 4 freq cult-like - 1 freq cloudless - 4 freq cowldly - 1 freq caldwell - 1 freq chillootauldyin - 1 freq clydeladies - 2 freq |
MetaPhone code - KLTWL caldwell - 1 freq |
CALDWELL |
| Time to execute Levenshtein function - 0.210983 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.388914 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.027094 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.038218 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.000860 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. |