| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wingers (0) - 1 freq mingers (1) - 1 freq winters (1) - 21 freq winkers (1) - 1 freq dingers (1) - 3 freq lingers (1) - 6 freq fingers (1) - 248 freq winger (1) - 3 freq winners (1) - 30 freq singers (1) - 54 freq winders (1) - 3 freq hingers (1) - 5 freq minkers (2) - 3 freq ngers (2) - 1 freq ainger (2) - 3 freq wonders (2) - 5 freq diners (2) - 1 freq dungers (2) - 3 freq singer's (2) - 2 freq yinger (2) - 2 freq hinges (2) - 19 freq cringers (2) - 2 freq ginger (2) - 113 freq tigers (2) - 5 freq winnert (2) - 40 freq |
wingers (0) - 1 freq winger (2) - 3 freq winners (2) - 30 freq hingers (2) - 5 freq fingers (2) - 248 freq singers (2) - 54 freq winders (2) - 3 freq mingers (2) - 1 freq lingers (2) - 6 freq winters (2) - 21 freq winkers (2) - 1 freq dingers (2) - 3 freq dangers (3) - 11 freq wankers (3) - 4 freq wunders (3) - 1 freq wagers (3) - 1 freq fingars (3) - 1 freq wanners (3) - 3 freq rangers (3) - 55 freq winnurs (3) - 1 freq wunners (3) - 21 freq wonners (3) - 1 freq fngers (3) - 1 freq mangers (3) - 1 freq wanders (3) - 6 freq |
SoundEx code - W526 wance-aer - 1 freq wangrace - 1 freq winscreen - 1 freq wine-christ - 1 freq wuncher - 1 freq wanker - 14 freq wanceower - 1 freq winger - 3 freq wanscrievit - 1 freq wham-sae-e'er - 1 freq wheengers - 1 freq wanker - 1 freq wankier - 1 freq wankers - 4 freq wancertainities - 1 freq wancertainties - 1 freq wingers - 1 freq winkers - 1 freq |
MetaPhone code - WNJRS wheengers - 1 freq wingers - 1 freq |
WINGERS |
| Time to execute Levenshtein function - 0.186292 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.351595 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.027304 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.040868 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.000848 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. |