| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waterworks (0) - 3 freq watterwirks (2) - 2 freq watermarks (2) - 1 freq waterworn (2) - 1 freq paperwork (3) - 7 freq waterford (3) - 1 freq wateries (4) - 1 freq steelworks (4) - 1 freq waterstones (4) - 4 freq waterfalls (4) - 1 freq efterwarts (4) - 1 freq railworks (4) - 1 freq wattermark (4) - 1 freq waterloo (4) - 26 freq terrors (4) - 3 freq wabwarks (4) - 1 freq waverers (4) - 1 freq waters (4) - 18 freq watergaws (4) - 2 freq catchwords (4) - 1 freq wave-worn (4) - 1 freq hamework (4) - 10 freq warlords (4) - 1 freq paperwirk (4) - 2 freq patchwork (4) - 2 freq |
waterworks (0) - 3 freq watermarks (3) - 1 freq watterwirks (3) - 2 freq waterworn (4) - 1 freq waxwarks (6) - 2 freq wabwarks (6) - 1 freq networks (6) - 1 freq efterwards (6) - 17 freq efterwirds (6) - 3 freq airtworks (6) - 1 freq afterwards (6) - 15 freq efterwurds (6) - 1 freq paperwork (6) - 7 freq steelworks (6) - 1 freq waterford (6) - 1 freq waterproofs (6) - 2 freq fireworks (6) - 11 freq efterwarts (6) - 1 freq overwork (7) - 1 freq interlocks (7) - 1 freq wasterners (7) - 1 freq earthwarks (7) - 2 freq werrocks (7) - 1 freq eftirwarts (7) - 2 freq firewurks (7) - 1 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 |
WATERWORKS |
| Time to execute Levenshtein function - 0.217377 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.408339 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.030710 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.038932 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.000878 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. |