| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relatively (0) - 7 freq relatives (2) - 16 freq relative (2) - 29 freq negatively (2) - 2 freq relativelie (2) - 1 freq creatively (2) - 4 freq relativism (3) - 1 freq reflexively (3) - 2 freq creativly (3) - 1 freq negitively (3) - 1 freq ralatives (3) - 1 freq relatives (3) - 1 freq raelative (3) - 1 freq reflectively (3) - 2 freq evasively (3) - 2 freq tentatively (3) - 3 freq relating (4) - 1 freq predicatively (4) - 1 freq relatiouns (4) - 1 freq derisively (4) - 1 freq restive (4) - 1 freq raivelt (4) - 20 freq respectively (4) - 2 freq routinely (4) - 4 freq delivery (4) - 49 freq |
relatively (0) - 7 freq relativelie (2) - 1 freq relatives (3) - 16 freq relative (3) - 29 freq ralatives (4) - 1 freq raelative (4) - 1 freq creatively (4) - 4 freq negatively (4) - 2 freq relietive (5) - 1 freq reflectively (5) - 2 freq relatable (5) - 3 freq negitively (5) - 1 freq relativism (5) - 1 freq reflexively (5) - 2 freq creativly (5) - 1 freq relates (6) - 4 freq lively (6) - 10 freq actively (6) - 14 freq raivel (6) - 3 freq relatioun (6) - 3 freq relation (6) - 18 freq related (6) - 28 freq relatin (6) - 9 freq positively (6) - 5 freq relatit (6) - 34 freq |
SoundEx code - R431 relatives - 16 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.197043 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.360187 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.026908 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.036563 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.000837 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. |