Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
waenglit (0) - 1 freq waelit (2) - 1 freq manglit (2) - 3 freq tanglit (2) - 1 freq fanglit (2) - 1 freq wanlit (2) - 4 freq wheeplit (3) - 2 freq fanklit (3) - 2 freq wantit (3) - 280 freq waantit (3) - 22 freq weeglet (3) - 1 freq avengit (3) - 2 freq englis (3) - 6 freq tanglet (3) - 1 freq dangit (3) - 1 freq haunlit (3) - 1 freq hangit (3) - 12 freq wanwit (3) - 1 freq tanglt (3) - 1 freq taiglit (3) - 2 freq fangit (3) - 1 freq wingit (3) - 4 freq wanit (3) - 1 freq wengle (3) - 1 freq wangled (3) - 1 freq |
waenglit (0) - 1 freq wanlit (3) - 4 freq tanglit (3) - 1 freq fanglit (3) - 1 freq manglit (3) - 3 freq wangled (4) - 1 freq tanglt (4) - 1 freq tanglet (4) - 1 freq weeglet (4) - 1 freq wingilt (4) - 1 freq wengle (4) - 1 freq wingit (4) - 4 freq waelit (4) - 1 freq walit (5) - 11 freq anglin (5) - 2 freq tangelt (5) - 2 freq mangl't (5) - 1 freq wheedlit (5) - 4 freq weeglin (5) - 2 freq wailit (5) - 1 freq waggit (5) - 8 freq danglin (5) - 16 freq canglin (5) - 1 freq wrigglit (5) - 2 freq ringlet (5) - 1 freq |
SoundEx code - W524 winkle-picker's - 1 freq winkler - 1 freq wangled - 1 freq wan-o-clock - 1 freq wengle - 1 freq winkled - 1 freq winnock-soles - 1 freq wingilt - 1 freq weans'll - 1 freq waenglit - 1 freq winkelstrjitten - 1 freq winkels - 1 freq weensland - 1 freq wine-colourt - 1 freq |
MetaPhone code - WNKLT wangled - 1 freq winkled - 1 freq waenglit - 1 freq |
WAENGLIT |
Time to execute Levenshtein function - 0.227589 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.378506 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.028756 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.039261 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.000874 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. |