| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slaw-like (0) - 1 freq slaw-lik (1) - 1 freq saw-like (1) - 1 freq slowlike (2) - 1 freq slawlik (2) - 2 freq slawlie (2) - 10 freq saut-like (3) - 1 freq waa-like (3) - 1 freq sae-lik (3) - 2 freq sac-lik (3) - 1 freq soup-like (3) - 1 freq sik-like (3) - 2 freq soar-lik (3) - 1 freq shawlie (3) - 1 freq slaalie (3) - 1 freq snawline (3) - 1 freq snaar-like (3) - 1 freq safilike (3) - 1 freq slowlie (3) - 1 freq such-like (3) - 1 freq cat-like (3) - 1 freq wean-like (3) - 1 freq samelike (3) - 2 freq saelike (3) - 3 freq saftlike (3) - 6 freq |
slaw-like (0) - 1 freq slaw-lik (1) - 1 freq saw-like (2) - 1 freq slawlik (3) - 2 freq slowlike (3) - 1 freq slawlie (4) - 10 freq sic-like (5) - 11 freq such-like (5) - 1 freq snawflake (5) - 2 freq slowlie (5) - 1 freq saft-like (5) - 1 freq snaar-like (5) - 1 freq blate-like (5) - 16 freq gleg-like (5) - 1 freq some-like (5) - 1 freq sac-lik (5) - 1 freq sae-lik (5) - 2 freq waa-like (5) - 1 freq saut-like (5) - 1 freq sik-like (5) - 2 freq soup-like (5) - 1 freq soar-lik (5) - 1 freq casual-like (6) - 2 freq mellow-like (6) - 1 freq solemn-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-LIKE |
| Time to execute Levenshtein function - 0.445720 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.814940 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.081491 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.038509 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.000854 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. |