Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
roonders (0) - 2 freq foonders (1) - 2 freq roonder's (1) - 1 freq roonder (1) - 4 freq tooners (2) - 1 freq pooders (2) - 3 freq toonsers (2) - 6 freq foondert (2) - 8 freq roondness (2) - 1 freq booncers (2) - 2 freq roosters (2) - 3 freq soonder (2) - 1 freq roonded (2) - 13 freq roondest (2) - 2 freq founders (2) - 1 freq floonders (2) - 1 freq roodery (2) - 1 freq crooners (2) - 2 freq dooners (2) - 2 freq boolders (2) - 8 freq foongers (2) - 1 freq brooders (2) - 1 freq pounders (2) - 2 freq wonders (2) - 5 freq renders (2) - 2 freq |
roonders (0) - 2 freq roonder (2) - 4 freq renders (2) - 2 freq roonder's (2) - 1 freq foonders (2) - 2 freq wonders (3) - 5 freq pounders (3) - 2 freq roonds (3) - 8 freq sounders (3) - 2 freq ponders (3) - 3 freq founders (3) - 1 freq rounder (3) - 1 freq rendirs (3) - 2 freq winders (4) - 3 freq rounds (4) - 9 freq oarders (4) - 2 freq grunders (4) - 2 freq orders (4) - 51 freq reminders (4) - 4 freq hunders (4) - 25 freq haunders (4) - 1 freq cinders (4) - 7 freq lenders (4) - 1 freq wunders (4) - 1 freq render (4) - 8 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 - RNTRS roonder's - 1 freq roonders - 2 freq renders - 2 freq rendirs - 2 freq |
ROONDERS |
Time to execute Levenshtein function - 0.214700 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.363121 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.029059 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.037453 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.000879 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. |