| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rodents (0) - 2 freq rodent (1) - 4 freq roddens (2) - 4 freq rents (2) - 11 freq relents (2) - 3 freq tridents (2) - 1 freq roberts (2) - 1 freq repents (2) - 2 freq odets (2) - 1 freq moments (2) - 42 freq rodden's (2) - 1 freq lozens (3) - 1 freq oens (3) - 1 freq ryders (3) - 1 freq parents (3) - 180 freq €”rents (3) - 1 freq lowdent (3) - 1 freq comments (3) - 65 freq repints (3) - 3 freq owen's (3) - 1 freq ripens (3) - 2 freq prents (3) - 10 freq owens (3) - 3 freq ovens (3) - 4 freq women's (3) - 9 freq |
rodents (0) - 2 freq rodent (2) - 4 freq tridents (3) - 1 freq relents (3) - 3 freq repents (3) - 2 freq rents (3) - 11 freq rants (4) - 6 freq residents (4) - 6 freq repints (4) - 3 freq runts (4) - 1 freq resydents (4) - 1 freq avedents (4) - 1 freq ardent (4) - 2 freq rudeness (4) - 3 freq reident (4) - 2 freq dunts (4) - 23 freq evidents (4) - 1 freq moments (4) - 42 freq rodden's (4) - 1 freq odets (4) - 1 freq roberts (4) - 1 freq roddens (4) - 4 freq dints (4) - 2 freq roadin's (4) - 7 freq roadins (4) - 3 freq |
SoundEx code - R353 road-end - 3 freq reid-haundit - 2 freq reidhaundit - 1 freq redeemed - 5 freq rithmatick - 3 freq readmitted - 1 freq readmittance - 1 freq rodent - 4 freq rodents - 2 freq reddened - 1 freq rationed - 4 freq ready-made - 3 freq radiant - 5 freq rid-haunded - 1 freq redundant - 5 freq reedened - 4 freq reid-haindit - 1 freq redundancy - 3 freq raeddened - 1 freq redeemit - 1 freq rydand - 2 freq redoundand - 1 freq reident - 2 freq rotund - 1 freq retained - 2 freq redandwhite - 1 freq redtintedglasses - 1 freq rtomdavies - 1 freq |
MetaPhone code - RTNTS rodents - 2 freq |
RODENTS |
| Time to execute Levenshtein function - 0.221974 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.390966 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.028114 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.037267 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.000855 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. |