| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roun-faced (0) - 1 freq rock-faced (2) - 1 freq torn-faced (2) - 4 freq din-faced (3) - 1 freq bold-faced (3) - 1 freq frug-faced (3) - 1 freq poe-faced (3) - 3 freq reed-faced (3) - 6 freq ridd-faced (3) - 2 freq reid-faced (3) - 3 freq rid-faced (3) - 4 freq green-faced (3) - 1 freq doun-fawen (3) - 1 freq toarn-faced (3) - 1 freq soor-faced (3) - 4 freq lang-faced (4) - 4 freq sham-faced (4) - 1 freq toun-bred (4) - 3 freq blae-faced (4) - 2 freq grim-faced (4) - 2 freq sun-baked (4) - 1 freq baa-faced (4) - 1 freq surfaced (4) - 3 freq langfaced (4) - 1 freq dounloaded (4) - 2 freq |
roun-faced (0) - 1 freq torn-faced (3) - 4 freq reid-faced (4) - 3 freq rid-faced (4) - 4 freq toarn-faced (4) - 1 freq reed-faced (4) - 6 freq green-faced (4) - 1 freq din-faced (4) - 1 freq rock-faced (4) - 1 freq soor-faced (5) - 4 freq frug-faced (5) - 1 freq ridd-faced (5) - 2 freq poe-faced (5) - 3 freq baw-faced (6) - 1 freq bare-faced (6) - 4 freq fite-faced (6) - 1 freq fair-faced (6) - 3 freq wart-faced (6) - 2 freq girnan-faced (6) - 1 freq steen-faced (6) - 1 freq stern-faced (6) - 1 freq twa-faced (6) - 3 freq resurfaced (6) - 2 freq twae-faced (6) - 1 freq girnie-faced (6) - 1 freq |
SoundEx code - R512 rampaging - 1 freq rampage - 3 freq roun-faced - 1 freq rampaged - 1 freq ramfoozled - 1 freq rampagin - 5 freq rainbows - 2 freq rumpus - 1 freq ramfeezled - 3 freq ramfeezlin - 2 freq rambust - 1 freq ramfoozle - 1 freq ramps - 2 freq removes - 2 freq ramfoozelt - 1 freq reinvigorate - 1 freq ramfeizilt - 1 freq rainbow's - 1 freq rinpoche - 8 freq rinpoche's - 1 freq 'rinpoche - 1 freq ramifications - 4 freq reinvigoratin - 1 freq rnifhksrsx - 1 freq rainbowsr - 6 freq rainfuckof - 1 freq reunification - 1 freq rainbows' - 1 freq |
MetaPhone code - RNFST roun-faced - 1 freq |
ROUN-FACED |
| Time to execute Levenshtein function - 0.238421 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.441927 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.030502 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.046692 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.001029 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. |