| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| half-hard (0) - 2 freq half-mad (2) - 1 freq half-hid (2) - 1 freq hauf-heard (2) - 1 freq half-fairt (3) - 1 freq half-hearted (3) - 1 freq half-deid (3) - 1 freq hauf-mad (3) - 1 freq half-naked (3) - 1 freq half-awa (3) - 2 freq halyard (3) - 1 freq half-tirn (3) - 1 freq half-sa (3) - 1 freq hallvard (3) - 2 freq half-hairted (3) - 1 freq half-cauld (3) - 1 freq half-past (3) - 7 freq hauf-way (4) - 1 freq affoard (4) - 3 freq hauf-mirk (4) - 1 freq halfords (4) - 2 freq self-hatred (4) - 1 freq airn-hard (4) - 1 freq hameward (4) - 13 freq kalahari (4) - 4 freq |
half-hard (0) - 2 freq hauf-heard (3) - 1 freq half-hid (3) - 1 freq half-hairted (4) - 1 freq half-hearted (4) - 1 freq half-mad (4) - 1 freq half-tirn (5) - 1 freq half-fairt (5) - 1 freq half-naked (5) - 1 freq half-deid (5) - 1 freq half-cauld (5) - 1 freq self-hatred (6) - 1 freq half-hidden (6) - 1 freq hauf-hour (6) - 3 freq half-hoidit (6) - 1 freq half-past (6) - 7 freq half-sa (6) - 1 freq halyard (6) - 1 freq hallvard (6) - 2 freq half-awa (6) - 2 freq hauf-mad (6) - 1 freq hauf-oor (7) - 8 freq hauf-deid (7) - 8 freq half-pint (7) - 1 freq half-wit (7) - 1 freq |
SoundEx code - H416 helper - 5 freq half-frozen - 1 freq hellfire - 4 freq half-hairted - 1 freq hell-fire - 1 freq helpers - 12 freq hallvard - 2 freq hellebore - 1 freq halliburton - 1 freq hill-forts - 1 freq halfords - 2 freq half-fairt - 1 freq help-yersel - 1 freq half-heartedly - 1 freq half-written - 1 freq hellyiefers - 1 freq halberd's - 1 freq halbert - 2 freq half-rotten - 1 freq half-hearted - 1 freq heliport - 2 freq halper - 2 freq half-hard - 2 freq hellyeifers - 1 freq hillberry - 1 freq holburn - 3 freq heilbronn - 3 freq |
MetaPhone code - HLFHRT half-hard - 2 freq |
HALF-HARD |
| Time to execute Levenshtein function - 0.223070 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.372979 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.032846 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.036699 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.000874 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. |