Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
roberton (0) - 49 freq roberto (1) - 2 freq robertson (1) - 75 freq roberston (1) - 1 freq robert's (2) - 4 freq oberon (2) - 1 freq roberto's (2) - 1 freq robertsons (2) - 1 freq robert (2) - 238 freq robeson (2) - 1 freq roberts (2) - 1 freq beaton (3) - 35 freq soberen (3) - 1 freq orton (3) - 1 freq €˜roberto (3) - 2 freq umberto (3) - 1 freq merton (3) - 4 freq 'robert (3) - 1 freq barton (3) - 3 freq robertson's (3) - 5 freq revertin (3) - 2 freq ollerton (3) - 1 freq morton (3) - 30 freq bertson (3) - 1 freq alberto (3) - 2 freq |
roberton (0) - 49 freq roberston (2) - 1 freq robertson (2) - 75 freq roberto (2) - 2 freq robert (3) - 238 freq roberts (3) - 1 freq burton (4) - 2 freq roberto's (4) - 1 freq barton (4) - 3 freq revertin (4) - 2 freq robert's (4) - 4 freq robertsons (4) - 1 freq oberon (4) - 1 freq robeson (4) - 1 freq resortin (5) - 3 freq reborn (5) - 7 freq robroyston (5) - 1 freq wobertsin (5) - 1 freq norton (5) - 3 freq porton (5) - 1 freq warburton (5) - 1 freq liberation (5) - 3 freq reportin (5) - 15 freq liberatin (5) - 2 freq breton (5) - 5 freq |
SoundEx code - R163 robert - 238 freq reportin - 15 freq revertit - 4 freq repertoire - 8 freq report - 227 freq reporter - 23 freq reproduction - 3 freq reportit - 38 freq repoort - 1 freq robertson's - 5 freq robertson - 75 freq revered - 3 freq repartee - 2 freq reports - 42 freq revert - 4 freq rappered - 1 freq reproduce - 2 freq ripport's - 1 freq referred - 18 freq robert's - 4 freq repaired - 8 freq reported - 15 freq rupert - 17 freq rupert's - 2 freq 'robert - 1 freq referrit - 11 freq referrt - 1 freq reappeart - 4 freq reporters - 3 freq rebirth - 5 freq rhubard - 1 freq reportage - 2 freq rapportit - 1 freq rubbert - 2 freq reportin' - 2 freq report's - 2 freq roberto's - 1 freq reports- - 1 freq reporte - 1 freq reappeared - 1 freq robertsons - 1 freq raportit - 2 freq raport - 1 freq reproducin - 1 freq re-appearit - 1 freq €œrobert - 1 freq reproduced - 2 freq €˜roberto - 2 freq roberto - 2 freq reproducit - 1 freq revertin - 2 freq roberton - 49 freq reproductive - 3 freq €œrevered - 1 freq robertburns - 4 freq robertsonpaulc - 1 freq rupertmurdoch - 1 freq reporting - 2 freq robertmiggins - 102 freq refereed - 1 freq robertburnsqz - 1 freq robertburnsday - 1 freq robertburnsnts - 39 freq robertplant - 4 freq roberts - 1 freq reverted - 1 freq robroydfarmshop - 1 freq robertburnsfed - 9 freq robertliddell - 1 freq roberthmw - 1 freq robertreidalba - 3 freq reparations - 1 freq robertwulb - 3 freq robertgordonuni's - 1 freq robertsondawn - 1 freq reverting - 1 freq robertjames - 1 freq robertmdaws - 70 freq robertglen - 1 freq |
MetaPhone code - RBRTN roberton - 49 freq |
ROBERTON |
Time to execute Levenshtein function - 0.212242 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.350246 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.028608 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.038141 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.000962 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. |