| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ayelf (0) - 1 freq ayel (1) - 2 freq belf (2) - 3 freq skelf (2) - 36 freq adele (2) - 1 freq ael (2) - 1 freq ayee (2) - 8 freq aye¥ (2) - 1 freq shelf (2) - 77 freq ayl (2) - 1 freq abell (2) - 1 freq yell (2) - 57 freq ayld (2) - 1 freq abel (2) - 7 freq aye' (2) - 1 freq ayes (2) - 2 freq yeld (2) - 2 freq adela (2) - 4 freq anely (2) - 328 freq helf (2) - 2 freq aye” (2) - 1 freq byel (2) - 1 freq maself (2) - 21 freq aye's (2) - 1 freq aseef (2) - 1 freq |
ayelf (0) - 1 freq alf (2) - 7 freq ayel (2) - 2 freq aalf (2) - 1 freq elf (2) - 10 freq aseef (3) - 1 freq adolf (3) - 2 freq leif (3) - 2 freq helf (3) - 2 freq aloof (3) - 2 freq pelf (3) - 6 freq ulf (3) - 4 freq laef (3) - 6 freq lef (3) - 7 freq yel (3) - 4 freq yelp (3) - 20 freq self (3) - 93 freq yel' (3) - 1 freq ayl (3) - 1 freq leaf (3) - 40 freq lief (3) - 3 freq lf (3) - 5 freq ael (3) - 1 freq lyf (3) - 3 freq belf (3) - 3 freq |
SoundEx code - A410 alive - 160 freq alba - 75 freq aleive - 1 freq aleeve - 1 freq aloof - 2 freq alfie - 28 freq alive' - 1 freq alibi - 2 freq alf - 7 freq aleppo - 1 freq alph - 1 freq alpha - 5 freq a'luv - 1 freq alewife - 1 freq alva - 2 freq alba' - 1 freq alp - 1 freq €™alba - 1 freq alab - 1 freq ayelf - 1 freq aalf - 1 freq alyve - 1 freq allyboy - 1 freq |
MetaPhone code - AYLF ayelf - 1 freq |
AYELF |
| Time to execute Levenshtein function - 0.189243 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.343544 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.027904 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.037659 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.000931 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. |