| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| radiant (0) - 5 freq radiance (2) - 1 freq valiant (2) - 5 freq rampant (2) - 11 freq radfan (2) - 1 freq variant (2) - 16 freq gradient (2) - 1 freq reliant (2) - 3 freq fabiani (3) - 5 freq paisant (3) - 1 freq ration (3) - 4 freq remant (3) - 1 freq rakit (3) - 4 freq daint (3) - 4 freq orcadian (3) - 51 freq radius (3) - 2 freq warrant (3) - 19 freq readien (3) - 1 freq radio (3) - 156 freq damian (3) - 2 freq earrant (3) - 1 freq asian (3) - 13 freq wadit (3) - 1 freq pacient (3) - 3 freq rantan (3) - 1 freq |
radiant (0) - 5 freq rodent (3) - 4 freq reliant (3) - 3 freq gradient (3) - 1 freq radiance (3) - 1 freq raidin (4) - 9 freq rydand (4) - 2 freq ruint (4) - 7 freq ordanit (4) - 3 freq roadit (4) - 6 freq roadin (4) - 87 freq ridin' (4) - 1 freq airnt (4) - 1 freq raedin (4) - 1 freq ridan (4) - 1 freq reident (4) - 2 freq readit (4) - 3 freq rydin (4) - 1 freq readin (4) - 366 freq raicent (4) - 34 freq ridin (4) - 59 freq redin (4) - 2 freq raiment (4) - 2 freq rint (4) - 4 freq didnt (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 - 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 |
RADIANT |
| Time to execute Levenshtein function - 0.194994 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.332998 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.027064 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.037117 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.000821 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. |