| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sulkily (0) - 3 freq sulky (2) - 7 freq sulkit (2) - 3 freq luckily (2) - 34 freq sully (2) - 2 freq sulkin (2) - 5 freq huffily (3) - 3 freq sulk (3) - 4 freq sullie (3) - 2 freq sullies (3) - 3 freq gully (3) - 16 freq sicily (3) - 5 freq funnily (3) - 6 freq bulky (3) - 2 freq solidly (3) - 1 freq wully (3) - 127 freq slawly (3) - 49 freq silkie (3) - 3 freq scully (3) - 2 freq skely (3) - 1 freq sultry (3) - 24 freq skeily (3) - 1 freq slidy (3) - 2 freq sally (3) - 145 freq solkits (3) - 3 freq |
sulkily (0) - 3 freq sulkin (3) - 5 freq sully (3) - 2 freq sulkit (3) - 3 freq sulky (3) - 7 freq silky (4) - 10 freq -lkely (4) - 1 freq silkies (4) - 2 freq selkie (4) - 17 freq skil (4) - 3 freq sulken (4) - 1 freq sleely (4) - 1 freq selly (4) - 1 freq slowly (4) - 229 freq lukuly (4) - 2 freq sulks (4) - 3 freq silly (4) - 63 freq seekly (4) - 1 freq spookily (4) - 1 freq solely (4) - 3 freq sirkil (4) - 1 freq sulked (4) - 1 freq sull (4) - 4 freq sneakily (4) - 4 freq slyly (4) - 3 freq |
SoundEx code - S424 scuil-cless - 1 freq sulkily - 3 freq school-children - 1 freq scuil-college - 1 freq shilly-shally - 1 freq schoolchildren - 1 freq sallieaxl - 1 freq |
MetaPhone code - SLKL sulkily - 3 freq |
SULKILY |
| Time to execute Levenshtein function - 0.235909 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.463128 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.068214 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.074016 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.000899 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. |