Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
relaxes (0) - 2 freq relates (1) - 4 freq relaxed (1) - 29 freq relayed (2) - 1 freq relies (2) - 1 freq replaces (2) - 1 freq raxes (2) - 29 freq relate (2) - 18 freq prelates (2) - 2 freq repares (2) - 1 freq relaxan (2) - 2 freq relays (2) - 2 freq related (2) - 31 freq relax (2) - 44 freq reflexes (2) - 1 freq relatet (2) - 2 freq relaxin (2) - 6 freq releases (2) - 3 freq relaxt (2) - 2 freq belles (3) - 1 freq elated (3) - 3 freq elbies (3) - 1 freq elses (3) - 1 freq regards (3) - 11 freq delayed (3) - 4 freq |
relaxes (0) - 2 freq relaxed (2) - 29 freq relates (2) - 4 freq reflexes (3) - 1 freq relax (3) - 44 freq relaxin (3) - 6 freq relaxt (3) - 2 freq relaxan (3) - 2 freq releases (3) - 3 freq relays (3) - 2 freq relies (3) - 1 freq raxes (3) - 29 freq relieves (4) - 2 freq realises (4) - 9 freq rollies (4) - 1 freq galaxies (4) - 8 freq royales (4) - 1 freq relics (4) - 6 freq release (4) - 20 freq rules (4) - 180 freq roles (4) - 12 freq rallies (4) - 7 freq realms (4) - 6 freq reliques (4) - 1 freq related (4) - 31 freq |
SoundEx code - R422 releegious - 24 freq realises - 9 freq religious - 51 freq rilke's - 1 freq releases - 3 freq religiously - 2 freq releejus - 1 freq releigious - 8 freq relaxes - 2 freq religiosity - 1 freq reliques - 1 freq relishes - 1 freq |
MetaPhone code - RLKSS relaxes - 2 freq |
RELAXES |
Time to execute Levenshtein function - 0.191769 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.383359 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.027406 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.041398 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.000941 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. |