Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
rael-life (0) - 1 freq raellife (1) - 1 freq real-life (2) - 1 freq raellie (2) - 18 freq taen-like (3) - 3 freq raelie (3) - 3 freq wark-life (3) - 1 freq raelitie (3) - 2 freq raelative (3) - 1 freq true-life (3) - 1 freq raelise (3) - 4 freq rat-like (3) - 1 freq skellie (4) - 4 freq tramp-like (4) - 1 freq galilie (4) - 2 freq aerlie (4) - 10 freq pro-life (4) - 1 freq spae-wife (4) - 2 freq warl-wide (4) - 1 freq westlife (4) - 1 freq quaet-like (4) - 2 freq tae-time (4) - 1 freq ae-time (4) - 5 freq wildlife (4) - 15 freq gleg-like (4) - 1 freq |
rael-life (0) - 1 freq real-life (2) - 1 freq raellife (2) - 1 freq raellie (4) - 18 freq rat-like (5) - 1 freq wark-life (5) - 1 freq true-life (5) - 1 freq rallied (6) - 6 freq rollie (6) - 4 freq wilelife (6) - 2 freq mid-life (6) - 1 freq wildlife (6) - 15 freq rely-foe (6) - 1 freq rellin (6) - 1 freq roit-like (6) - 1 freq ideal-like (6) - 1 freq rallies (6) - 7 freq raelly (6) - 67 freq folklife (6) - 3 freq ferm-life (6) - 1 freq pro-life (6) - 1 freq raelitie (6) - 2 freq raelie (6) - 3 freq bairn-life (6) - 2 freq raelise (6) - 4 freq |
SoundEx code - R410 relief - 109 freq rileev - 1 freq rael-life - 1 freq rolf - 1 freq rely-foe - 1 freq raellife - 1 freq roll-up - 4 freq relive - 1 freq real-life - 1 freq ralph - 5 freq relieve - 2 freq rlffa - 1 freq rrlfyw - 1 freq |
MetaPhone code - RLLF rael-life - 1 freq real-life - 1 freq |
RAEL-LIFE |
Time to execute Levenshtein function - 0.200309 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.382300 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.028180 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.037703 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.000857 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. |