| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unkind (0) - 2 freq unkin (1) - 4 freq unwind (1) - 5 freq unkan (2) - 22 freq oonkind (2) - 1 freq tunkin (2) - 1 freq kind (2) - 691 freq unken (2) - 4 freq mankind (2) - 13 freq onkynd (2) - 1 freq dunkin (2) - 2 freq 'kind (2) - 1 freq inkin (2) - 1 freq unkens (2) - 1 freq unkent (2) - 52 freq upwind (2) - 1 freq untied (2) - 7 freq unkindly (2) - 1 freq unkil (2) - 4 freq hunkin (2) - 1 freq ‘kind (2) - 1 freq unkist (2) - 2 freq uckin (2) - 1 freq hunting (3) - 10 freq hunkie (3) - 20 freq |
unkind (0) - 2 freq onkynd (2) - 1 freq oonkind (2) - 1 freq unwind (2) - 5 freq unkin (2) - 4 freq 'kind (3) - 1 freq unkens (3) - 1 freq unkindly (3) - 1 freq unkent (3) - 52 freq inkin (3) - 1 freq unkan (3) - 22 freq unken (3) - 4 freq kind (3) - 691 freq mankind (3) - 13 freq yankin' (4) - 1 freq kynd (4) - 24 freq nekid (4) - 1 freq onand (4) - 1 freq wikend (4) - 10 freq unsound (4) - 1 freq onkent (4) - 2 freq kinda (4) - 175 freq intend (4) - 10 freq nkzd (4) - 1 freq unsnod (4) - 1 freq |
SoundEx code - U525 unkent - 52 freq uncanniness - 1 freq unchaingt - 1 freq uncannie - 14 freq uncomfortable - 28 freq uncommonly - 4 freq unseen - 29 freq unsneckit - 1 freq unkennt - 3 freq uncontrollable - 3 freq uncommon - 8 freq unco-enormous - 1 freq unchancy - 18 freq unseein - 1 freq unison - 8 freq uncomfortably - 3 freq uncanny - 9 freq unchancie - 6 freq uncankert - 3 freq uncheyngin - 1 freq unquenchable - 2 freq unkan - 22 freq unheukin - 1 freq unconventional - 1 freq unkind - 2 freq unsung - 2 freq unashamed - 3 freq unconsciously - 4 freq unkennin - 3 freq unsneckt - 1 freq uncontrollably - 5 freq unision - 1 freq unconditional - 5 freq unknown - 8 freq unsnecked - 3 freq unknowns - 1 freq unconscious - 17 freq uncomplainin - 2 freq un-committal - 1 freq uncomfortible - 3 freq unashamedly - 1 freq unsanitary - 1 freq uncomfi - 2 freq uncomfy - 1 freq uncomfi' - 1 freq uncomfurtible - 3 freq unseemly - 2 freq unknawn - 1 freq unassumin - 2 freq unsinkable - 1 freq uncountable - 1 freq uncan - 57 freq uncaner - 2 freq uncan-laek - 1 freq unecan - 1 freq uncans - 4 freq unweicome - 1 freq unsmell - 1 freq unconiss - 1 freq unsnod - 1 freq unkennable - 3 freq uncheaned - 1 freq unconsumed - 1 freq unjynt - 1 freq unken - 4 freq unquantified - 1 freq unconnectit - 1 freq unconsecrated - 1 freq unmaking - 1 freq €˜unknown - 2 freq unknowing - 1 freq unassimilate - 3 freq unkindly - 1 freq unchanciest - 1 freq unconnacht - 1 freq unsmuirable - 1 freq uncontested - 1 freq un-kent - 1 freq unsonsie - 1 freq unkin - 4 freq unsneck - 1 freq unknawinst - 2 freq unkens - 1 freq unassimielitatid - 1 freq unconstructit - 1 freq uncomplicatit - 1 freq unconseedert - 1 freq unaccoontable - 4 freq unconvinced - 1 freq unconnecktit - 1 freq uniqueness - 1 freq unkonshislee - 2 freq unconditionally - 2 freq unsympathetic - 1 freq unconfident - 1 freq unsound - 1 freq unconfirmed - 1 freq umjnpbu - 1 freq unknoting - 1 freq unsoond - 1 freq |
MetaPhone code - UNKNT unkent - 52 freq unkennt - 3 freq unkind - 2 freq un-kent - 1 freq |
UNKIND |
| Time to execute Levenshtein function - 0.305905 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.803558 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.027637 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.075844 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.000947 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. |