Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yorkshire (0) - 24 freq berkshire (2) - 4 freq foreshore (3) - 3 freq ayrshire (3) - 96 freq yorkshireman (3) - 1 freq yorkie (3) - 5 freq ayreshire (3) - 2 freq lordshipe (3) - 3 freq morayshire (3) - 1 freq yorker (4) - 1 freq threshie (4) - 2 freq gobshite (4) - 7 freq roushiae (4) - 3 freq outshine (4) - 1 freq conspire (4) - 2 freq foreswore (4) - 1 freq ayrshir (4) - 1 freq yous're (4) - 2 freq rashie (4) - 1 freq worshipt (4) - 1 freq corkscrew (4) - 2 freq norskie (4) - 1 freq goodsire (4) - 1 freq youthie (4) - 1 freq brochire (4) - 1 freq |
yorkshire (0) - 24 freq berkshire (3) - 4 freq ayrshire (4) - 96 freq ayreshire (4) - 2 freq ayrshir (5) - 1 freq morayshire (5) - 1 freq yorkshireman (5) - 1 freq foreshore (5) - 3 freq lanarkshire (6) - 18 freq cheshire (6) - 10 freq preshure (6) - 1 freq rooshie (6) - 1 freq kosher (6) - 1 freq roushie (6) - 17 freq workshap (6) - 1 freq ayreshires (6) - 1 freq lanrikshire (6) - 2 freq worksheet (6) - 2 freq orphir (6) - 3 freq yorkies (6) - 1 freq workshop (6) - 21 freq wilshire (6) - 2 freq shire (6) - 26 freq rasher (6) - 1 freq workshy (6) - 1 freq |
SoundEx code - Y626 yorker - 1 freq yerkers - 2 freq yorkshire - 24 freq yorkshireness - 1 freq yorkshireman - 1 freq yerker - 1 freq |
MetaPhone code - YRKXR yorkshire - 24 freq |
YORKSHIRE |
Time to execute Levenshtein function - 0.233120 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.461317 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.032931 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.036980 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.000948 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. |