| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rydand (0) - 2 freq rysand (1) - 1 freq bydand (1) - 1 freq rydin (2) - 1 freq roland (2) - 2 freq rypan (2) - 1 freq lyand (2) - 1 freq ridan (2) - 1 freq rdad (2) - 1 freq ryanp (2) - 3 freq eyland (2) - 2 freq riband (2) - 1 freq remand (2) - 2 freq rand (2) - 2 freq bydan (2) - 1 freq ryan (2) - 32 freq ryaan (2) - 8 freq €”and (3) - 8 freq raed (3) - 21 freq saand (3) - 13 freq regan (3) - 1 freq rypin (3) - 5 freq isiand (3) - 1 freq rans (3) - 1 freq road (3) - 1150 freq |
rydand (0) - 2 freq bydand (2) - 1 freq rysand (2) - 1 freq rdad (3) - 1 freq rand (3) - 2 freq ridan (3) - 1 freq riband (3) - 1 freq remand (3) - 2 freq roland (3) - 2 freq rydin (3) - 1 freq ridin (4) - 59 freq raymond (4) - 2 freq redded (4) - 2 freq wudend (4) - 1 freq rewind (4) - 3 freq randy (4) - 15 freq rotund (4) - 1 freq rudyard (4) - 2 freq rodd (4) - 90 freq gdnd (4) - 1 freq raedan (4) - 1 freq remaned (4) - 1 freq errand (4) - 5 freq rahnd (4) - 1 freq roond (4) - 955 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 |
RYDAND |
| Time to execute Levenshtein function - 0.218067 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.398323 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.034411 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.037641 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.000863 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. |