| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refters (0) - 1 freq rafters (1) - 11 freq reuters (1) - 6 freq refers (1) - 27 freq efters (1) - 1 freq merters (2) - 1 freq drifters (2) - 3 freq rafter (2) - 1 freq rioters (2) - 1 freq mesters (2) - 1 freq reciters (2) - 1 freq jesters (2) - 2 freq pelters (2) - 9 freq texters (2) - 1 freq efter (2) - 3150 freq reuter's (2) - 1 freq renders (2) - 2 freq reivers (2) - 17 freq peters (2) - 4 freq eaters (2) - 2 freq lecters (2) - 1 freq prefers (2) - 3 freq refer (2) - 37 freq peiters (2) - 1 freq reapers (2) - 2 freq |
refters (0) - 1 freq rafters (1) - 11 freq refers (2) - 27 freq efters (2) - 1 freq reuters (2) - 6 freq grafters (3) - 3 freq crofters (3) - 2 freq crafters (3) - 1 freq fters (3) - 1 freq reciters (3) - 1 freq rioters (3) - 1 freq afters (3) - 3 freq drifters (3) - 3 freq rafter (3) - 1 freq beaters (4) - 2 freq metters (4) - 8 freq festers (4) - 1 freq penters (4) - 2 freq cretters (4) - 8 freq heffers (4) - 1 freq aefter (4) - 4 freq efter- (4) - 1 freq 'efter (4) - 5 freq betters (4) - 6 freq roosters (4) - 3 freq |
SoundEx code - R136 riptur - 1 freq revedere - 1 freq rafters - 11 freq ruif-trees - 1 freq refters - 1 freq roof-tree - 1 freq ruptured - 1 freq rafter - 1 freq raptor - 1 freq raptur - 3 freq rabbit-horn - 1 freq ripture - 2 freq riptured - 8 freq riptures - 13 freq robotars - 1 freq rapture - 1 freq raptors - 1 freq rapturous - 1 freq robdrummond - 6 freq |
MetaPhone code - RFTRS rafters - 11 freq ruif-trees - 1 freq refters - 1 freq raughters - 3 freq |
REFTERS |
| Time to execute Levenshtein function - 0.202078 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.353876 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.027891 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.036983 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.000930 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. |