| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| representit (0) - 25 freq representin (1) - 12 freq represented (2) - 9 freq representan (2) - 2 freq reprentit (2) - 1 freq represents (2) - 18 freq repraisentit (2) - 2 freq representing (2) - 2 freq represent (2) - 29 freq presentit (2) - 24 freq preseentit (3) - 1 freq repentit (3) - 6 freq resentit (3) - 2 freq representars (3) - 1 freq preventit (3) - 2 freq presentin (3) - 5 freq replantit (4) - 1 freq present's (4) - 1 freq regrettit (4) - 3 freq presents- (4) - 1 freq reprent (4) - 2 freq prentit (4) - 81 freq 'present (4) - 1 freq present (4) - 213 freq apprehendit (4) - 1 freq |
representit (0) - 25 freq repraisentit (2) - 2 freq representin (2) - 12 freq presentit (3) - 24 freq represent (3) - 29 freq reprentit (3) - 1 freq representan (3) - 2 freq represents (3) - 18 freq represented (3) - 9 freq preseentit (4) - 1 freq representing (4) - 2 freq representative (5) - 20 freq representation (5) - 36 freq praisentit (5) - 8 freq raipresent (5) - 1 freq resentit (5) - 2 freq presentin (5) - 5 freq representars (5) - 1 freq preventit (5) - 2 freq repentit (5) - 6 freq percentit (6) - 1 freq presents (6) - 50 freq presently (6) - 3 freq representitives (6) - 1 freq presented (6) - 17 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 - 22 freq repressing - 1 freq representative - 20 freq representit - 25 freq represented - 9 freq reveries - 2 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 repress - 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 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 - RPRSNTT representit - 25 freq represented - 9 freq repraisentit - 2 freq |
REPRESENTIT |
| Time to execute Levenshtein function - 0.568054 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.839804 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.076393 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.085224 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.000885 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. |