| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ratty-lookin (0) - 1 freq nasty-lookin (2) - 1 freq sarky-lookin (3) - 1 freq nasty-looking (3) - 1 freq radge-lookin (3) - 2 freq waxy-lookin (3) - 1 freq daft-lookin (3) - 1 freq baitter-lookin (4) - 1 freq braw-lookin (4) - 4 freq bad-lookin (4) - 3 freq nazi-lookin (4) - 1 freq creepy-lookin (4) - 1 freq comfy-lookin (4) - 1 freq waxylookin (4) - 1 freq frail-lookin (4) - 1 freq rum-lookin (4) - 1 freq rough-lookin (4) - 1 freq bad-lookin' (5) - 1 freq gweed-lookin (5) - 1 freq freenly-lookin (5) - 1 freq fine-lookin (5) - 2 freq thrawn-lookin (5) - 1 freq queer-lookin (5) - 1 freq unco-lookin (5) - 1 freq oorie-lookin (5) - 1 freq |
ratty-lookin (0) - 1 freq nasty-lookin (4) - 1 freq radge-lookin (5) - 2 freq daft-lookin (5) - 1 freq baitter-lookin (6) - 1 freq rough-lookin (6) - 1 freq rum-lookin (6) - 1 freq sarky-lookin (6) - 1 freq nasty-looking (6) - 1 freq waxy-lookin (6) - 1 freq rattlin (7) - 52 freq daft-luikin (7) - 1 freq oorie-lookin (7) - 1 freq frail-lookin (7) - 1 freq bad-lookin (7) - 3 freq braw-lookin (7) - 4 freq creepy-lookin (7) - 1 freq nazi-lookin (7) - 1 freq comfy-lookin (7) - 1 freq prood-lookin (8) - 1 freq tough-lookin (8) - 1 freq ill-lookin (8) - 3 freq doon-lookin (8) - 1 freq hert-likin (8) - 4 freq guid-lookin (8) - 4 freq |
SoundEx code - R342 riddles - 9 freq ratty-lookin - 1 freq riddles-ti - 1 freq rattles - 11 freq ruitless - 2 freq retells - 1 freq ruthless - 7 freq retails - 1 freq riddles-ah - 1 freq rituals - 3 freq rattlestanes - 1 freq roit-like - 1 freq ruthlessly - 1 freq rattlesteens - 1 freq ritualistically - 1 freq rat-like - 1 freq radioloz - 3 freq rattlesnakes - 1 freq rattlecans - 2 freq redials - 1 freq |
MetaPhone code - RTLKN ratty-lookin - 1 freq |
RATTY-LOOKIN |
| Time to execute Levenshtein function - 0.323226 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.575413 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.027991 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.040640 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.000916 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. |