| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eynar (0) - 34 freq einar (1) - 27 freq reynard (2) - 3 freq pypar (2) - 1 freq eenan (2) - 1 freq ayar (2) - 1 freq -year (2) - 1 freq lunar (2) - 1 freq ena (2) - 16 freq keyna (2) - 4 freq bynear (2) - 2 freq wnar (2) - 1 freq jyner (2) - 30 freq ynr (2) - 1 freq eyns (2) - 7 freq eyn's (2) - 1 freq year (2) - 2026 freq enna (2) - 11 freq ellar (2) - 1 freq sonar (2) - 1 freq eynoo (2) - 3 freq elmar (2) - 2 freq kyaar (2) - 1 freq ebner (2) - 5 freq ear (2) - 139 freq |
eynar (0) - 34 freq einar (1) - 27 freq einer (2) - 1 freq anar (2) - 1 freq nar (2) - 15 freq ynr (2) - 1 freq nair (3) - 2 freq geynear (3) - 2 freq nary (3) - 2 freq eyn (3) - 137 freq eyne (3) - 4 freq ornar (3) - 4 freq yar (3) - 3 freq denar (3) - 1 freq nr (3) - 8 freq nir (3) - 49 freq naar (3) - 7 freq enry (3) - 1 freq ainer (3) - 2 freq ooner (3) - 2 freq ner (3) - 53 freq naur (3) - 10 freq nor (3) - 1967 freq nare (3) - 1 freq gnar (3) - 1 freq |
SoundEx code - E560 eemur - 1 freq einar - 27 freq eimhir - 1 freq eynar - 34 freq eimhir' - 1 freq einer - 1 freq emorra - 1 freq emmaohara - 1 freq enry - 1 freq eiwynra - 1 freq emery - 1 freq |
MetaPhone code - ENR einar - 27 freq eynar - 34 freq einer - 1 freq enry - 1 freq eiwynra - 1 freq |
EYNAR |
| Time to execute Levenshtein function - 0.176002 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.363138 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.027467 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.036938 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.000889 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. |