Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unsafe (0) - 2 freq 'safe (2) - 1 freq safe (2) - 284 freq unrade (2) - 1 freq unmade (2) - 5 freq unease (2) - 6 freq untape (2) - 1 freq undae (2) - 3 freq insane (2) - 8 freq uisage (2) - 9 freq unsee (2) - 1 freq unsaid (2) - 6 freq €œsafe (2) - 1 freq unsure (2) - 6 freq unsaed (2) - 1 freq usage (2) - 10 freq untae (2) - 13 freq 'same (3) - 4 freq munage (3) - 6 freq ineae (3) - 1 freq undone (3) - 4 freq uissage (3) - 3 freq unswer (3) - 6 freq upwae (3) - 1 freq untamed (3) - 1 freq |
unsafe (0) - 2 freq unsee (3) - 1 freq unsure (3) - 6 freq unsaed (3) - 1 freq 'safe (3) - 1 freq insane (3) - 8 freq unsaid (3) - 6 freq safe (3) - 284 freq unease (3) - 6 freq onysake (4) - 1 freq nescafe (4) - 1 freq usefu (4) - 10 freq usefy (4) - 1 freq ense (4) - 15 freq ansar (4) - 1 freq insyde (4) - 1 freq insure (4) - 2 freq uissfae (4) - 16 freq unseen (4) - 29 freq inside (4) - 569 freq nyaff (4) - 24 freq nsa (4) - 1 freq anse (4) - 4 freq onsite (4) - 1 freq unser (4) - 3 freq |
SoundEx code - U521 unexpeckit - 10 freq unexpected - 16 freq unexpectit - 9 freq unceevil - 1 freq unsavoury - 1 freq unspelt - 1 freq unexpectedly - 4 freq unexpectitly - 3 freq unspecified - 6 freq unspoken - 5 freq uncivil - 2 freq unspeakable - 2 freq uncouple - 1 freq unsupervised - 1 freq unspoke - 1 freq 'unacceptable - 1 freq uncoupled - 1 freq unsafe - 2 freq unspret - 1 freq unspaekable - 2 freq unsoupled - 1 freq unspared - 1 freq unsubstantiate - 1 freq unspaed - 1 freq unspokken - 1 freq unspun - 1 freq ungebrochnen - 1 freq unexpeckitlie - 2 freq unsportin - 1 freq unspikkable - 1 freq €œungava - 1 freq unexpress - 1 freq unkept - 2 freq uncovered - 2 freq unship - 1 freq unshiftable - 1 freq unexpectit-like - 1 freq unexplained - 1 freq unmissable - 2 freq unseparably - 1 freq uynsieboke - 1 freq unexplainedpod - 1 freq unacceptable - 1 freq |
MetaPhone code - UNSF unsafe - 2 freq |
UNSAFE |
Time to execute Levenshtein function - 0.237286 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.413653 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.028282 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.038285 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.001099 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. |