| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanlit (0) - 4 freq wailit (1) - 1 freq wantit (1) - 280 freq wanwit (1) - 1 freq waelit (1) - 1 freq wanit (1) - 1 freq wallit (1) - 1 freq walit (1) - 11 freq wansie (2) - 1 freq wanin (2) - 2 freq gantit (2) - 10 freq sailit (2) - 10 freq harlit (2) - 2 freq wabbit (2) - 79 freq waukit (2) - 4 freq landit (2) - 52 freq mannit (2) - 2 freq mankit (2) - 9 freq swallit (2) - 2 freq bannit (2) - 2 freq waantit (2) - 22 freq wanluk (2) - 1 freq warkit (2) - 23 freq warmit (2) - 2 freq rantit (2) - 1 freq |
wanlit (0) - 4 freq wanit (2) - 1 freq wallit (2) - 1 freq waelit (2) - 1 freq walit (2) - 11 freq wailit (2) - 1 freq wantit (2) - 280 freq wanwit (2) - 1 freq windit (3) - 5 freq sunlit (3) - 2 freq wannt (3) - 1 freq wundit (3) - 3 freq wantet (3) - 82 freq wanlas (3) - 1 freq wanlos (3) - 1 freq willit (3) - 1 freq wallet (3) - 23 freq waenglit (3) - 1 freq wingit (3) - 4 freq haunlit (3) - 1 freq wanst (3) - 32 freq want (3) - 1648 freq sinlit (3) - 1 freq wanluk (3) - 1 freq waantit (3) - 22 freq |
SoundEx code - W543 whummled - 7 freq wonldnue - 1 freq whummelt - 5 freq wanlit - 4 freq whammled - 1 freq wammled - 5 freq whammelt - 1 freq wan-leidit - 1 freq whummilt - 2 freq whummlet - 1 freq wummled - 3 freq whammlet - 1 freq |
MetaPhone code - WNLT wanlit - 4 freq |
WANLIT |
| Time to execute Levenshtein function - 0.218366 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.396653 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.027505 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.037388 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.000880 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. |