| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relatively (0) - 7 freq negatively (2) - 2 freq relatives (2) - 17 freq relativelie (2) - 1 freq creatively (2) - 5 freq relative (2) - 29 freq raelative (3) - 1 freq relativism (3) - 1 freq relatives (3) - 1 freq tentatively (3) - 4 freq evasively (3) - 2 freq negitively (3) - 1 freq creativly (3) - 1 freq reflexively (3) - 2 freq reflectively (3) - 2 freq ralatives (3) - 1 freq repeatitly (4) - 2 freq creative (4) - 102 freq relive (4) - 1 freq actively (4) - 14 freq retroactively (4) - 1 freq reactive (4) - 5 freq relatioun (4) - 3 freq raivelt (4) - 20 freq entirely (4) - 31 freq |
relatively (0) - 7 freq relativelie (2) - 1 freq relative (3) - 29 freq relatives (3) - 17 freq negatively (4) - 2 freq ralatives (4) - 1 freq raelative (4) - 1 freq creatively (4) - 5 freq reflexively (5) - 2 freq relatable (5) - 3 freq creativly (5) - 1 freq reflectively (5) - 2 freq negitively (5) - 1 freq relietive (5) - 1 freq relativism (5) - 1 freq positively (6) - 5 freq reliably (6) - 1 freq routinely (6) - 4 freq remotely (6) - 3 freq relation (6) - 18 freq relatet (6) - 2 freq relatin (6) - 9 freq raivel (6) - 3 freq creativelie (6) - 1 freq lately (6) - 57 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 - RLTFL relatively - 7 freq relativelie - 1 freq |
RELATIVELY |
| Time to execute Levenshtein function - 0.294133 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.523459 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.043807 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.049904 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.001098 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. |