Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unfashed (0) - 1 freq unwashed (1) - 3 freq fashed (2) - 82 freq nashed (2) - 4 freq unweshed (2) - 1 freq unwaashed (2) - 1 freq unleashed (2) - 1 freq unfaaled (2) - 2 freq unfazed (2) - 1 freq snashed (2) - 11 freq unfasht (2) - 2 freq unpushed (2) - 1 freq unmasked (2) - 1 freq unearthed (3) - 7 freq unwaged (3) - 1 freq unfinished (3) - 2 freq stashed (3) - 4 freq snushed (3) - 3 freq humfished (3) - 1 freq unsaed (3) - 1 freq knashes (3) - 1 freq fashes (3) - 5 freq ushed (3) - 1 freq squashed (3) - 11 freq cashed (3) - 3 freq |
unfashed (0) - 1 freq unwashed (2) - 3 freq unfasht (3) - 2 freq unpushed (3) - 1 freq unleashed (3) - 1 freq unwaashed (3) - 1 freq fashed (3) - 82 freq unweshed (3) - 1 freq nashed (3) - 4 freq infused (4) - 4 freq fyshed (4) - 1 freq feshed (4) - 1 freq infested (4) - 1 freq neshed (4) - 1 freq fushed (4) - 3 freq fished (4) - 20 freq unmasked (4) - 1 freq unfazed (4) - 1 freq unfinished (4) - 2 freq unfaaled (4) - 2 freq fashd (4) - 6 freq snashed (4) - 11 freq waashed (5) - 9 freq flashed (5) - 17 freq dashed (5) - 14 freq |
SoundEx code - U512 unbekent - 7 freq unpossible - 4 freq unbowsome - 3 freq unvexed - 1 freq unpacked - 3 freq unvisible - 1 freq unpack - 5 freq unpickin - 1 freq unbiased - 3 freq unfaistened - 1 freq unobserved - 1 freq unofeecial - 1 freq unaffected - 2 freq unbeknownst - 1 freq unfasht - 2 freq unhaps - 1 freq unofficial - 5 freq unpeg - 1 freq unfacilitated - 1 freq unpikit - 1 freq unfashed - 1 freq unpicked - 1 freq unpickt - 1 freq unbeast - 2 freq unpackin - 1 freq un-be-kent - 1 freq unpushed - 1 freq unfocus - 1 freq un-bekent - 1 freq unfocussed - 1 freq unfixin - 1 freq unbuckle - 2 freq unpackit - 1 freq unfazed - 1 freq uniofoxford - 1 freq uhoynpqd - 1 freq unpaking - 1 freq unvaccinated - 1 freq |
MetaPhone code - UNFXT unfasht - 2 freq unfashed - 1 freq |
UNFASHED |
Time to execute Levenshtein function - 0.230643 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.381062 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.027607 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.037042 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.000844 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. |