| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| radioleary (0) - 5 freq radiohead (3) - 1 freq radio-play (4) - 1 freq radioyazz (4) - 3 freq radioloz (4) - 3 freq railway (4) - 39 freq radioed (4) - 1 freq railcard (4) - 1 freq a-leary (4) - 1 freq raiglar (4) - 15 freq raigler (4) - 4 freq gaillery (4) - 1 freq caleery (5) - 2 freq airtery (5) - 1 freq misleart (5) - 1 freq paisley (5) - 61 freq radio- (5) - 1 freq bleary (5) - 7 freq traivlar (5) - 3 freq hillary (5) - 1 freq adultery (5) - 5 freq o'leary (5) - 1 freq dollar (5) - 12 freq ratier (5) - 1 freq reliquary (5) - 2 freq |
radioleary (0) - 5 freq raiglar (5) - 15 freq raigler (5) - 4 freq radioloz (5) - 3 freq radiohead (5) - 1 freq raider (6) - 1 freq roodery (6) - 1 freq readily (6) - 7 freq sadler (6) - 1 freq radar (6) - 11 freq raeler (6) - 1 freq ordinary (6) - 43 freq ridley (6) - 2 freq oardinary (6) - 3 freq dailer (6) - 1 freq ardler (6) - 1 freq regilar (6) - 1 freq radiator (6) - 10 freq railway (6) - 39 freq gaillery (6) - 1 freq a-leary (6) - 1 freq radioed (6) - 1 freq radioyazz (6) - 3 freq judiciary (7) - 2 freq deleer (7) - 1 freq |
SoundEx code - R346 rottweilers - 1 freq 'rottweiler - 1 freq rottweiler - 1 freq retailers - 3 freq radioleary - 5 freq retailer - 1 freq |
MetaPhone code - RTLR radioleary - 5 freq retailer - 1 freq |
RADIOLEARY |
| Time to execute Levenshtein function - 0.219597 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.424452 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.029619 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.049923 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.000994 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. |