| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unheard (0) - 8 freq unherd (1) - 2 freq un-hear (2) - 1 freq heard (2) - 1286 freq unlear (2) - 1 freq unread (2) - 3 freq unlearn (2) - 2 freq unhap (3) - 2 freq unter (3) - 1 freq €™head (3) - 1 freq misheard (3) - 2 freq unvexed (3) - 1 freq hsard (3) - 1 freq ‘hard (3) - 2 freq 'hard (3) - 2 freq uncheaned (3) - 1 freq hard (3) - 799 freq unwed (3) - 1 freq nears (3) - 3 freq unsaid (3) - 6 freq head (3) - 260 freq heird (3) - 1 freq shear (3) - 9 freq unnerx (3) - 1 freq under (3) - 447 freq |
unheard (0) - 8 freq unherd (1) - 2 freq unread (3) - 3 freq iainheard (3) - 1 freq heard (3) - 1286 freq sheared (4) - 6 freq heerd (4) - 93 freq nard (4) - 3 freq naard (4) - 1 freq unsered (4) - 1 freq shard (4) - 2 freq neared (4) - 3 freq nerd (4) - 2 freq therd (4) - 2 freq inhad (4) - 1 freq heared (4) - 14 freq herd (4) - 158 freq hoard (4) - 12 freq unheeded (4) - 1 freq unshared (4) - 1 freq chard (4) - 1 freq onward (4) - 5 freq anhere (4) - 1 freq unhermed (4) - 4 freq unheuked (4) - 1 freq |
SoundEx code - U563 unnertowe - 2 freq unwritten - 6 freq unrade - 1 freq unnertaken - 1 freq unnertak - 4 freq unnerteuk - 1 freq unreadable - 2 freq unhertsome - 2 freq unnerratit - 2 freq unmortared - 1 freq unearthed - 7 freq unrationed - 1 freq unread - 3 freq unheard - 8 freq unhairtsome - 2 freq unnertone - 2 freq unorthodox - 1 freq unnerthreat - 1 freq unnerthe - 1 freq unnertakkins - 4 freq unnèr-docht - 43 freq unrit - 1 freq unnertuk - 7 freq unnertaakin - 1 freq unmerited - 1 freq unreddit - 1 freq unherd - 2 freq unruddered - 1 freq unnertakin - 1 freq unyirdlie - 1 freq unnertook - 1 freq unrowed - 2 freq unmerriet - 3 freq unmerried - 1 freq unnerwatter - 1 freq unnertaen - 3 freq unner-the-seat - 1 freq unnerdugs - 1 freq unearthly - 1 freq unhurt - 1 freq umrhdirk - 1 freq |
MetaPhone code - UNHRT unheard - 8 freq unherd - 2 freq unhurt - 1 freq |
UNHEARD |
| Time to execute Levenshtein function - 0.201313 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.363460 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.027593 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.037580 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.000954 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. |