| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cautioner (0) - 1 freq caution (2) - 9 freq cautionary (2) - 2 freq cautions (2) - 1 freq portioner (3) - 4 freq cautious (3) - 8 freq captions (3) - 1 freq cautrine (3) - 3 freq caption (3) - 1 freq auctioneer (3) - 2 freq rationed (3) - 4 freq raitions (4) - 1 freq captioun (4) - 1 freq caudron (4) - 1 freq dauntoned (4) - 1 freq mintioned (4) - 2 freq cartowes (4) - 1 freq cantilever (4) - 1 freq causie (4) - 8 freq out-ower (4) - 1 freq carton (4) - 7 freq carrier (4) - 15 freq stationers (4) - 1 freq atower (4) - 1 freq caledones (4) - 1 freq |
cautioner (0) - 1 freq cautionary (2) - 2 freq cautions (3) - 1 freq auctioneer (3) - 2 freq caution (3) - 9 freq dictionar (5) - 95 freq container (5) - 6 freq cuter (5) - 1 freq capener (5) - 36 freq aftner (5) - 1 freq toner (5) - 1 freq unctioneer (5) - 2 freq auctioneers (5) - 1 freq canner (5) - 1 freq coroner (5) - 3 freq actions (5) - 49 freq mutineer (5) - 1 freq executioner (5) - 27 freq auction (5) - 3 freq cuiter (5) - 1 freq crooner (5) - 4 freq caption (5) - 1 freq rationed (5) - 4 freq cannier (5) - 1 freq cautrine (5) - 3 freq |
SoundEx code - C356 cautionary - 2 freq catamaran - 1 freq cautioner - 1 freq |
MetaPhone code - KXNR cautionary - 2 freq cautioner - 1 freq |
CAUTIONER |
| Time to execute Levenshtein function - 0.212990 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.371449 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.028845 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.042208 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.000944 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. |