Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
relative (0) - 29 freq raelative (1) - 1 freq relatives (1) - 17 freq reactive (2) - 5 freq gelatine (2) - 2 freq relietive (2) - 1 freq sedative (2) - 1 freq creative (2) - 102 freq relate (2) - 18 freq relatively (2) - 7 freq relation (2) - 18 freq negative (2) - 41 freq relatin (2) - 9 freq restive (2) - 1 freq ralatives (2) - 1 freq relating (2) - 1 freq relive (2) - 1 freq relatit (2) - 34 freq creative' (3) - 1 freq reductive (3) - 1 freq talkative (3) - 2 freq recreative (3) - 1 freq negatives (3) - 3 freq realise (3) - 119 freq belteve (3) - 1 freq |
relative (0) - 29 freq raelative (1) - 1 freq relietive (2) - 1 freq relatives (2) - 17 freq ralatives (3) - 1 freq restive (3) - 1 freq relatit (3) - 34 freq relatin (3) - 9 freq relive (3) - 1 freq relation (3) - 18 freq reactive (3) - 5 freq relatively (3) - 7 freq relate (3) - 18 freq relates (4) - 4 freq relatioun (4) - 3 freq relieve (4) - 2 freq relatet (4) - 2 freq raelitie (4) - 2 freq relait (4) - 1 freq relativelie (4) - 1 freq belteve (4) - 1 freq realitie (4) - 2 freq related (4) - 31 freq creative (4) - 102 freq relating (4) - 1 freq |
SoundEx code - R431 relatives - 17 freq ralatives - 1 freq relatable - 3 freq relative - 29 freq relatievistic - 2 freq relietive - 1 freq relatively - 7 freq raelative - 1 freq relativelie - 1 freq rolled-up - 1 freq rolltop - 1 freq relativism - 1 freq relatives - 1 freq |
MetaPhone code - RLTF relative - 29 freq relietive - 1 freq raelative - 1 freq |
RELATIVE |
Time to execute Levenshtein function - 0.268414 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.426350 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.030689 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.042566 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.000866 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. |