Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
five-yearauld (0) - 1 freq five-year-auld (1) - 4 freq five-year-aulds (2) - 3 freq fiveyear-auld (2) - 1 freq five-yearowld (2) - 1 freq nine-year-auld (3) - 2 freq fowr-year-auld (4) - 1 freq five-year (4) - 1 freq four-year-auld (4) - 1 freq -year-auld (5) - 3 freq sixteen-yearauld (5) - 1 freq ten-year-auld (5) - 4 freq five-year-plans (5) - 1 freq fifteen-year-auld (5) - 2 freq five-sparred (5) - 3 freq twal-year-auld (5) - 1 freq three-year-auld (5) - 1 freq five-quid (6) - 1 freq twelve-year-old (6) - 1 freq freehauld (6) - 1 freq twelve-year-aulds (6) - 1 freq four-yir-auld (6) - 1 freq five-star (6) - 1 freq year-auld (6) - 7 freq seventy-year-auld (6) - 1 freq |
five-yearauld (0) - 1 freq five-year-auld (2) - 4 freq five-yearowld (3) - 1 freq five-year-aulds (4) - 3 freq fiveyear-auld (4) - 1 freq five-year (6) - 1 freq nine-year-auld (6) - 2 freq four-year-auld (6) - 1 freq fowr-year-auld (7) - 1 freq five-baurred (8) - 2 freq five-sparred (8) - 3 freq five-quid (8) - 1 freq four-yir-auld (8) - 1 freq ten-year-auld (8) - 4 freq -year-auld (8) - 3 freq ice-cauld (9) - 1 freq year-auld (9) - 7 freq eleeven-year-auld (9) - 1 freq five-star (9) - 1 freq -year-old (9) - 1 freq five-mile (9) - 1 freq five-flair (9) - 1 freq firey-reid (9) - 2 freq twal-year-auld (9) - 1 freq sixteen-yearauld (9) - 1 freq |
SoundEx code - F164 five-yearauld - 1 freq fiveyear-auld - 1 freq five-year-auld - 4 freq five-year-aulds - 3 freq five-yearowld - 1 freq |
MetaPhone code - FFYRLT five-yearauld - 1 freq fiveyear-auld - 1 freq five-year-auld - 4 freq five-yearowld - 1 freq |
FIVE-YEARAULD |
Time to execute Levenshtein function - 0.286035 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.758612 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.032664 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.154748 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.001234 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. |