Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unkept (0) - 2 freq unkent (1) - 50 freq runkelt (2) - 5 freq unselt (2) - 1 freq unkennt (2) - 3 freq €¦kept (2) - 1 freq untelt (2) - 2 freq ungert (2) - 1 freq unkens (2) - 1 freq kept (2) - 504 freq onkent (2) - 2 freq hunkert (2) - 19 freq unjest (2) - 1 freq inept (2) - 1 freq unken (2) - 4 freq unrest (2) - 6 freq un-kent (2) - 1 freq unmeet (2) - 1 freq unker (2) - 4 freq sunket (2) - 3 freq nept (2) - 1 freq unkist (2) - 2 freq unmet (2) - 3 freq intert (3) - 1 freq unweel (3) - 2 freq |
unkept (0) - 2 freq unkent (2) - 50 freq inept (3) - 1 freq onkent (3) - 2 freq unkist (3) - 2 freq nept (3) - 1 freq kept (3) - 504 freq keypt (4) - 1 freq nippt (4) - 5 freq oonkent (4) - 2 freq unmet (4) - 3 freq inapt (4) - 1 freq nkst (4) - 1 freq kepit (4) - 3 freq nkt (4) - 1 freq skepit (4) - 1 freq skipt (4) - 1 freq yunkit (4) - 1 freq kepta (4) - 1 freq kpt (4) - 1 freq unkens (4) - 1 freq hunkert (4) - 19 freq unjest (4) - 1 freq runkelt (4) - 5 freq ungert (4) - 1 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 unspoken - 4 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 unspecified - 5 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 - UNKPT unkept - 2 freq |
UNKEPT |
Time to execute Levenshtein function - 0.206050 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.379000 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.029261 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.038220 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.000850 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. |