| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waftin (0) - 7 freq wartin (1) - 1 freq waitin (1) - 408 freq oaftin (1) - 1 freq wantin (1) - 321 freq waftit (1) - 4 freq wattin (1) - 2 freq waytin (1) - 1 freq wastin (1) - 32 freq waffin (1) - 18 freq wrytin (2) - 4 freq wafts (2) - 6 freq waetan (2) - 3 freq santin (2) - 1 freq wattrin (2) - 1 freq luftin (2) - 2 freq waffit (2) - 2 freq waxin (2) - 4 freq waa'in (2) - 1 freq waukin (2) - 24 freq wattir (2) - 56 freq giftin (2) - 2 freq satin (2) - 12 freq waft (2) - 7 freq waistin (2) - 1 freq |
waftin (0) - 7 freq wattin (2) - 2 freq wastin (2) - 32 freq waffin (2) - 18 freq waftit (2) - 4 freq waytin (2) - 1 freq wantin (2) - 321 freq waitin (2) - 408 freq wartin (2) - 1 freq oaftin (2) - 1 freq kaftan (3) - 1 freq wrtin (3) - 1 freq wuntin (3) - 9 freq wafted (3) - 7 freq oftin (3) - 1 freq witin (3) - 1 freq siftin (3) - 2 freq waantin (3) - 38 freq wirtin (3) - 2 freq waiten (3) - 1 freq wtin (3) - 1 freq wintin (3) - 52 freq wytin (3) - 64 freq wittin (3) - 28 freq wanton (3) - 2 freq |
SoundEx code - W135 waftin - 7 freq wabbitness - 2 freq wiftmxr - 1 freq wipwednesday - 1 freq |
MetaPhone code - WFTN waftin - 7 freq |
WAFTIN |
| Time to execute Levenshtein function - 0.195146 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.354729 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.029469 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.038292 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.000900 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. |