| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sherlock (0) - 7 freq sherrick (2) - 2 freq selleck (3) - 1 freq headlock (3) - 1 freq dervock (3) - 1 freq sheck (3) - 1 freq wedlock (3) - 4 freq seleck (3) - 2 freq interlock (3) - 1 freq shellback (3) - 2 freq warlock (3) - 43 freq airlock (3) - 4 freq shock (3) - 114 freq fisherfock (3) - 1 freq hillock (3) - 8 freq sherk (3) - 1 freq sillock (3) - 2 freq shamrock (3) - 3 freq slock (3) - 8 freq owerlook (3) - 1 freq skelloch (3) - 5 freq sermons (4) - 9 freq check (4) - 203 freq hammock (4) - 4 freq gellick (4) - 47 freq |
sherlock (0) - 7 freq sherrick (3) - 2 freq fisherfock (5) - 1 freq shock (5) - 114 freq airlock (5) - 4 freq sherk (5) - 1 freq shamrock (5) - 3 freq slock (5) - 8 freq warlock (5) - 43 freq sillock (5) - 2 freq hillock (5) - 8 freq shellback (5) - 2 freq selleck (5) - 1 freq headlock (5) - 1 freq sheck (5) - 1 freq seleck (5) - 2 freq interlock (5) - 1 freq struck (6) - 94 freq sharlie (6) - 1 freq shrank (6) - 3 freq shirk (6) - 2 freq sherrickin (6) - 2 freq shriek (6) - 21 freq shack (6) - 3 freq shurly (6) - 16 freq |
SoundEx code - S642 skirls - 16 freq square-lookin - 1 freq sherlock - 7 freq squirrels - 20 freq scrolls - 6 freq scurrilous - 2 freq sair-leukin - 1 freq soar-lik - 1 freq soorlike - 1 freq 'squirrels - 1 freq swirls - 7 freq surrealism - 2 freq sairless - 1 freq square-lickly - 1 freq scurls - 1 freq soor-lukkan - 1 freq skerls - 3 freq serialise - 1 freq surrealist - 1 freq sweir-like - 1 freq skirls'll - 1 freq skroils - 1 freq surreywallcreep - 1 freq |
MetaPhone code - XRLK sherlock - 7 freq |
SHERLOCK |
| Time to execute Levenshtein function - 0.307975 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.519298 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.027683 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.045022 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.001079 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. |