| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ready-meals (0) - 1 freq ready-made (3) - 3 freq ready-het (4) - 1 freq beady-eyed (5) - 2 freq sea-maws (5) - 4 freq reader's (5) - 3 freq mid-meal (5) - 1 freq road-man (5) - 1 freq easy-peasy (5) - 4 freq readiness (5) - 1 freq redials (5) - 1 freq ream-calm (5) - 1 freq rammels (5) - 1 freq readies (5) - 3 freq red-coats (5) - 1 freq readers (5) - 88 freq radicals (5) - 7 freq deadbeats (5) - 1 freq reveals (5) - 10 freq leaf-muils (5) - 1 freq leaf-mools (5) - 1 freq rehersals (6) - 1 freq endtimes (6) - 2 freq rear-enn (6) - 1 freq reams (6) - 5 freq |
ready-meals (0) - 1 freq ready-made (5) - 3 freq rammels (7) - 1 freq red-coats (7) - 1 freq leaf-muils (7) - 1 freq redials (7) - 1 freq radicals (7) - 7 freq leaf-mools (7) - 1 freq mid-meal (7) - 1 freq road-man (7) - 1 freq ready-het (7) - 1 freq reveals (8) - 10 freq e-mails (8) - 6 freq rummels (8) - 2 freq redpolls (8) - 1 freq ream-calm (8) - 1 freq bed-claes (8) - 4 freq reader's (8) - 3 freq readies (8) - 3 freq sea-maws (8) - 4 freq readiness (8) - 1 freq readers (8) - 88 freq areadies (9) - 2 freq madame's (9) - 1 freq yad-fall (9) - 1 freq |
SoundEx code - R354 rational - 27 freq rationalised - 1 freq ratton-hole - 1 freq retinal - 1 freq ready-meals - 1 freq rationalized - 1 freq routinely - 4 freq rationale - 11 freq readin-lamps - 1 freq €œrationale - 1 freq rationalism - 1 freq €œrational - 1 freq rationales - 1 freq rationality - 1 freq rhodamiller - 7 freq |
MetaPhone code - RTMLS ready-meals - 1 freq |
READY-MEALS |
| Time to execute Levenshtein function - 0.216488 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.352806 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.028200 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.038055 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.000856 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. |