| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ripture (0) - 2 freq riptured (1) - 8 freq rapture (1) - 1 freq riptur (1) - 1 freq riptures (1) - 13 freq picture (2) - 178 freq ruptured (2) - 1 freq caipture (2) - 4 freq mixture (2) - 26 freq raptur (2) - 3 freq capture (2) - 22 freq fixture (2) - 4 freq scripture (2) - 15 freq ripper (3) - 10 freq rigeur (3) - 1 freq scripturs (3) - 4 freq caipturs (3) - 1 freq picturt (3) - 2 freq couture (3) - 1 freq reptile (3) - 1 freq craiture (3) - 1 freq neptune (3) - 19 freq texture (3) - 9 freq pasture (3) - 11 freq naiture (3) - 4 freq |
ripture (0) - 2 freq rapture (1) - 1 freq riptur (1) - 1 freq riptured (2) - 8 freq raptur (2) - 3 freq riptures (2) - 13 freq capture (3) - 22 freq raptor (3) - 1 freq ruptured (3) - 1 freq caipture (3) - 4 freq retire (4) - 11 freq caiptur (4) - 1 freq raptors (4) - 1 freq riper (4) - 4 freq restore (4) - 9 freq reptile (4) - 1 freq captur (4) - 1 freq riter (4) - 1 freq repute (4) - 12 freq fixture (4) - 4 freq mixture (4) - 26 freq scripture (4) - 15 freq ripper (4) - 10 freq picture (4) - 178 freq pietures (5) - 1 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 - RPTR riptur - 1 freq raptor - 1 freq raptur - 3 freq ripture - 2 freq rapture - 1 freq |
RIPTURE |
| Time to execute Levenshtein function - 0.200662 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.421846 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.030057 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.037803 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.000928 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. |