| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| betrayed (0) - 7 freq bethrayed (1) - 2 freq retraced (2) - 1 freq strayed (2) - 8 freq berated (2) - 1 freq betray (2) - 10 freq betrayar (2) - 1 freq betrayal (2) - 7 freq betrayan (2) - 1 freq betrayers (2) - 1 freq betrays (2) - 1 freq ootraged (3) - 2 freq retrace (3) - 1 freq relayed (3) - 1 freq frayed (3) - 2 freq bereaved (3) - 2 freq erased (3) - 4 freq bearded (3) - 8 freq braved (3) - 1 freq beamed (3) - 6 freq serrated (3) - 1 freq bethray (3) - 2 freq beaded (3) - 1 freq hurrayed (3) - 1 freq bewaved (3) - 1 freq |
betrayed (0) - 7 freq bethrayed (2) - 2 freq betrayan (3) - 1 freq betrays (3) - 1 freq betrayal (3) - 7 freq betrayar (3) - 1 freq betray (3) - 10 freq strayed (3) - 8 freq braed (4) - 5 freq traed (4) - 5 freq borraed (4) - 8 freq bettered (4) - 4 freq beeried (4) - 14 freq tryed (4) - 3 freq berated (4) - 1 freq betrayers (4) - 1 freq retraced (4) - 1 freq detoured (5) - 2 freq butted (5) - 5 freq bothied (5) - 2 freq traid (5) - 3 freq beter (5) - 1 freq beard (5) - 57 freq baured (5) - 2 freq braird (5) - 3 freq |
SoundEx code - B363 bothert - 37 freq buttert - 7 freq bothert- - 1 freq butter'd - 1 freq betrothal - 1 freq bothered - 59 freq boatyaird - 1 freq bathert - 11 freq battered - 37 freq beetroot - 14 freq bathered - 8 freq buttered - 19 freq betrayed - 7 freq battert - 9 freq betteradjistit - 1 freq bedridden - 2 freq bethrayed - 2 freq buddered - 7 freq bettered - 4 freq bother't - 1 freq baithert - 1 freq bithert - 2 freq bed-ridden - 1 freq batthered - 1 freq butter't - 2 freq baitert - 1 freq boathered - 2 freq bettert - 2 freq beetruit - 1 freq betrothit - 1 freq butteret - 1 freq batterit - 1 freq betterthedeilyeken - 1 freq bithered - 2 freq botherd - 1 freq |
MetaPhone code - BTRYT betrayed - 7 freq |
BETRAYED |
| Time to execute Levenshtein function - 0.204071 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.353311 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.031455 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.037222 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.000936 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. |