| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uncomfy (0) - 1 freq uncomfi (1) - 2 freq comfy (2) - 48 freq uncomfi' (2) - 1 freq uncouth (3) - 5 freq uncos (3) - 3 freq oncomin (3) - 4 freq compy (3) - 1 freq upcomin (3) - 3 freq income (3) - 16 freq incomin (3) - 7 freq oncome (3) - 40 freq incoman (3) - 1 freq incomes (3) - 1 freq unco (3) - 328 freq upcome (3) - 2 freq upcomes (3) - 1 freq uncoil (3) - 2 freq oncoms (3) - 1 freq uncanny (3) - 9 freq antommy (3) - 1 freq ungodly (3) - 2 freq unholy (3) - 4 freq uncommon (3) - 8 freq incomer (3) - 9 freq |
uncomfy (0) - 1 freq uncomfi (1) - 2 freq uncomfi' (3) - 1 freq comfy (3) - 48 freq oncome (4) - 40 freq incoman (4) - 1 freq incomin (4) - 7 freq oncoms (4) - 1 freq incomes (4) - 1 freq incomer (4) - 9 freq oncomin (4) - 4 freq income (4) - 16 freq oncum (5) - 50 freq uncouth (5) - 5 freq incam (5) - 3 freq oncums (5) - 2 freq incalf (5) - 1 freq incum (5) - 1 freq ncimga (5) - 1 freq comfae (5) - 1 freq uncommon (5) - 8 freq upcome (5) - 2 freq unco (5) - 328 freq compy (5) - 1 freq upcomin (5) - 3 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 - UNKMF uncomfi - 2 freq uncomfy - 1 freq uncomfi' - 1 freq |
UNCOMFY |
| Time to execute Levenshtein function - 0.237676 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.379801 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.030332 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.039330 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.000835 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. |