| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roberston (0) - 1 freq roberton (1) - 49 freq robertson (2) - 75 freq robeson (2) - 1 freq roberto (2) - 2 freq robroyston (3) - 1 freq robert's (3) - 4 freq robert (3) - 237 freq anderston (3) - 1 freq robson (3) - 14 freq roberts (3) - 1 freq roberto's (3) - 1 freq robertsons (3) - 1 freq oberon (3) - 1 freq robinson (3) - 22 freq bursten (4) - 1 freq version (4) - 143 freq bestow (4) - 1 freq peterson (4) - 2 freq briton (4) - 1 freq unnerstan (4) - 49 freq molestin (4) - 1 freq rogers (4) - 6 freq arkleston (4) - 1 freq peston (4) - 2 freq |
roberston (0) - 1 freq roberton (2) - 49 freq robroyston (3) - 1 freq roberto (4) - 2 freq robertson (4) - 75 freq robeson (4) - 1 freq bursten (5) - 1 freq burstin (5) - 40 freq robinson (5) - 22 freq rubenstein (5) - 1 freq burstan (5) - 1 freq robert (5) - 237 freq anderston (5) - 1 freq robson (5) - 14 freq roberts (5) - 1 freq arrestin (6) - 2 freq onerstaun (6) - 1 freq reversan (6) - 1 freq bilston (6) - 14 freq rostin (6) - 2 freq preston (6) - 8 freq roustin (6) - 1 freq torsten (6) - 1 freq roastin (6) - 21 freq liberation (6) - 3 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 - RBRSTN roberston - 1 freq robroyston - 1 freq |
ROBERSTON |
| Time to execute Levenshtein function - 0.191633 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.358599 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.027464 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.039641 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.000823 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. |