Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
life-bocht (0) - 1 freq lifeboat (3) - 7 freq life-thochts (3) - 1 freq life-worn (4) - 1 freq life-forms (4) - 1 freq fife-born (4) - 1 freq lifeboats (4) - 2 freq life-cycle (4) - 1 freq life-bluid (4) - 2 freq mice-och (4) - 1 freq life-rent (4) - 1 freq life-wat (4) - 1 freq new-bocht (4) - 2 freq liecht (4) - 1 freq shap-bocht (4) - 1 freq life-blood (4) - 1 freq lifeboy (4) - 1 freq life-mate (5) - 1 freq five-inch (5) - 1 freq life-time (5) - 1 freq 'fecht (5) - 1 freq forethocht (5) - 4 freq is-och (5) - 1 freq linde-boom (5) - 1 freq lifejacket (5) - 1 freq |
life-bocht (0) - 1 freq lifeboat (6) - 7 freq new-bocht (6) - 2 freq life-thochts (6) - 1 freq life-wat (7) - 1 freq lead-licht (7) - 3 freq life-blood (7) - 1 freq life-rent (7) - 1 freq shap-bocht (7) - 1 freq liecht (7) - 1 freq self-tocht (7) - 1 freq life-cycle (7) - 1 freq life-bluid (7) - 2 freq bane-ticht (8) - 1 freq half-licht (8) - 1 freq lencht (8) - 4 freq lyfboat (8) - 1 freq feycht (8) - 1 freq love-light (8) - 1 freq firelicht (8) - 2 freq flocht (8) - 4 freq lamp-licht (8) - 1 freq wifie-but (8) - 1 freq licht (8) - 909 freq lecht (8) - 3 freq |
SoundEx code - L112 life-bocht - 1 freq love-bug - 1 freq lfebknjscj - 1 freq livifcofficial - 10 freq livifc - 2 freq |
MetaPhone code - LFBXT life-bocht - 1 freq |
LIFE-BOCHT |
Time to execute Levenshtein function - 0.214004 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.386497 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.034157 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.038176 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.001041 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. |