Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
arlene (0) - 13 freq carlene (1) - 1 freq irene (2) - 56 freq arenae (2) - 83 freq allen (2) - 2 freq amene (2) - 1 freq jolene (2) - 1 freq erlend (2) - 4 freq carline (2) - 33 freq erline (2) - 1 freq areni (2) - 1 freq arden (2) - 2 freq aliene (2) - 2 freq greene (2) - 2 freq lene (2) - 2 freq arena (2) - 41 freq aren (2) - 3 freq abene (2) - 1 freq clene (2) - 3 freq ardent (2) - 2 freq a-lee (2) - 3 freq athene (2) - 1 freq grene (2) - 15 freq alen (2) - 1 freq plene (2) - 1 freq |
arlene (0) - 13 freq erline (2) - 1 freq airline (2) - 1 freq carlene (2) - 1 freq airlan (3) - 174 freq arles (3) - 5 freq clene (3) - 3 freq alen (3) - 1 freq arne (3) - 1 freq abilene (3) - 2 freq alone (3) - 68 freq alane (3) - 267 freq arena (3) - 41 freq plene (3) - 1 freq aren (3) - 3 freq jolene (3) - 1 freq erlend (3) - 4 freq allen (3) - 2 freq arenae (3) - 83 freq irene (3) - 56 freq lene (3) - 2 freq carline (3) - 33 freq aliene (3) - 2 freq areni (3) - 1 freq arden (3) - 2 freq |
SoundEx code - A645 airlann's - 1 freq airlan - 174 freq arlene - 13 freq airlan's - 10 freq airland - 2 freq airlann - 20 freq airlannn - 2 freq airline - 1 freq arlenefoster - 1 freq arlinklater - 1 freq airlines - 1 freq |
MetaPhone code - ARLN airlan - 174 freq arlene - 13 freq airlann - 20 freq airlannn - 2 freq airline - 1 freq |
ARLENE |
Time to execute Levenshtein function - 0.168055 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.343375 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.027051 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.037232 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.000785 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. |