| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-day (1) - 1 freq haliday (2) - 1 freq halfway (2) - 7 freq half-sa (2) - 1 freq halloday (2) - 1 freq half-mad (2) - 1 freq half-wey (2) - 1 freq halfdan (2) - 5 freq halliday (2) - 1 freq half-day's (2) - 1 freq holy-day (2) - 1 freq hauf-way (2) - 1 freq holaeday (3) - 2 freq ae-day (3) - 1 freq yalday (3) - 1 freq halidays (3) - 1 freq hoaliday (3) - 16 freq half-hard (3) - 2 freq hauf-wey (3) - 4 freq half-wit (3) - 1 freq hauf-daft (3) - 1 freq daily-day (3) - 8 freq half-hid (3) - 1 freq haufway (3) - 3 freq hallway (3) - 12 freq |
hauf-day (2) - 1 freq half-wey (3) - 1 freq half-mad (3) - 1 freq holy-day (3) - 1 freq half-sa (3) - 1 freq half-wye (4) - 1 freq halloday (4) - 1 freq half-deid (4) - 1 freq half-awa (4) - 2 freq half-done (4) - 1 freq hauf-way (4) - 1 freq haliday (4) - 1 freq half-hid (4) - 1 freq halfdan (4) - 5 freq halliday (4) - 1 freq halfway (4) - 7 freq half-day's (4) - 1 freq holiday (5) - 152 freq hauf-mad (5) - 1 freq hallowday (5) - 1 freq holieday (5) - 1 freq halfa (5) - 2 freq hauf-wey (5) - 4 freq hoaliday (5) - 16 freq daily-day (5) - 8 freq |
SoundEx code - H413 helpit - 52 freq hole-bit - 1 freq helped - 92 freq halibut - 5 freq halved - 2 freq halfdemon-half-cherub - 1 freq halfdan - 5 freq halfdan's - 1 freq hallibit - 1 freq helpt - 9 freq half-eaten - 2 freq half-hidden - 1 freq helvetiscots - 1 freq halpt - 1 freq half-hoidit - 1 freq half-tirn - 1 freq half-deid - 1 freq halpit - 12 freq half-digested - 1 freq halped - 2 freq half-dön - 1 freq half-done - 1 freq half-böts - 1 freq half-thacket - 1 freq half-bottle - 1 freq half-day's - 1 freq half-hid - 1 freq half-wit - 1 freq €˜holo-videos - 1 freq half-dozen - 1 freq |
MetaPhone code - HLFT halved - 2 freq |
HALF-DAY |
| Time to execute Levenshtein function - 0.226930 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.397479 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.028075 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.039727 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.000995 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. |