| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newzealand (0) - 1 freq zealand (3) - 40 freq nederland (3) - 1 freq nederlands (4) - 2 freq new-fand (4) - 1 freq nescotland (4) - 1 freq zeiland (4) - 2 freq netherlands (4) - 7 freq heeland (4) - 1 freq newlands (4) - 2 freq sealand (4) - 1 freq zeeland (4) - 1 freq zealan (4) - 1 freq disneyland (5) - 11 freq newmilns (5) - 4 freq yreland (5) - 1 freq newall (5) - 1 freq cleveland (5) - 1 freq newfoundland (5) - 3 freq reevlan (5) - 2 freq new-auld (5) - 2 freq nhberland (5) - 1 freq weylaid (5) - 1 freq homeland (5) - 1 freq efterhand (5) - 1 freq |
newzealand (0) - 1 freq nederland (5) - 1 freq zealand (5) - 40 freq newlands (6) - 2 freq zeeland (6) - 1 freq zeiland (6) - 2 freq new-lined (6) - 1 freq new-fand (6) - 1 freq engurland (7) - 2 freq newlins (7) - 2 freq fawkland (7) - 1 freq new-auld (7) - 2 freq wuidland (7) - 1 freq new-fund (7) - 1 freq widland (7) - 10 freq newsround (7) - 1 freq england (7) - 224 freq newmilns (7) - 4 freq heeland (7) - 1 freq nortlaand (7) - 1 freq nescotland (7) - 1 freq nederlands (7) - 2 freq lawland (7) - 20 freq sealand (7) - 1 freq lowland (7) - 32 freq |
SoundEx code - N245 nuzzlin - 1 freq nigglin - 3 freq niggling - 1 freq neckline - 1 freq newzealand - 1 freq nicolamcalley - 1 freq niocalmccormaig - 1 freq naecoolmin - 1 freq |
MetaPhone code - NSLNT newzealand - 1 freq |
NEWZEALAND |
| Time to execute Levenshtein function - 0.216166 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.370475 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.030351 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.038029 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.000918 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. |