Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
renderings (0) - 1 freq rendering (1) - 1 freq renderins (1) - 3 freq renderin (2) - 5 freq wanderins (3) - 2 freq tenderin (3) - 2 freq enduring (3) - 1 freq renders (3) - 2 freq sinderins (3) - 3 freq windering (3) - 1 freq pondering (3) - 1 freq dundering (3) - 2 freq reddening (3) - 1 freq meandering (3) - 1 freq readings (3) - 4 freq wandering (3) - 3 freq entering (3) - 9 freq wondering (3) - 12 freq referin (4) - 1 freq fingering (4) - 1 freq rannerin (4) - 1 freq enders (4) - 2 freq senders (4) - 1 freq reed-ringed (4) - 1 freq daunderins (4) - 1 freq |
renderings (0) - 1 freq renderins (2) - 3 freq rendering (2) - 1 freq renderin (4) - 5 freq dundering (5) - 2 freq readings (5) - 4 freq pondering (5) - 1 freq wondering (5) - 12 freq wandering (5) - 3 freq meandering (5) - 1 freq windering (5) - 1 freq wanderins (5) - 2 freq renders (5) - 2 freq enduring (5) - 1 freq sinderins (5) - 3 freq ondings (6) - 1 freq inbrings (6) - 1 freq underdogs (6) - 3 freq tenderness (6) - 2 freq wanderans (6) - 1 freq rendirs (6) - 2 freq findings (6) - 4 freq sindrins (6) - 6 freq earrings (6) - 8 freq ordering (6) - 3 freq |
SoundEx code - R536 raindraps - 4 freq rain-watter - 1 freq renderin - 5 freq roonder - 4 freq roonder's - 1 freq roonders - 2 freq raindroaps - 2 freq render - 8 freq rainwatter - 4 freq rentier - 1 freq rendert - 3 freq reindeer - 15 freq ranter - 1 freq rendered - 5 freq raindrap - 1 freq 'rounder' - 1 freq renderins - 3 freq renderings - 1 freq re-introducin - 1 freq renders - 2 freq reintroduce - 1 freq rander - 2 freq rent-a-riot - 1 freq rain-draps - 1 freq rendering - 1 freq randert - 1 freq re-introducit - 1 freq rendirs - 2 freq rendir - 1 freq re-enter - 1 freq rinder - 1 freq re-entering - 1 freq rainwater - 1 freq reinterprete - 1 freq reindeer'll - 1 freq rounder - 1 freq reintroduction - 1 freq |
MetaPhone code - RNTRNKS renderings - 1 freq |
RENDERINGS |
Time to execute Levenshtein function - 0.396985 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.527731 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.067818 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.039821 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.000887 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. |