| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yorlin (0) - 12 freq yowlin (1) - 16 freq yorlins (1) - 3 freq norlin (1) - 170 freq surlin (2) - 1 freq mornin (2) - 952 freq conlin (2) - 5 freq ywowlin (2) - 1 freq yarnin (2) - 18 freq fornin (2) - 1 freq porin (2) - 1 freq boolin (2) - 16 freq gordin (2) - 2 freq derlin (2) - 1 freq borin (2) - 46 freq mirlin (2) - 3 freq holin (2) - 2 freq merlin (2) - 6 freq fortin (2) - 1 freq houlin (2) - 21 freq yovein (2) - 1 freq yirlins (2) - 1 freq yellin (2) - 13 freq godlin (2) - 1 freq carlin (2) - 6 freq |
yorlin (0) - 12 freq roilin (2) - 1 freq roulin (2) - 2 freq norlin (2) - 170 freq yowlin (2) - 16 freq yorlins (2) - 3 freq boilin (3) - 5 freq rowlin (3) - 4 freq yirdin (3) - 8 freq soolin (3) - 2 freq roslin (3) - 1 freq burlin (3) - 8 freq yerlins (3) - 1 freq pirlin (3) - 8 freq norln (3) - 1 freq tirlin (3) - 13 freq yarkin (3) - 4 freq orain (3) - 1 freq dirlin (3) - 45 freq hirlin (3) - 1 freq yrlind (3) - 1 freq hurlin (3) - 20 freq yirkin (3) - 1 freq rulin (3) - 6 freq toolin (3) - 1 freq |
SoundEx code - Y645 year-lang - 3 freq yorlins - 3 freq yorlin - 12 freq yerlins - 1 freq yorlin's - 2 freq yearlins - 1 freq yrlind - 1 freq yirlins - 1 freq yreland - 1 freq |
MetaPhone code - YRLN yorlin - 12 freq |
YORLIN |
| Time to execute Levenshtein function - 0.177741 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.327087 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.027192 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.036965 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.000812 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. |