| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| swagerrin (0) - 1 freq swaggerin (2) - 5 freq swervin (3) - 1 freq swearin (3) - 16 freq sodgerin (3) - 1 freq slaigerin (3) - 2 freq saberin (3) - 1 freq scarrin (3) - 1 freq sterrin (3) - 1 freq serrin (3) - 5 freq slaverin (3) - 11 freq wage-in (3) - 1 freq sweirin (3) - 16 freq sware-in (3) - 1 freq staggerin (3) - 8 freq waverin (3) - 1 freq swarmin (3) - 6 freq warrin (3) - 1 freq waterin (3) - 7 freq swarrie (3) - 1 freq swaeran (3) - 1 freq starrin (3) - 3 freq werrin (3) - 3 freq swairmin (3) - 2 freq sweerin (3) - 12 freq |
swagerrin (0) - 1 freq swaggerin (3) - 5 freq warrin (5) - 1 freq swarmin (5) - 6 freq sware-in (5) - 1 freq swarrie (5) - 1 freq staggerin (5) - 8 freq starrin (5) - 3 freq sweerin (5) - 12 freq werrin (5) - 3 freq sweirin (5) - 16 freq swaeran (5) - 1 freq swairmin (5) - 2 freq slaigerin (5) - 2 freq swearin (5) - 16 freq swervin (5) - 1 freq scarrin (5) - 1 freq sodgerin (5) - 1 freq sterrin (5) - 1 freq serrin (5) - 5 freq sterran (6) - 1 freq sowderin (6) - 1 freq swurlin (6) - 1 freq sweeren (6) - 1 freq gurrin (6) - 1 freq |
SoundEx code - S265 siccarness - 5 freq sacraments - 1 freq saccharin - 1 freq sacrament - 7 freq swagerrin - 1 freq swiss-german - 1 freq sojourn - 1 freq swaggerin - 5 freq sassermaet - 6 freq saucermeat - 1 freq sixareens - 2 freq sixern - 3 freq sixerns - 1 freq sixareen - 1 freq securin - 1 freq sacrum - 1 freq sea-green - 1 freq shawgroonds - 1 freq sigzsyrmce - 1 freq |
MetaPhone code - SWJRN swagerrin - 1 freq |
SWAGERRIN |
| Time to execute Levenshtein function - 0.221111 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.365349 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.029748 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.039452 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.000935 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. |