| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| betrayal (0) - 7 freq betrayar (1) - 1 freq betrayan (1) - 1 freq betray (2) - 10 freq betrays (2) - 1 freq betrayed (2) - 7 freq traal (3) - 1 freq strayan (3) - 1 freq metrical (3) - 1 freq portrayal (3) - 1 freq betrayers (3) - 1 freq bethrays (3) - 1 freq meerasyal (3) - 1 freq beryl (3) - 2 freq betrothal (3) - 1 freq bethrayed (3) - 2 freq bermeal (3) - 1 freq bethray (3) - 2 freq beerial (3) - 10 freq beerana (3) - 1 freq neteral (4) - 1 freq strata (4) - 4 freq raynal (4) - 1 freq betsy (4) - 42 freq bergman (4) - 2 freq |
betrayal (0) - 7 freq betrayan (2) - 1 freq betrayar (2) - 1 freq betrayed (3) - 7 freq betray (3) - 10 freq betrays (3) - 1 freq beerial (4) - 10 freq beryl (4) - 2 freq traal (4) - 1 freq neutral (5) - 17 freq beurla (5) - 1 freq trial (5) - 82 freq burial (5) - 12 freq natral (5) - 6 freq petrel (5) - 3 freq naetral (5) - 1 freq buirial (5) - 4 freq retiral (5) - 5 freq braali (5) - 27 freq braaly (5) - 42 freq otral (5) - 1 freq petrol (5) - 36 freq betrayers (5) - 1 freq bethrays (5) - 1 freq leetral (5) - 1 freq |
SoundEx code - B364 baitter-lookin - 1 freq buttérlumps - 1 freq better-like - 2 freq bitterly - 9 freq betrayal - 7 freq bedroll - 7 freq |
MetaPhone code - BTRYL betrayal - 7 freq |
BETRAYAL |
| Time to execute Levenshtein function - 0.193218 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.373495 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.029302 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.037999 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.000911 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. |