| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wingit (0) - 4 freq gingit (1) - 12 freq whingit (1) - 1 freq windit (1) - 5 freq wintit (1) - 111 freq hingit (1) - 19 freq dingit (1) - 13 freq wingilt (1) - 1 freq winkit (1) - 11 freq singit (1) - 1 freq infit (2) - 1 freq dangit (2) - 1 freq sinkit (2) - 1 freq inpit (2) - 49 freq liggit (2) - 22 freq singiy (2) - 1 freq pingilt (2) - 1 freq pintit (2) - 14 freq mingin (2) - 101 freq wickit (2) - 36 freq wini (2) - 2 freq wantit (2) - 279 freq fidgit (2) - 3 freq winkie (2) - 3 freq winrin (2) - 2 freq |
wingit (0) - 4 freq dingit (2) - 13 freq wingilt (2) - 1 freq winkit (2) - 11 freq hingit (2) - 19 freq singit (2) - 1 freq gingit (2) - 12 freq wintit (2) - 111 freq whingit (2) - 1 freq windit (2) - 5 freq waggit (3) - 7 freq ingait (3) - 8 freq twangit (3) - 1 freq winged (3) - 5 freq fangit (3) - 1 freq wanwit (3) - 1 freq wing (3) - 37 freq wings (3) - 130 freq pangit (3) - 6 freq winger (3) - 3 freq wundit (3) - 3 freq win't (3) - 4 freq hangit (3) - 12 freq wint (3) - 628 freq wiegt (3) - 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 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 - WNJT whanged - 1 freq wheenged - 1 freq wingit - 4 freq winged - 5 freq whingit - 1 freq weenged - 1 freq |
WINGIT |
| Time to execute Levenshtein function - 0.236975 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.350936 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.026992 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.041017 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.000881 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. |