| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ruptured (0) - 1 freq riptured (1) - 8 freq naptured (2) - 1 freq cultured (2) - 3 freq captured (2) - 30 freq rapture (2) - 1 freq nurtured (2) - 5 freq riptures (2) - 13 freq upturned (2) - 7 freq ripture (2) - 2 freq nurture (3) - 5 freq upthrew (3) - 1 freq gestured (3) - 13 freq riptur (3) - 1 freq captered (3) - 1 freq unturned (3) - 3 freq culture' (3) - 3 freq ruited (3) - 4 freq featured (3) - 9 freq natured (3) - 2 freq captures (3) - 3 freq repruved (3) - 1 freq culture (3) - 442 freq upturnt (3) - 8 freq capture (3) - 22 freq |
ruptured (0) - 1 freq riptured (1) - 8 freq ripture (3) - 2 freq rapture (3) - 1 freq riptures (3) - 13 freq captured (3) - 30 freq naptured (3) - 1 freq recaptured (4) - 3 freq retoured (4) - 14 freq rappered (4) - 1 freq erupted (4) - 8 freq caiptured (4) - 1 freq retired (4) - 42 freq repaired (4) - 8 freq enraptured (4) - 1 freq riptur (4) - 1 freq upturned (4) - 7 freq nurtured (4) - 5 freq cultured (4) - 3 freq raptur (4) - 3 freq restored (4) - 11 freq captered (4) - 1 freq buttered (5) - 19 freq rutted (5) - 1 freq uttered (5) - 10 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 - RPTRT ruptured - 1 freq riptured - 8 freq |
RUPTURED |
| Time to execute Levenshtein function - 0.249153 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.427842 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.029778 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.039221 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.001031 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. |