| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| watterwirks (0) - 2 freq waterworks (2) - 3 freq wattermark (3) - 1 freq watterins (3) - 1 freq watermarks (3) - 1 freq wattries (4) - 2 freq wattergaws (4) - 1 freq watterie (4) - 8 freq watters (4) - 86 freq efterwirds (4) - 3 freq watterin (4) - 12 freq watterin' (4) - 1 freq witterins (4) - 1 freq batteries (4) - 8 freq waterworn (4) - 1 freq wattirs (4) - 3 freq watterlily (4) - 1 freq paperwirk (4) - 2 freq wattersports (4) - 1 freq wattermill (4) - 1 freq batterins (4) - 1 freq wasterners (4) - 1 freq watterside (4) - 5 freq wattercress (4) - 2 freq watter's (4) - 27 freq |
watterwirks (0) - 2 freq waterworks (3) - 3 freq watermarks (5) - 1 freq wattermark (5) - 1 freq watterwheels (6) - 1 freq watterins (6) - 1 freq wattercress (6) - 2 freq whittericks (7) - 3 freq wattergates (7) - 1 freq watterfaals (7) - 1 freq wasterners (7) - 1 freq watter''s (7) - 2 freq wattir's (7) - 1 freq wattersports (7) - 1 freq watter-draps (7) - 1 freq afterwards (7) - 15 freq watter's (7) - 27 freq witterins (7) - 1 freq efterwirds (7) - 3 freq wattergaws (7) - 1 freq wattries (7) - 2 freq waterworn (7) - 1 freq watters (7) - 86 freq wattirs (7) - 3 freq netwirks (8) - 7 freq |
SoundEx code - W366 waterworks - 3 freq watterwirks - 2 freq witherer - 2 freq waterworn - 1 freq |
MetaPhone code - WTRWRKS waterworks - 3 freq watterwirks - 2 freq |
WATTERWIRKS |
| Time to execute Levenshtein function - 0.237437 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.479712 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.040133 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.045212 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.000830 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. |