| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rotations (0) - 1 freq rotation (1) - 1 freq novations (2) - 1 freq locations (2) - 9 freq rations (2) - 8 freq donations (2) - 2 freq quotations (2) - 12 freq stations (2) - 10 freq citations (2) - 3 freq relations (2) - 14 freq notation (2) - 1 freq relatiouns (3) - 1 freq rattons (3) - 34 freq lotions (3) - 1 freq raitions (3) - 1 freq gradations (3) - 1 freq ration (3) - 5 freq quotation' (3) - 1 freq quotation (3) - 19 freq rotates (3) - 2 freq situations (3) - 20 freq ations (3) - 1 freq promotions (3) - 1 freq jottins (3) - 1 freq privations (3) - 1 freq |
rotations (0) - 1 freq rotation (2) - 1 freq citations (3) - 3 freq rattons (3) - 34 freq rottens (3) - 1 freq stations (3) - 10 freq relations (3) - 14 freq rottans (3) - 7 freq rations (3) - 8 freq quotations (3) - 12 freq rattens (4) - 2 freq jottins (4) - 1 freq relaetions (4) - 2 freq rotting (4) - 1 freq reputations (4) - 1 freq retains (4) - 4 freq imitations (4) - 3 freq petitions (4) - 1 freq rattans (4) - 3 freq ructions (4) - 3 freq staetions (4) - 4 freq relatiouns (4) - 1 freq situations (4) - 20 freq notation (4) - 1 freq donations (4) - 2 freq |
SoundEx code - R335 rotation - 1 freq rhododendron - 3 freq radiatin - 3 freq road-widenin - 1 freq rhododendrons - 3 freq re-editin - 1 freq rhododenron - 1 freq radiation - 3 freq rotations - 1 freq radiating - 1 freq retweetin - 2 freq retwattin - 1 freq rideouttim - 1 freq retweeting - 1 freq |
MetaPhone code - RTXNS rotations - 1 freq |
ROTATIONS |
| Time to execute Levenshtein function - 0.264573 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.412055 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.027973 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.040668 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.001015 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. |