Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
newsround (0) - 1 freq new-fund (3) - 1 freq newsroom (3) - 1 freq versioun (4) - 1 freq aw-roond (4) - 2 freq newsmen (4) - 2 freq newborns (4) - 1 freq versiouns (4) - 1 freq aground (4) - 1 freq new-auld (4) - 2 freq nearhaund (4) - 16 freq ground (4) - 58 freq neeson (4) - 1 freq resounds (4) - 2 freq uyeasound (4) - 1 freq despond (4) - 1 freq round (4) - 122 freq respond (4) - 24 freq rebound (4) - 1 freq sound (4) - 174 freq runaround (4) - 1 freq newborn (4) - 11 freq wound (4) - 29 freq new-sprung (4) - 1 freq newsagent (4) - 2 freq |
newsround (0) - 1 freq newsroom (5) - 1 freq new-fund (5) - 1 freq newsins (6) - 4 freq newsan (6) - 2 freq newsagent (6) - 2 freq newsin (6) - 29 freq new-fand (6) - 1 freq rewerend (6) - 1 freq srund (6) - 1 freq newsed (6) - 6 freq unsound (6) - 1 freq newsing (6) - 1 freq newborn (6) - 11 freq newsmen (6) - 2 freq newborns (6) - 1 freq aw-roond (6) - 2 freq newtown (7) - 15 freq new-opened (7) - 1 freq newboarn (7) - 2 freq new-lined (7) - 1 freq nelson (7) - 8 freq newsnet (7) - 2 freq nevermind (7) - 1 freq gawstoun (7) - 3 freq |
SoundEx code - N265 newsroom - 1 freq 'necromancer' - 1 freq nicherin - 2 freq necromancers - 1 freq nazarene - 2 freq nickerin - 1 freq nose-rings - 1 freq nhsgrampian - 3 freq nigreenways - 1 freq nocarin - 1 freq nisreenalwan - 1 freq newsround - 1 freq nhqrn - 2 freq |
MetaPhone code - NSRNT newsround - 1 freq |
NEWSROUND |
Time to execute Levenshtein function - 0.185666 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.361970 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.033265 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.039903 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.000878 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. |