| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slaw-lik (0) - 1 freq slaw-like (1) - 1 freq slawlik (1) - 2 freq sae-lik (2) - 2 freq sac-lik (2) - 1 freq saw-like (2) - 1 freq soar-lik (2) - 1 freq slawlie (2) - 10 freq gay-lik (3) - 1 freq brawlik (3) - 1 freq law-lyin (3) - 1 freq blate-lik (3) - 1 freq shawlie (3) - 1 freq slowlike (3) - 1 freq slawin (3) - 2 freq saft-lik (3) - 1 freq leaf-lik (3) - 1 freq sun-lik (3) - 1 freq slaik (3) - 1 freq blaw-in (3) - 1 freq saelik (3) - 1 freq gah-lik (3) - 1 freq ill-lik (3) - 1 freq slowlie (3) - 1 freq slaalie (3) - 1 freq |
slaw-lik (0) - 1 freq slaw-like (1) - 1 freq slawlik (2) - 2 freq saw-like (3) - 1 freq slowlike (4) - 1 freq soar-lik (4) - 1 freq slawlie (4) - 10 freq sae-lik (4) - 2 freq sac-lik (4) - 1 freq leaf-lik (5) - 1 freq sun-lik (5) - 1 freq slowlie (5) - 1 freq ill-lik (5) - 1 freq saft-lik (5) - 1 freq law-lyin (5) - 1 freq slawly (5) - 49 freq blate-lik (5) - 1 freq snaar-like (6) - 1 freq sic-like (6) - 11 freq snawflake (6) - 2 freq snell-lik (6) - 1 freq saft-like (6) - 1 freq blate-like (6) - 16 freq some-like (6) - 1 freq soup-like (6) - 1 freq |
SoundEx code - S442 slowlike - 1 freq soliloquy - 3 freq soliliquay - 1 freq skeelie-like - 2 freq slaw-like - 1 freq slaw-lik - 1 freq slawlik - 2 freq |
MetaPhone code - SLLK slowlike - 1 freq soliloquy - 3 freq soliliquay - 1 freq slaw-like - 1 freq slaw-lik - 1 freq slawlik - 2 freq |
SLAW-LIK |
| Time to execute Levenshtein function - 0.228710 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.402342 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.028984 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.044203 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.000910 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. |