Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
resurrected (0) - 4 freq resurrect (2) - 3 freq resurrectit (2) - 2 freq respected (3) - 11 freq resurreckit (3) - 6 freq resurfaced (3) - 2 freq restricted (3) - 1 freq resurrection (3) - 14 freq resurtectin (3) - 1 freq resurrections (4) - 1 freq resented (4) - 1 freq 'resurreckit (4) - 2 freq resurface (4) - 1 freq erected (4) - 3 freq regretted (4) - 4 freq subjected (4) - 4 freq restarted (4) - 1 freq resourced (4) - 10 freq resulted (4) - 1 freq suspected (4) - 7 freq requested (4) - 4 freq reflected (4) - 11 freq rejected (4) - 7 freq researched (4) - 2 freq respectet (4) - 1 freq |
resurrected (0) - 4 freq resurrectit (3) - 2 freq resurrect (3) - 3 freq restricted (4) - 1 freq resurrection (4) - 14 freq resurtectin (5) - 1 freq resurfaced (5) - 2 freq resurreckit (5) - 6 freq respected (5) - 11 freq restarted (6) - 1 freq resourced (6) - 10 freq researched (6) - 2 freq resurrections (6) - 1 freq resorted (6) - 3 freq resairched (6) - 1 freq corrected (6) - 11 freq distracted (7) - 12 freq resurgent (7) - 1 freq structed (7) - 1 freq serrated (7) - 1 freq restrict (7) - 1 freq insurrection (7) - 2 freq reciprocated (7) - 1 freq perfected (7) - 1 freq restrictit (7) - 4 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 - 8 freq recourse - 2 freq regression's - 1 freq research - 165 freq resource - 68 freq regressive - 2 freq regurgitatit - 1 freq rashers - 1 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 reassures - 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 - RSRKTT resurrectit - 2 freq resurrected - 4 freq |
RESURRECTED |
Time to execute Levenshtein function - 0.227133 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.374347 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.027517 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.036970 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.000799 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. |