| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| watld (0) - 1 freq watl (1) - 1 freq warld (1) - 820 freq wated (1) - 1 freq wald (1) - 2 freq wetl (2) - 1 freq warls (2) - 4 freq wand (2) - 14 freq wuld (2) - 26 freq wad (2) - 2263 freq watew (2) - 2 freq 'at'd (2) - 1 freq aat'd (2) - 5 freq wall (2) - 79 freq waul (2) - 1 freq wal' (2) - 1 freq vald (2) - 1 freq at'd (2) - 4 freq waned (2) - 6 freq wyld (2) - 6 freq wawly (2) - 1 freq waeled (2) - 5 freq aild (2) - 1 freq gated (2) - 1 freq wanted (2) - 265 freq |
watld (0) - 1 freq watl (2) - 1 freq wated (2) - 1 freq wald (2) - 2 freq warld (2) - 820 freq wyted (3) - 13 freq wuild (3) - 4 freq waarld (3) - 1 freq wirld (3) - 73 freq walled (3) - 2 freq wurld (3) - 56 freq waited (3) - 109 freq tauld (3) - 11 freq world (3) - 449 freq wit'd (3) - 1 freq wailed (3) - 4 freq awld (3) - 6 freq would (3) - 722 freq wld (3) - 1 freq awald (3) - 3 freq weild (3) - 1 freq waeled (3) - 5 freq weld (3) - 1 freq wild (3) - 238 freq woarld (3) - 7 freq |
SoundEx code - W343 wheedlt - 1 freq waddled - 4 freq watld - 1 freq whittlt - 1 freq whittled - 2 freq wheedlit - 4 freq whittilt - 1 freq withheld - 1 freq wheedled - 2 freq whit'll-wedae-noo - 1 freq whit'll-i-dae-aboot-yon-thing-ye-ken - 1 freq whitelet - 1 freq waddlet - 2 freq waaddled - 1 freq whittelt - 1 freq whuttled - 2 freq |
MetaPhone code - WTLT wheedlt - 1 freq waddled - 4 freq watld - 1 freq whittlt - 1 freq whittled - 2 freq wheedlit - 4 freq whittilt - 1 freq wheedled - 2 freq whitelet - 1 freq waddlet - 2 freq waaddled - 1 freq whittelt - 1 freq whuttled - 2 freq |
WATLD |
| Time to execute Levenshtein function - 0.407073 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 - 1.194120 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.093455 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.077539 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.001176 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. |