| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| relatievistic (0) - 2 freq relativism (4) - 1 freq relatives (5) - 17 freq polytheistic (5) - 1 freq relatiounship (5) - 2 freq realistic (5) - 8 freq relievit (5) - 1 freq relatives (5) - 1 freq evangelistic (5) - 1 freq relativelie (5) - 1 freq relationship (5) - 48 freq atheistic (5) - 1 freq atavistic (5) - 1 freq militaristic (6) - 1 freq solipsistic (6) - 1 freq taikenistic (6) - 1 freq relationship' (6) - 2 freq nepotistic (6) - 1 freq relations (6) - 14 freq negativity (6) - 7 freq raisistin (6) - 1 freq 'relationship (6) - 1 freq relatiouns (6) - 1 freq relieves (6) - 2 freq relative (6) - 29 freq |
relatievistic (0) - 2 freq relativism (6) - 1 freq relatives (7) - 1 freq realistic (7) - 8 freq atavistic (7) - 1 freq polytheistic (7) - 1 freq relatives (7) - 17 freq militaristic (8) - 1 freq ralatives (8) - 1 freq relatiounship (8) - 2 freq airtistic (8) - 8 freq altruistic (8) - 1 freq atheistic (8) - 1 freq relievit (8) - 1 freq relativelie (8) - 1 freq relationship (8) - 48 freq relievt (9) - 1 freq relatet (9) - 2 freq relates (9) - 4 freq relatit (9) - 34 freq relatively (9) - 7 freq elestic (9) - 2 freq fatalistic (9) - 3 freq optimistic (9) - 11 freq statistic (9) - 6 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 - RLTFSTK relatievistic - 2 freq |
RELATIEVISTIC |
| Time to execute Levenshtein function - 0.288978 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.507571 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.031152 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.041150 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.001182 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. |