| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rodent (0) - 4 freq rodents (1) - 2 freq rodeo (2) - 2 freq dozent (2) - 6 freq frozent (2) - 13 freq cogent (2) - 1 freq wident (2) - 2 freq ladent (2) - 1 freq eident (2) - 47 freq rodono (2) - 1 freq resent (2) - 3 freq eydent (2) - 20 freq robert (2) - 238 freq ardent (2) - 2 freq potent (2) - 6 freq modelt (2) - 1 freq opent (2) - 88 freq moment (2) - 231 freq roddit (2) - 1 freq rode (2) - 9 freq foment (2) - 2 freq royet (2) - 2 freq repent (2) - 17 freq rolment (2) - 1 freq regent (2) - 6 freq |
rodent (0) - 4 freq ardent (2) - 2 freq reident (2) - 2 freq rodents (2) - 2 freq rent (3) - 48 freq rooint (3) - 2 freq regent (3) - 6 freq recent (3) - 72 freq dent (3) - 4 freq trident (3) - 18 freq radiant (3) - 5 freq roddit (3) - 1 freq relent (3) - 5 freq repent (3) - 17 freq resent (3) - 3 freq eident (3) - 47 freq ladent (3) - 1 freq wident (3) - 2 freq eydent (3) - 20 freq rodono (3) - 1 freq reding (4) - 6 freq rydin (4) - 1 freq riding (4) - 12 freq aroont (4) - 1 freq doant (4) - 2 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 - RTNT road-end - 3 freq rodent - 4 freq reddened - 1 freq radiant - 5 freq reedened - 4 freq raeddened - 1 freq rydand - 2 freq reident - 2 freq rotund - 1 freq retained - 2 freq |
RODENT |
| Time to execute Levenshtein function - 0.212799 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.357553 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.031186 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.043456 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.000914 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. |