Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tailor-like (0) - 1 freq tattoo-like (3) - 1 freq tailor-made (3) - 1 freq tailoring (4) - 1 freq warld-like (4) - 1 freq tender-like (4) - 1 freq mairlike (4) - 2 freq taivert-lke (4) - 1 freq leisur-like (4) - 1 freq similar-like (4) - 1 freq still-like (4) - 1 freq mellow-like (4) - 1 freq biker-like (4) - 1 freq maist-like (4) - 1 freq makar-like (4) - 1 freq bairn-like (4) - 1 freq paisley-like (4) - 1 freq manly-like (4) - 1 freq taen-like (4) - 3 freq hair-line (4) - 1 freq thing-like (4) - 1 freq bairnlike (4) - 4 freq tailor-meed (4) - 1 freq neibour-like (4) - 1 freq shilpitlike (5) - 1 freq |
tailor-like (0) - 1 freq tailor-made (5) - 1 freq tattoo-like (5) - 1 freq biker-like (6) - 1 freq still-like (6) - 1 freq makar-like (6) - 1 freq tailor-meed (6) - 1 freq similar-like (6) - 1 freq taen-like (6) - 3 freq neibour-like (6) - 1 freq tender-like (6) - 1 freq taivert-lke (6) - 1 freq leisur-like (6) - 1 freq cult-like (7) - 1 freq tentie-like (7) - 1 freq dour-like (7) - 1 freq hulk-like (7) - 1 freq slaw-like (7) - 1 freq teiger-lily (7) - 10 freq better-like (7) - 2 freq taen-lik (7) - 1 freq ill-lik (7) - 1 freq thorow-lik (7) - 1 freq bauld-lik (7) - 1 freq queer-like (7) - 5 freq |
SoundEx code - T464 tailor-like - 1 freq twal-year-auld - 1 freq |
MetaPhone code - TLRLK tailor-like - 1 freq |
TAILOR-LIKE |
Time to execute Levenshtein function - 0.210119 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.402414 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.027705 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.061739 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.000956 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. |