| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quick-like (0) - 2 freq quict-like (1) - 1 freq quicklie (2) - 2 freq stick-like (2) - 1 freq quiet-like (2) - 5 freq seeck-like (3) - 1 freq sic-like (3) - 11 freq quickie (3) - 1 freq sik-like (3) - 2 freq queer-like (3) - 5 freq frock-like (3) - 1 freq hulk-like (3) - 1 freq quait-like (3) - 3 freq luik-alike (3) - 1 freq such-like (3) - 1 freq quietlike (3) - 10 freq unco-like (3) - 4 freq wice-like (3) - 3 freq swack-like (3) - 1 freq quaet-like (3) - 2 freq quate-like (3) - 9 freq jimp-like (4) - 1 freq firm-like (4) - 1 freq joco-like (4) - 1 freq macklike (4) - 1 freq |
quick-like (0) - 2 freq quict-like (2) - 1 freq seeck-like (4) - 1 freq quiet-like (4) - 5 freq stick-like (4) - 1 freq quicklie (4) - 2 freq unco-like (5) - 4 freq such-like (5) - 1 freq wice-like (5) - 3 freq quate-like (5) - 9 freq luik-alike (5) - 1 freq quaet-like (5) - 2 freq swack-like (5) - 1 freq quait-like (5) - 3 freq hulk-like (5) - 1 freq sic-like (5) - 11 freq sik-like (5) - 2 freq queer-like (5) - 5 freq frock-like (5) - 1 freq quickly (6) - 191 freq douce-like (6) - 8 freq och-like (6) - 1 freq squaiky-like (6) - 2 freq meek-like (6) - 1 freq wyce-like (6) - 15 freq |
SoundEx code - Q242 quick-lachin - 1 freq quick-like - 2 freq |
MetaPhone code - KKLK cockaleekie - 1 freq cockieleekie - 1 freq quick-like - 2 freq |
QUICK-LIKE |
| Time to execute Levenshtein function - 0.226270 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.421161 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.028026 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.038030 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.000929 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. |