| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relatives (0) - 17 freq relative (1) - 29 freq ralatives (1) - 1 freq negatives (2) - 3 freq relatives (2) - 1 freq relates (2) - 4 freq relatively (2) - 7 freq relations (2) - 14 freq relativism (2) - 1 freq creatives (2) - 6 freq raelative (2) - 1 freq relieves (3) - 2 freq restive (3) - 1 freq relietive (3) - 1 freq relatioun (3) - 3 freq reactive (3) - 5 freq polaties (3) - 1 freq gelatine (3) - 2 freq realities (3) - 9 freq felties (3) - 1 freq relatit (3) - 34 freq reives (3) - 2 freq resairves (3) - 2 freq realises (3) - 9 freq relativelie (3) - 1 freq |
relatives (0) - 17 freq ralatives (1) - 1 freq relative (2) - 29 freq relations (3) - 14 freq relativism (3) - 1 freq relatively (3) - 7 freq raelative (3) - 1 freq relates (3) - 4 freq negatives (4) - 3 freq realities (4) - 9 freq relativelie (4) - 1 freq relietive (4) - 1 freq relatiouns (4) - 1 freq relatives (4) - 1 freq creatives (4) - 6 freq relieves (4) - 2 freq relaetions (4) - 2 freq relation (5) - 18 freq related (5) - 31 freq laxatives (5) - 2 freq relating (5) - 1 freq natives (5) - 13 freq relive (5) - 1 freq latimes (5) - 1 freq relatin (5) - 9 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 - RLTFS relatives - 17 freq ralatives - 1 freq relatives - 1 freq |
RELATIVES |
| Time to execute Levenshtein function - 0.239475 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.570413 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.027682 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.068306 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.000891 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. |