| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| three-year-auld (0) - 1 freq thirteen-year-auld (3) - 1 freq ten-year-auld (3) - 4 freq twal-year-auld (4) - 1 freq five-year-auld (4) - 4 freq nine-year-auld (4) - 2 freq fourteen-year-auld (5) - 1 freq eleeven-year-auld (5) - 1 freq fiveyear-auld (5) - 1 freq five-year-aulds (5) - 3 freq three-year (5) - 1 freq twelve-year-aulds (5) - 1 freq -year-auld (5) - 3 freq thirteen-year-old (5) - 1 freq five-yearauld (5) - 1 freq fifteen-year-auld (5) - 2 freq twaa-year-aul (5) - 2 freq fowr-year-auld (5) - 1 freq four-year-auld (5) - 1 freq -year-aul (6) - 1 freq thrie-year (6) - 1 freq seventy-year-auld (6) - 1 freq threttie-fauld (6) - 1 freq twelve-year-old (6) - 1 freq eleeven-year-aul (6) - 1 freq |
three-year-auld (0) - 1 freq ten-year-auld (5) - 4 freq thirteen-year-auld (5) - 1 freq twal-year-auld (6) - 1 freq four-year-auld (7) - 1 freq fowr-year-auld (7) - 1 freq thirteen-year-old (7) - 1 freq five-year-auld (7) - 4 freq nine-year-auld (7) - 2 freq twaa-year-aul (8) - 2 freq eleeven-year-auld (8) - 1 freq thoosan-year-aald (8) - 1 freq -year-auld (8) - 3 freq three-year (8) - 1 freq eight-yir-auld (9) - 1 freq twelve-year-old (9) - 1 freq thrie-year (9) - 1 freq threttie-fauld (9) - 1 freq four-yir-auld (9) - 1 freq fourteen-year-auld (9) - 1 freq five-year-aulds (9) - 3 freq fiveyear-auld (9) - 1 freq fifteen-year-auld (9) - 2 freq twelve-year-aulds (9) - 1 freq five-yearauld (9) - 1 freq |
SoundEx code - T664 three-year-auld - 1 freq |
MetaPhone code - 0RYRLT three-year-auld - 1 freq |
THREE-YEAR-AULD |
| Time to execute Levenshtein function - 0.240093 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.412990 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.029289 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.038756 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.000908 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. |