| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| radgelike (0) - 1 freq radge-like (1) - 1 freq raelise (3) - 4 freq cavelike (3) - 1 freq adeline (3) - 2 freq madeline (3) - 1 freq cadgy-like (3) - 1 freq radgie (3) - 10 freq saelike (3) - 3 freq angeline (3) - 7 freq saimelike (3) - 1 freq raelie (3) - 3 freq samelike (3) - 2 freq strangelike (3) - 1 freq rat-like (3) - 1 freq raggetie (3) - 1 freq ravelins (4) - 1 freq ravelin (4) - 3 freq namelie (4) - 3 freq daftlike (4) - 1 freq somelike (4) - 2 freq radged (4) - 1 freq gleg-like (4) - 1 freq doucelike (4) - 2 freq anglice (4) - 1 freq |
radgelike (0) - 1 freq radge-like (2) - 1 freq cadgy-like (5) - 1 freq rat-like (5) - 1 freq radgie (5) - 10 freq doucelike (6) - 2 freq radgest (6) - 2 freq radged (6) - 1 freq rangle (6) - 2 freq radges (6) - 1 freq dislike (6) - 6 freq radgio (6) - 1 freq raggle (6) - 207 freq radgey (6) - 1 freq odd-like (6) - 1 freq ringel-ee (6) - 1 freq roit-like (6) - 1 freq radge (6) - 44 freq kinglike (6) - 1 freq saelike (6) - 3 freq angeline (6) - 7 freq madeline (6) - 1 freq adeline (6) - 2 freq raelise (6) - 4 freq cavelike (6) - 1 freq |
SoundEx code - R324 radiculous - 1 freq ridiculous - 31 freq radical - 63 freq radge-lookin - 2 freq ridiculed - 4 freq ridiculousness - 2 freq rathclerish - 1 freq retical - 1 freq radicalism - 7 freq radicals - 7 freq riddochill - 1 freq radiecal - 1 freq radge-like - 1 freq ridicule - 7 freq rideeculas - 1 freq rideiculous - 2 freq rideiculas - 1 freq radgelike - 1 freq radicalised - 1 freq rideeculous - 2 freq €˜radical - 1 freq radikale - 1 freq rdicljpncb - 1 freq rteclare - 1 freq ridiculously - 2 freq radiosaltire - 5 freq ridiculous' - 1 freq roadkill - 1 freq radioclydenews - 1 freq roadkilled - 1 freq |
MetaPhone code - RJLK radge-like - 1 freq radgelike - 1 freq |
RADGELIKE |
| Time to execute Levenshtein function - 0.221432 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.394999 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.029364 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.039565 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.000885 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. |