| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| betrayers (0) - 1 freq betrays (2) - 1 freq betrayed (2) - 7 freq betrayar (2) - 1 freq betrayal (3) - 7 freq travers (3) - 4 freq betrayan (3) - 1 freq beakers (3) - 1 freq prayers (3) - 59 freq traders (3) - 5 freq bethrayed (3) - 2 freq beaters (3) - 2 freq bearers (3) - 5 freq bethrays (3) - 1 freq beavers (3) - 2 freq betray (3) - 10 freq bemoaners (3) - 1 freq betters (3) - 6 freq tasers (4) - 1 freq retrace (4) - 1 freq frasers (4) - 2 freq beholders (4) - 2 freq bernys (4) - 1 freq trailers (4) - 1 freq trawlers (4) - 4 freq |
betrayers (0) - 1 freq betrays (3) - 1 freq betrayar (3) - 1 freq bearers (4) - 5 freq bethrays (4) - 1 freq beaters (4) - 2 freq betters (4) - 6 freq betrayed (4) - 7 freq bettirs (5) - 1 freq batters (5) - 8 freq beakers (5) - 1 freq biters (5) - 2 freq briers (5) - 2 freq barriers (5) - 6 freq berries (5) - 26 freq barraes (5) - 6 freq bothers (5) - 9 freq bathers (5) - 2 freq breers (5) - 6 freq triers (5) - 2 freq travers (5) - 4 freq betrayal (5) - 7 freq betrayan (5) - 1 freq bethrayed (5) - 2 freq prayers (5) - 59 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 - BTRYRS betrayers - 1 freq |
BETRAYERS |
| Time to execute Levenshtein function - 0.226747 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.426468 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.028259 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.038713 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.000889 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. |