Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
researchin (0) - 2 freq researchit (1) - 1 freq researchan (1) - 1 freq researcher (2) - 3 freq resairchin (2) - 1 freq research' (2) - 1 freq searchin (2) - 26 freq researched (2) - 2 freq researches (2) - 1 freq research (2) - 166 freq 'research' (3) - 1 freq searching (3) - 2 freq resourcin (3) - 5 freq beseechin (3) - 2 freq reseirch (3) - 2 freq seatchin (3) - 1 freq rewatchin (3) - 1 freq researchers (3) - 8 freq 'research (3) - 2 freq rehearsin (3) - 2 freq seirchin (3) - 1 freq reachin (3) - 32 freq reserrin (3) - 1 freq rersearch (3) - 1 freq reservin (3) - 1 freq |
researchin (0) - 2 freq researchan (1) - 1 freq resairchin (2) - 1 freq researchit (2) - 1 freq research (3) - 166 freq researches (3) - 1 freq researched (3) - 2 freq researcher (3) - 3 freq research' (3) - 1 freq searchin (3) - 26 freq resourcin (4) - 5 freq seirchin (4) - 1 freq reseirch (4) - 2 freq resairch (5) - 12 freq reservin (5) - 1 freq resaerch (5) - 1 freq seyrchen (5) - 1 freq rersearch (5) - 1 freq sairchin (5) - 3 freq resairches (5) - 2 freq resairched (5) - 1 freq reserrin (5) - 1 freq searching (5) - 2 freq seatchin (5) - 1 freq researchers (5) - 8 freq |
SoundEx code - R262 rogers - 6 freq roger's - 2 freq resources - 219 freq resurrection - 14 freq resurreckit - 6 freq 'resurreckit - 2 freq resurrections - 1 freq requires - 10 freq recourse - 2 freq regression's - 1 freq research - 166 freq resource - 68 freq regressive - 2 freq regurgitatit - 1 freq rashers - 1 freq resurrectin - 1 freq reassures - 2 freq rosaries - 3 freq resurrectit - 2 freq razir-sharp - 1 freq researchers - 8 freq resource-rich - 1 freq resurrected - 4 freq resairch - 12 freq 'resurrectionists' - 1 freq resurrectionists - 3 freq resurrect - 3 freq resairchin - 1 freq resourcin - 5 freq researched - 2 freq resoorces - 20 freq research' - 1 freq regurgitated - 1 freq reserrs - 1 freq racers - 1 freq regress - 1 freq rookery's - 1 freq razors - 3 freq 'research - 2 freq resourced - 10 freq recoorse - 1 freq resourcin' - 4 freq researchin - 2 freq ryegress - 1 freq razor-shairp - 2 freq razor-sherp - 1 freq resaerch - 1 freq researcher - 3 freq researchit - 1 freq researches - 1 freq €œresource - 2 freq resairched - 1 freq rowesgirss - 1 freq 'rigors' - 1 freq rescours - 3 freq rescoursed - 4 freq resoorce - 4 freq reseirch - 2 freq reaggregit - 1 freq resurgence - 6 freq re-crystalised - 1 freq resairches - 2 freq recharging - 2 freq resourceful - 1 freq regressin - 2 freq researchan - 1 freq 'rosaries - 1 freq rozzers - 1 freq €œrogerisms - 1 freq resairchers - 1 freq rescuers - 2 freq resoorce-rich - 1 freq rigorously - 1 freq resurgent - 1 freq regressed - 1 freq recharge - 1 freq rkrzttdps - 1 freq rickywarwick - 2 freq rxruc - 1 freq rigorous - 1 freq rocher's - 1 freq rickwrightnow - 1 freq rickyaross - 15 freq rogerquimbly - 1 freq rsrhighlander - 9 freq rakers - 1 freq 'research' - 1 freq ruggers - 1 freq |
MetaPhone code - RSRXN resairchin - 1 freq researchin - 2 freq researchan - 1 freq |
RESEARCHIN |
Time to execute Levenshtein function - 0.220677 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.385148 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.031231 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.037634 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.000918 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. |