| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rivets (0) - 1 freq rivers (1) - 30 freq rivet (1) - 3 freq rives (1) - 4 freq nives (2) - 2 freq crivens (2) - 8 freq rivulets (2) - 1 freq riverse (2) - 1 freq reets (2) - 16 freq hives (2) - 2 freq richts (2) - 195 freq privet (2) - 9 freq ficets (2) - 1 freq raves (2) - 5 freq rifts (2) - 6 freq reivers (2) - 17 freq riveted (2) - 1 freq dives (2) - 7 freq rides (2) - 16 freq reives (2) - 2 freq wives (2) - 42 freq rises (2) - 42 freq rites (2) - 8 freq diverts (2) - 2 freq rits (2) - 1 freq |
rivets (0) - 1 freq rivet (2) - 3 freq rives (2) - 4 freq rivers (2) - 30 freq rites (3) - 8 freq divits (3) - 1 freq duvets (3) - 1 freq rivals (3) - 3 freq reives (3) - 2 freq rovers (3) - 23 freq ruives (3) - 2 freq riots (3) - 3 freq vets (3) - 9 freq ritts (3) - 1 freq rivit (3) - 2 freq rievers (3) - 1 freq rits (3) - 1 freq reivers (3) - 17 freq riverse (3) - 1 freq reets (3) - 16 freq rivulets (3) - 1 freq raivens (3) - 1 freq bovets (3) - 1 freq riveted (3) - 1 freq roves (3) - 1 freq |
SoundEx code - R132 rabbits - 29 freq rubbits - 14 freq rabbit's - 31 freq rafts - 3 freq rabbit-caught-in-a-set-aeheidlights - 1 freq repeatic - 1 freq rabbit's- - 2 freq repeats - 11 freq rifts - 6 freq rubbits' - 1 freq robots - 4 freq 'rabbit's - 3 freq robotic - 3 freq rapet's - 1 freq rubbit's - 2 freq robotik - 1 freq raifts - 1 freq rivets - 1 freq rapids - 1 freq rabdickson - 1 freq rbtkgsfa - 1 freq rpdzfctnuw - 1 freq |
MetaPhone code - RFTS rafts - 3 freq rights - 32 freq rifts - 6 freq righteous - 8 freq raifts - 1 freq rivets - 1 freq |
RIVETS |
| Time to execute Levenshtein function - 0.212135 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.392949 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.027488 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.040740 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.000889 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. |