Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
anerlie (0) - 68 freq lanerlie (1) - 2 freq aerlie (1) - 10 freq anelie (1) - 25 freq ainerlie (1) - 2 freq ferlie (2) - 96 freq lanelie (2) - 1 freq anlie (2) - 15 freq snorlie (2) - 1 freq anerly (2) - 7 freq innerlie (2) - 6 freq nellie (2) - 42 freq newlie (2) - 1 freq €™anerlie (2) - 1 freq cherlie (2) - 133 freq aerlier (2) - 8 freq airlie (2) - 47 freq knurlie (2) - 1 freq unnerlie (2) - 1 freq nessie (3) - 11 freq harlie (3) - 6 freq andriy (3) - 1 freq pairlie (3) - 1 freq airdie (3) - 2 freq earlie (3) - 7 freq |
anerlie (0) - 68 freq ainerlie (1) - 2 freq lanerlie (2) - 2 freq aerlie (2) - 10 freq anelie (2) - 25 freq anerly (2) - 7 freq unnerlie (3) - 1 freq airlie (3) - 47 freq newlie (3) - 1 freq ainerly (3) - 2 freq unrulie (3) - 1 freq knurlie (3) - 1 freq nellie (3) - 42 freq anlie (3) - 15 freq innerlie (3) - 6 freq snorlie (3) - 1 freq ferlie (3) - 96 freq neale (4) - 1 freq anbile (4) - 1 freq neerly (4) - 1 freq yeirlie (4) - 1 freq anjali (4) - 1 freq warlie (4) - 2 freq newlee (4) - 1 freq pearlie (4) - 1 freq |
SoundEx code - A564 ainerly - 2 freq anerly - 7 freq anerlie - 68 freq 'ammiral - 3 freq ammirall - 1 freq €™anerlie - 1 freq ainerlie - 2 freq annmairelee - 1 freq amoral - 1 freq |
MetaPhone code - ANRL ainerly - 2 freq anerly - 7 freq anerlie - 68 freq €™anerlie - 1 freq ainerlie - 2 freq |
ANERLIE |
Time to execute Levenshtein function - 0.200483 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.357292 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.027586 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.046545 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.001221 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. |