| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| betrayar (0) - 1 freq betrayan (1) - 1 freq betrayal (1) - 7 freq betrayed (2) - 7 freq betrayers (2) - 1 freq betrays (2) - 1 freq betray (2) - 10 freq beerana (3) - 1 freq strayan (3) - 1 freq betaware (3) - 1 freq bethray (3) - 2 freq braar (3) - 1 freq bewaar (3) - 1 freq bethrayed (3) - 2 freq bethrays (3) - 1 freq baar (4) - 6 freq retraced (4) - 1 freq berate (4) - 1 freq brakkar (4) - 2 freq betterawa (4) - 3 freq beenawa (4) - 1 freq bewaur (4) - 15 freq braak (4) - 5 freq braer (4) - 1 freq betrump (4) - 1 freq |
betrayar (0) - 1 freq betrayal (2) - 7 freq betrayan (2) - 1 freq betrays (3) - 1 freq betray (3) - 10 freq betrayed (3) - 7 freq betrayers (3) - 1 freq bethray (4) - 2 freq braar (4) - 1 freq betaware (4) - 1 freq tetror (5) - 1 freq beater (5) - 11 freq braer (5) - 1 freq bearer (5) - 7 freq beter (5) - 1 freq beirer (5) - 1 freq briar (5) - 1 freq better (5) - 1704 freq bethrayed (5) - 2 freq bewaar (5) - 1 freq strayan (5) - 1 freq beerana (5) - 1 freq berr (5) - 2 freq bethrays (5) - 1 freq berry (5) - 17 freq |
SoundEx code - B366 butterworth - 5 freq 'butterworth - 1 freq butterworth's - 1 freq butterwort - 1 freq betrayers - 1 freq betrayar - 1 freq |
MetaPhone code - BTRYR betrayar - 1 freq |
BETRAYAR |
| Time to execute Levenshtein function - 0.226013 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.412367 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.028809 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.044380 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.001149 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. |