| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rotund (0) - 1 freq round (1) - 122 freq roond (2) - 955 freq mound (2) - 8 freq rouns (2) - 4 freq bound (2) - 58 freq rotted (2) - 1 freq around (2) - 158 freq wound (2) - 29 freq refund (2) - 3 freq rottid (2) - 1 freq roun (2) - 329 freq rostand (2) - 1 freq found (2) - 223 freq roland (2) - 2 freq ground (2) - 58 freq rund (2) - 2 freq yotun (2) - 9 freq rotad (2) - 2 freq sound (2) - 174 freq pound (2) - 129 freq roun' (2) - 6 freq rounds (2) - 9 freq hound (2) - 11 freq rooond (2) - 1 freq |
rotund (0) - 1 freq round (2) - 122 freq rottid (3) - 1 freq rostand (3) - 1 freq rund (3) - 2 freq rotad (3) - 2 freq rooond (3) - 1 freq roland (3) - 2 freq refund (3) - 3 freq around (3) - 158 freq roond (3) - 955 freq rotted (3) - 1 freq stand (4) - 199 freq rend (4) - 2 freq tend (4) - 56 freq refound (4) - 1 freq ratin (4) - 1 freq rand (4) - 2 freq staund (4) - 107 freq rootin' (4) - 1 freq stend (4) - 1 freq rebound (4) - 1 freq extend (4) - 9 freq rutted (4) - 1 freq tuned (4) - 8 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 |
ROTUND |
| Time to execute Levenshtein function - 0.302196 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.586673 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.031062 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.071811 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.000888 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. |