| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| winces (0) - 3 freq wines (1) - 8 freq windes (1) - 1 freq wince (1) - 5 freq winced (1) - 2 freq finces (1) - 1 freq minces (1) - 1 freq wincey (1) - 1 freq pisces (2) - 3 freq oonces (2) - 3 freq windee (2) - 3 freq wiles (2) - 11 freq winkers (2) - 1 freq wanes (2) - 2 freq finches (2) - 1 freq winkels (2) - 1 freq wined (2) - 4 freq wincy (2) - 2 freq wenes (2) - 1 freq winze (2) - 1 freq swines (2) - 4 freq wingers (2) - 1 freq nonces (2) - 2 freq winae (2) - 2 freq wanced (2) - 3 freq |
winces (0) - 3 freq wincey (2) - 1 freq wines (2) - 8 freq finces (2) - 1 freq minces (2) - 1 freq windes (2) - 1 freq winced (2) - 2 freq wince (2) - 5 freq wins (3) - 78 freq wints (3) - 49 freq winds (3) - 61 freq wancee (3) - 1 freq dances (3) - 43 freq wincin (3) - 1 freq win's (3) - 8 freq ounces (3) - 1 freq windaes (3) - 158 freq fences (3) - 22 freq wance (3) - 328 freq windoes (3) - 1 freq windies (3) - 2 freq wine's (3) - 2 freq wino's (3) - 1 freq windeas (3) - 1 freq wunce (3) - 1 freq |
SoundEx code - W522 wenches - 2 freq winces - 3 freq wonka's - 24 freq 'wonka's - 2 freq wonkas - 2 freq wenceslas - 1 freq wenceslas' - 1 freq whinges - 1 freq wingies - 1 freq wheenges - 1 freq whimsical - 2 freq winchester - 1 freq wannecessar - 1 freq wankish - 1 freq winchesterderek - 1 freq whimsicallush - 1 freq |
MetaPhone code - WNSS winces - 3 freq weans's - 2 freq |
WINCES |
| Time to execute Levenshtein function - 0.192848 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.396507 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.027853 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.038706 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.000962 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. |