| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humourin (0) - 1 freq humours (2) - 1 freq honourin (2) - 2 freq humour (2) - 73 freq smourin (2) - 1 freq humour (2) - 1 freq smorin (3) - 5 freq clourin (3) - 1 freq hubberin (3) - 1 freq mourn (3) - 14 freq rumour's (3) - 3 freq smourit (3) - 4 freq housin (3) - 5 freq hoorin (3) - 3 freq savourin (3) - 7 freq hooerin (3) - 1 freq hammerin (3) - 18 freq outpourin (3) - 1 freq nurturin (3) - 2 freq glourin (3) - 1 freq hurrin (3) - 1 freq rumour (3) - 21 freq tumour (3) - 6 freq smoorin (3) - 10 freq hovrin (3) - 2 freq |
humourin (0) - 1 freq humour (3) - 73 freq smourin (3) - 1 freq honourin (3) - 2 freq humours (3) - 1 freq humor (4) - 1 freq hovrin (4) - 2 freq hurrin (4) - 1 freq hurin (4) - 1 freq smoorin (4) - 10 freq hemmerin (4) - 7 freq morin (4) - 2 freq hammerin (4) - 18 freq humpin (4) - 1 freq hummin (4) - 18 freq haimerin (4) - 1 freq smorin (4) - 5 freq hooerin (4) - 1 freq hoorin (4) - 3 freq humour (4) - 1 freq mourn (4) - 14 freq i'morn (5) - 6 freq hammeran (5) - 1 freq hairin (5) - 3 freq morn (5) - 389 freq |
SoundEx code - H565 haimmerin - 6 freq hinner-en - 25 freq hammerin - 18 freq hinnerend - 28 freq hinnereyn - 8 freq hinnerin - 2 freq honourin - 2 freq hinner-ens - 1 freq hemmerin - 7 freq hinnie-wairm - 1 freq hinner-end - 3 freq hinnermaist - 39 freq humourin - 1 freq hinneren - 44 freq hinnerein - 6 freq hinnerein's - 1 freq hinnèr-en - 1 freq hinnèrin - 1 freq hammeran - 1 freq hammermuggley - 1 freq haun-wringin - 2 freq hinnermost - 1 freq hinnerenn - 1 freq hinner-eyn - 1 freq hinneryen - 1 freq hinnerance - 1 freq hunner-an-siventy-odd - 1 freq hennerin - 1 freq hinnereine - 1 freq hunner-an-fowr-an-thritie - 1 freq han-ower-han - 1 freq haimerin - 1 freq homerange - 1 freq |
MetaPhone code - HMRN haimmerin - 6 freq hammerin - 18 freq hemmerin - 7 freq humourin - 1 freq hammeran - 1 freq haimerin - 1 freq |
HUMOURIN |
| Time to execute Levenshtein function - 0.281808 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.508566 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.035146 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.044279 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.001128 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. |