Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gippsland (0) - 1 freq ripplan (3) - 2 freq hipplan (3) - 1 freq island (3) - 131 freq gilliland (3) - 2 freq grassland (3) - 3 freq hieland (4) - 16 freq copland (4) - 6 freq lippenan' (4) - 1 freq lippan (4) - 1 freq liberland (4) - 2 freq finland (4) - 7 freq vigeland (4) - 1 freq upland (4) - 5 freq inkstand (4) - 3 freq tipplin (4) - 1 freq irland (4) - 6 freq kipplin (4) - 1 freq wippled (4) - 2 freq birseland (4) - 7 freq rippling (4) - 1 freq lipperan (4) - 2 freq gappan (4) - 1 freq irishland (4) - 1 freq applaud (4) - 4 freq |
gippsland (0) - 1 freq grassland (5) - 3 freq island (6) - 131 freq gilliland (6) - 2 freq ripplan (6) - 2 freq hipplan (6) - 1 freq greenland (7) - 16 freq ellisland (7) - 4 freq gruneland (7) - 2 freq rippuld (7) - 1 freq ripplin (7) - 12 freq weensland (7) - 1 freq copeland (7) - 1 freq poland (7) - 10 freq garland (7) - 5 freq pauland (7) - 1 freq friesland (7) - 8 freq gairland (7) - 1 freq applaud (7) - 4 freq lippend (7) - 1 freq mossland (7) - 1 freq rippled (7) - 1 freq lapland (7) - 3 freq birseland (7) - 7 freq wippled (7) - 2 freq |
SoundEx code - G124 gippsland - 1 freq gsfwswljwd - 1 freq goevaazcld - 1 freq gbqlw - 1 freq gwfqioihlb - 1 freq |
MetaPhone code - JPSLNT gippsland - 1 freq |
GIPPSLAND |
Time to execute Levenshtein function - 0.242373 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.389644 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.028303 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.041136 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.001127 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. |