| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yernan (0) - 1 freq yarnan (1) - 3 freq werna (2) - 13 freq murnan (2) - 2 freq bernam (2) - 1 freq warnan (2) - 1 freq yeusan (2) - 1 freq learnan (2) - 2 freq eeran (2) - 2 freq dornan (2) - 2 freq ferman (2) - 1 freq erran (2) - 3 freq yet-an (2) - 2 freq vernal (2) - 3 freq herdan (2) - 1 freq vernon (2) - 1 freq yearnin (2) - 1 freq kertan (2) - 1 freq turnan (2) - 20 freq ergan (2) - 1 freq jerkan (2) - 1 freq yawnan (2) - 2 freq leanan (2) - 4 freq yeman (2) - 1 freq kenan (2) - 3 freq |
yernan (0) - 1 freq yarnan (1) - 3 freq yearnin (2) - 1 freq yarnin (2) - 18 freq burnan (3) - 7 freq yerns (3) - 1 freq meanan (3) - 12 freq leanan (3) - 4 freq kenan (3) - 3 freq yerkin (3) - 4 freq mornan (3) - 1 freq rnin (3) - 1 freq airnin (3) - 1 freq renn (3) - 9 freq erenn (3) - 1 freq rainan (3) - 1 freq yawnan (3) - 2 freq girnan (3) - 1 freq reinen (3) - 1 freq earnin (3) - 8 freq eenan (3) - 1 freq murnan (3) - 2 freq eeran (3) - 2 freq learnan (3) - 2 freq erran (3) - 3 freq |
SoundEx code - Y655 yearnin - 1 freq yarnin - 18 freq yarnan - 3 freq yernan - 1 freq yearnins - 1 freq yarning - 1 freq yirmembershipisawasteocash - 1 freq |
MetaPhone code - YRNN yearnin - 1 freq yarnin - 18 freq yarnan - 3 freq yernan - 1 freq |
YERNAN |
| Time to execute Levenshtein function - 0.229400 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.406613 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.028839 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.038357 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.000945 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. |