| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rebuttal (0) - 1 freq rebutted (2) - 1 freq resultat (3) - 1 freq regatta (3) - 4 freq resultan (3) - 1 freq refusal (3) - 2 freq neutral (3) - 17 freq regattas (3) - 1 freq refuisal (3) - 1 freq rental (3) - 9 freq rebattit (3) - 2 freq recital (3) - 1 freq outta (4) - 5 freq results (4) - 71 freq bottul (4) - 1 freq refull (4) - 1 freq resultin (4) - 7 freq reveal (4) - 21 freq remutved (4) - 1 freq gettan (4) - 39 freq burial (4) - 12 freq rebecca (4) - 16 freq celestal (4) - 1 freq reputable (4) - 3 freq resulted (4) - 1 freq |
rebuttal (0) - 1 freq rebutted (3) - 1 freq rebattit (4) - 2 freq rettle (5) - 1 freq battil (5) - 2 freq bottul (5) - 1 freq refettle (5) - 1 freq rattoal (5) - 1 freq orbital (5) - 3 freq bottil (5) - 6 freq recital (5) - 1 freq regatta (5) - 4 freq regattas (5) - 1 freq rattil (5) - 1 freq rental (5) - 9 freq bestial (6) - 1 freq ruttit (6) - 3 freq settl (6) - 1 freq spittal (6) - 1 freq rettie (6) - 1 freq butts (6) - 4 freq mettil (6) - 1 freq buttir (6) - 2 freq buttin (6) - 6 freq butt (6) - 20 freq |
SoundEx code - R134 revitalisin - 4 freq rabbit-hole - 9 freq rapidly - 17 freq refettle - 1 freq rabbit-hole-an - 1 freq rabbit-hol - 4 freq rabbit-holl - 3 freq reptile - 1 freq rebuttal - 1 freq robdelaney - 1 freq |
MetaPhone code - RBTL rebuttal - 1 freq |
REBUTTAL |
| Time to execute Levenshtein function - 0.238729 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.393943 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.027228 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.043416 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.001014 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. |