| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roondit (0) - 13 freq foondit (1) - 41 freq soondit (1) - 61 freq droondit (1) - 4 freq hoondit (1) - 1 freq woondit (1) - 1 freq roundit (1) - 3 freq groondit (1) - 2 freq roondin (1) - 1 freq roondid (1) - 1 freq moonlit (2) - 4 freq roondan (2) - 4 freq stoondit (2) - 2 freq soondin (2) - 47 freq hoondin (2) - 1 freq roostit (2) - 6 freq soonit (2) - 1 freq boondin (2) - 1 freq bondit (2) - 1 freq boordit (2) - 2 freq roondish (2) - 1 freq doonsit (2) - 1 freq rootit (2) - 8 freq roadit (2) - 6 freq roosit (2) - 2 freq |
roondit (0) - 13 freq roundit (1) - 3 freq groondit (2) - 2 freq roondid (2) - 1 freq randit (2) - 1 freq ryndit (2) - 1 freq roondin (2) - 1 freq soondit (2) - 61 freq foondit (2) - 41 freq woondit (2) - 1 freq droondit (2) - 4 freq hoondit (2) - 1 freq groundit (3) - 3 freq roonded (3) - 13 freq foundit (3) - 6 freq woundit (3) - 17 freq roonder (3) - 4 freq roond (3) - 946 freq rounit (3) - 1 freq roddit (3) - 1 freq roondest (3) - 2 freq boundit (3) - 1 freq soundit (3) - 29 freq roonds (3) - 8 freq foondet (3) - 1 freq |
SoundEx code - R533 rendeition - 1 freq roonded - 13 freq roondit - 13 freq rented - 4 freq ranted - 4 freq rentit - 6 freq roundit - 3 freq roondid - 1 freq rendition - 5 freq rantit - 1 freq reunitet - 1 freq rounded - 7 freq reunited - 1 freq runtit - 3 freq rendeitioun - 1 freq remittit - 1 freq rendeitions - 2 freq randit - 1 freq ryndit - 1 freq reunitit - 1 freq remeidit - 1 freq renditon - 1 freq reuinitit - 1 freq rendeetion - 1 freq roondheads - 1 freq |
MetaPhone code - RNTT roonded - 13 freq roondit - 13 freq rented - 4 freq ranted - 4 freq rentit - 6 freq roundit - 3 freq roondid - 1 freq rantit - 1 freq reunitet - 1 freq rounded - 7 freq reunited - 1 freq runtit - 3 freq randit - 1 freq ryndit - 1 freq reunitit - 1 freq reuinitit - 1 freq |
ROONDIT |
| Time to execute Levenshtein function - 0.174762 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.349378 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.027781 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.037732 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.000855 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. |