Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
reprocessed (0) - 1 freq repressed (2) - 2 freq processed (2) - 8 freq processes (3) - 20 freq repossessed (3) - 2 freq depressed (3) - 16 freq replaessed (3) - 1 freq regressed (3) - 1 freq professed (3) - 3 freq unpressed (4) - 1 freq repress (4) - 1 freq process (4) - 118 freq recesses (4) - 4 freq posessed (4) - 1 freq processin (4) - 4 freq pressed (4) - 74 freq refreshed (4) - 2 freq supressed (4) - 1 freq promeesed (4) - 1 freq protested (4) - 9 freq professer (4) - 5 freq processor (4) - 5 freq oppressed (4) - 5 freq proceeded (4) - 3 freq impressed (4) - 51 freq |
reprocessed (0) - 1 freq processed (3) - 8 freq repressed (3) - 2 freq professed (5) - 3 freq replaessed (5) - 1 freq regressed (5) - 1 freq depressed (5) - 16 freq processes (5) - 20 freq repossessed (5) - 2 freq repressin (6) - 2 freq supressed (6) - 1 freq empressed (6) - 1 freq pressed (6) - 74 freq processor (6) - 5 freq impressed (6) - 51 freq repress (6) - 1 freq unpressed (6) - 1 freq oppressed (6) - 5 freq process (6) - 118 freq expressed (6) - 22 freq processin (6) - 4 freq proceed (7) - 10 freq practised (7) - 11 freq progressed (7) - 4 freq repressive (7) - 1 freq |
SoundEx code - R162 rivers - 30 freq refreshments - 7 freq repressed - 2 freq riverside - 4 freq ruifers - 1 freq reivers - 17 freq river's - 7 freq repercussions - 5 freq representatives - 13 freq reverse - 21 freq repressing - 1 freq representative - 20 freq representit - 25 freq represented - 9 freq reveries - 1 freq refreshment - 6 freq represents - 18 freq represent - 29 freq repressin - 2 freq reversed - 4 freq rypers - 1 freq ripper's - 4 freq refreshed - 2 freq riverse - 1 freq repairs - 6 freq refreshing - 4 freq refresh - 2 freq reversible - 1 freq refers - 27 freq representation - 36 freq rubber-stampin - 1 freq representin - 12 freq repressive - 1 freq representatives' - 1 freq reversin - 4 freq referees - 2 freq reverses - 1 freq robbers - 7 freq robberies - 2 freq reviewers - 3 freq reapers - 2 freq rovers - 23 freq reaper's - 2 freq representing - 2 freq representars - 1 freq refractin - 1 freq rover's - 1 freq refraishit - 2 freq repraisentit - 2 freq refractors - 2 freq reprogrammed - 1 freq 'reivers - 1 freq refreshin - 6 freq refracts - 1 freq representan - 2 freq reversan - 1 freq rapurs - 2 freq reprise - 1 freq representations - 6 freq representational - 1 freq rovers' - 1 freq refractit - 1 freq repression - 3 freq rievers - 1 freq 'representational' - 1 freq representatioun - 2 freq reivers' - 1 freq reprocessed - 1 freq refraish - 1 freq representautiouns - 1 freq refraisched - 1 freq refraischin - 1 freq repares - 1 freq refreshes - 1 freq representitives - 1 freq reprisal - 1 freq repress - 1 freq refreshinly - 1 freq reproach - 2 freq roberston - 1 freq raipresent - 1 freq roooveeers - 1 freq rubbers - 1 freq reversal - 1 freq revrichardcoles - 2 freq refreshingly - 1 freq re-freezes - 1 freq robroyston - 1 freq rayforsyth - 6 freq rephrase - 1 freq riversidempcc - 1 freq |
MetaPhone code - RPRSST reprocessed - 1 freq |
REPROCESSED |
Time to execute Levenshtein function - 0.261359 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.445563 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.027445 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.036903 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.000814 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. |