Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
reconcilit (0) - 3 freq reconcilin (1) - 2 freq reconciling (2) - 1 freq reconcil (2) - 1 freq reconcile (2) - 3 freq recoilin (3) - 1 freq recognisit (3) - 5 freq recoilt (3) - 2 freq reconnect (4) - 2 freq conceivit (4) - 1 freq relocatit (4) - 1 freq concreit (4) - 6 freq recordit (4) - 27 freq receivit (4) - 3 freq recitit (4) - 5 freq confidit (4) - 1 freq recleckit (4) - 1 freq reconin (4) - 1 freq concrait (4) - 1 freq conceitit (4) - 1 freq reconciliation (4) - 3 freq reuinitit (4) - 1 freq reconised (4) - 1 freq recognisin (4) - 8 freq recoil (4) - 3 freq |
reconcilit (0) - 3 freq reconcilin (2) - 2 freq reconcile (3) - 3 freq reconcil (3) - 1 freq reconciling (4) - 1 freq reconciliation (5) - 3 freq recoilt (5) - 2 freq concealt (6) - 1 freq conceit (6) - 22 freq recyclin (6) - 1 freq conceitit (6) - 1 freq recheckit (6) - 1 freq cancelt (6) - 3 freq recentlie (6) - 2 freq concedit (6) - 3 freq concait (6) - 6 freq recoontit (6) - 1 freq concrait (6) - 1 freq conceivit (6) - 1 freq concreit (6) - 6 freq recognisit (6) - 5 freq recleckit (6) - 1 freq recoilin (6) - 1 freq reconnect (6) - 2 freq concept (7) - 37 freq |
SoundEx code - R252 reasons - 80 freq rising - 14 freq raisons - 20 freq reconstructit - 1 freq rejoins - 1 freq raesons - 6 freq 'raisons - 1 freq raging - 3 freq richness - 6 freq raisins - 10 freq regenwhistie - 1 freq reckons - 8 freq reigns - 6 freq regions - 20 freq reconcilit - 3 freq reconcile - 3 freq raisin-cakes - 1 freq reaching - 5 freq rochness - 2 freq rouchness - 1 freq racing - 18 freq reconsider - 1 freq roughness - 1 freq risins - 2 freq reconised - 1 freq racking - 1 freq raising - 7 freq rauchness - 1 freq reconstructioun - 1 freq roushianes - 1 freq roussianes - 1 freq reconcilin - 2 freq raiseens - 1 freq ærkænchils - 1 freq re-connectin' - 1 freq re-connections - 1 freq reconciliation - 3 freq russians - 9 freq risking - 3 freq reasins - 1 freq raisonseen - 1 freq reconstruction - 2 freq reckonise - 1 freq risings - 2 freq reconsecratioun - 1 freq rosines - 1 freq reognise - 1 freq riggings - 1 freq reconstitute - 1 freq rocking - 2 freq reconcil - 1 freq rizzens - 1 freq rochians - 1 freq rissoms - 1 freq reconstructions - 1 freq reconneckin - 1 freq reconeck - 1 freq ruchness - 1 freq rushing - 2 freq rigging - 1 freq resins - 1 freq reconnect - 2 freq rasmussen - 1 freq rescuing - 1 freq rging - 1 freq rjkjcamkbv - 1 freq ricksons - 1 freq rekcnxmwsy - 1 freq rossmccrorie - 4 freq reconciling - 1 freq raking - 4 freq rqmxbrzsg - 1 freq racemochridhe - 1 freq rossmcnulty - 1 freq 'raging' - 1 freq rockness - 1 freq reeking - 1 freq rookshanks - 1 freq rossmc - 1 freq |
MetaPhone code - RKNSLT reconcilit - 3 freq |
RECONCILIT |
Time to execute Levenshtein function - 0.238723 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.469296 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.029040 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.038455 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.000774 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. |