| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unwed (0) - 1 freq lunged (2) - 3 freq funged (2) - 2 freq ansed (2) - 1 freq united (2) - 75 freq jawed (2) - 4 freq unken (2) - 4 freq snaed (2) - 1 freq inded (2) - 1 freq dunked (2) - 2 freq und (2) - 12 freq dunged (2) - 1 freq sowed (2) - 11 freq kneed (2) - 2 freq 'ned (2) - 1 freq unter (2) - 1 freq dowed (2) - 1 freq knawed (2) - 1 freq gunned (2) - 1 freq uneo (2) - 1 freq anwey (2) - 1 freq cawed (2) - 263 freq anced (2) - 1 freq dunted (2) - 6 freq punted (2) - 5 freq |
unwed (0) - 1 freq snowed (3) - 2 freq vowed (3) - 5 freq owed (3) - 13 freq sawed (3) - 1 freq undeid (3) - 3 freq jowed (3) - 2 freq bowed (3) - 38 freq unread (3) - 3 freq unrowed (3) - 2 freq dawed (3) - 3 freq unweir (3) - 1 freq wed (3) - 22 freq cowed (3) - 7 freq knowed (3) - 64 freq unweel (3) - 2 freq towed (3) - 6 freq untied (3) - 7 freq sewed (3) - 1 freq bawed (3) - 2 freq wowed (3) - 1 freq snawed (3) - 6 freq nied (3) - 3 freq fawed (3) - 6 freq unwind (3) - 5 freq |
SoundEx code - U530 unmet - 3 freq unity - 45 freq unto - 8 freq untae - 13 freq unty - 4 freq unite - 11 freq unit - 42 freq unmade - 5 freq undae - 3 freq um-eet - 1 freq untie - 2 freq unwed - 1 freq und - 12 freq unmeet - 1 freq unyt - 7 freq €™und - 1 freq undo - 1 freq uinitie - 1 freq untee - 1 freq unt - 1 freq |
MetaPhone code - UNWT unwed - 1 freq |
UNWED |
| Time to execute Levenshtein function - 0.198131 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.335841 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.028040 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.037166 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.000886 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. |