| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weelasses (0) - 5 freq eelashes (2) - 4 freq weelàsses (2) - 2 freq weelass (2) - 2 freq weelads (3) - 1 freq crevasses (3) - 1 freq weel-seen (3) - 2 freq glasses (3) - 24 freq lasses (3) - 69 freq wirelesses (3) - 1 freq weel-used (3) - 1 freq weelness (3) - 1 freq weeshes (3) - 1 freq weelàss (3) - 7 freq cutlasses (3) - 1 freq veelages (3) - 1 freq classes (3) - 52 freq eyelashes (3) - 8 freq weesles (3) - 1 freq ulysses (4) - 1 freq peylades (4) - 1 freq surpasses (4) - 1 freq weelins (4) - 1 freq palliasses (4) - 1 freq eease (4) - 1 freq |
weelasses (0) - 5 freq weelass (3) - 2 freq lasses (4) - 69 freq wirelesses (4) - 1 freq weelness (4) - 1 freq classes (4) - 52 freq glasses (4) - 24 freq eelashes (4) - 4 freq weelàsses (4) - 2 freq plusses (5) - 1 freq wisses (5) - 4 freq closses (5) - 1 freq clesses (5) - 54 freq plaesses (5) - 15 freq blisses (5) - 3 freq eyeglesses (5) - 1 freq glesses (5) - 96 freq plisses (5) - 4 freq vlisses (5) - 2 freq waalruses (5) - 1 freq lassies (5) - 308 freq wusses (5) - 1 freq losses (5) - 15 freq loasses (5) - 5 freq glaisses (5) - 22 freq |
SoundEx code - W422 wulkies - 2 freq wilkies - 1 freq whulkies - 1 freq willick-hoakin - 1 freq weel-chosen - 1 freq weelàsses - 2 freq weelasses - 5 freq welsh's - 3 freq walkies - 8 freq weel-aye-jist - 1 freq wallace's - 2 freq wilcox - 1 freq wallacehighsch - 1 freq welshgovernment - 1 freq wlxghx - 1 freq |
MetaPhone code - WLSS weelàsses - 2 freq weelasses - 5 freq wullies's - 2 freq wallace's - 2 freq |
WEELASSES |
| Time to execute Levenshtein function - 0.189981 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.368654 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.027646 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.036870 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.000883 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. |