| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wasted (0) - 24 freq waster (1) - 13 freq wafted (1) - 7 freq tasted (1) - 20 freq waste (1) - 119 freq waited (1) - 109 freq wastel (1) - 1 freq waisted (1) - 1 freq wastet (1) - 2 freq washed (1) - 90 freq walted (1) - 1 freq hasted (1) - 2 freq casted (1) - 2 freq wastes (1) - 4 freq lasted (1) - 16 freq wated (1) - 1 freq wanted (1) - 265 freq pasted (1) - 2 freq winted (2) - 41 freq toasted (2) - 3 freq washer (2) - 5 freq farted (2) - 3 freq watehd (2) - 1 freq wanten (2) - 1 freq haste (2) - 37 freq |
wasted (0) - 24 freq waisted (1) - 1 freq casted (2) - 2 freq hasted (2) - 2 freq wastes (2) - 4 freq lasted (2) - 16 freq wanted (2) - 265 freq wated (2) - 1 freq walted (2) - 1 freq pasted (2) - 2 freq tasted (2) - 20 freq wafted (2) - 7 freq washed (2) - 90 freq waste (2) - 119 freq waster (2) - 13 freq waited (2) - 109 freq wastet (2) - 2 freq wastel (2) - 1 freq waanted (3) - 19 freq lested (3) - 4 freq wast- (3) - 2 freq wised (3) - 1 freq dusted (3) - 6 freq tested (3) - 21 freq awaited (3) - 4 freq |
SoundEx code - W233 wasted - 24 freq wastit - 21 freq waistit - 4 freq wechted - 1 freq waasht-oot - 1 freq wechtit - 10 freq westwater - 1 freq waste't - 1 freq wechtwaatchers - 1 freq wastet - 2 freq wheeshtit - 7 freq weichtit - 2 freq whistied - 1 freq wawsteids - 1 freq weightwatchers - 1 freq wauchtit - 2 freq washedoot - 1 freq waw-steid - 1 freq weighted - 3 freq waisted - 1 freq wkstott - 1 freq which-heidit - 1 freq wastedducks - 1 freq wztyt - 1 freq |
MetaPhone code - WSTT wasted - 24 freq wastit - 21 freq waistit - 4 freq waste't - 1 freq wastet - 2 freq whistied - 1 freq waw-steid - 1 freq waisted - 1 freq |
WASTED waste - 119 freq wasted - 24 freq waster - 13 freq wasting - 6 freq wastes - 4 freq |
| Time to execute Levenshtein function - 0.191629 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.373051 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.027914 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.038748 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.000945 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. |