| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wan-sided (0) - 2 freq ae-sided (2) - 2 freq yin-sided (2) - 2 freq lop-sided (3) - 1 freq wansie (3) - 1 freq daneside (3) - 1 freq flat-sided (3) - 1 freq langsider (3) - 1 freq langside (3) - 15 freq wan-eyed (3) - 1 freq ham-sized (3) - 1 freq a-sides (3) - 1 freq oanside (3) - 1 freq sandside (3) - 1 freq wan-time (3) - 1 freq man-size (3) - 1 freq wastside (3) - 3 freq widside (4) - 5 freq westside (4) - 25 freq gansie (4) - 3 freq wab-steid (4) - 7 freq longside (4) - 1 freq gateside (4) - 1 freq wildside (4) - 1 freq waw-steid (4) - 1 freq |
wan-sided (0) - 2 freq yin-sided (3) - 2 freq ae-sided (4) - 2 freq wan-eyed (5) - 1 freq lop-sided (5) - 1 freq win-dried (6) - 1 freq yin-sidit (6) - 1 freq wab-steid (6) - 7 freq waw-steid (6) - 1 freq wan-leidit (6) - 1 freq winded (6) - 2 freq na-sayed (6) - 1 freq wended (6) - 1 freq wastside (6) - 3 freq ower-sized (6) - 1 freq bawn-heided (6) - 1 freq langside (6) - 15 freq sandside (6) - 1 freq oanside (6) - 1 freq langsider (6) - 1 freq daneside (6) - 1 freq flat-sided (6) - 1 freq man-size (6) - 1 freq ham-sized (6) - 1 freq wansie (6) - 1 freq |
SoundEx code - W523 wanst - 32 freq whanged - 1 freq wheenged - 1 freq winked - 12 freq winkt - 2 freq wneist - 1 freq wingit - 4 freq wine-stained - 1 freq wanced - 3 freq winged - 5 freq weinstein - 1 freq winkit - 11 freq winston - 3 freq wame-stappin - 1 freq 'winston - 1 freq winceyette - 1 freq wan-sided - 2 freq weenstip - 1 freq whingit - 1 freq winched - 4 freq weenged - 1 freq wansdays - 1 freq wainscots - 1 freq winced - 2 freq wanc't - 1 freq wance't - 3 freq wingsscotland - 4 freq wnkdqi - 1 freq whingytoddlers - 1 freq |
MetaPhone code - WNSTT wan-sided - 2 freq |
WAN-SIDED |
| Time to execute Levenshtein function - 0.186790 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.354373 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.028184 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.039745 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.004625 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. |