| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roonded (0) - 13 freq rounded (1) - 7 freq roondid (1) - 1 freq droonded (1) - 1 freq groonded (1) - 4 freq roonder (1) - 4 freq foonded (1) - 1 freq soonded (1) - 23 freq boorded (2) - 1 freq ronged (2) - 1 freq bounded (2) - 7 freq roozed (2) - 1 freq rooked (2) - 1 freq roondin (2) - 1 freq soonder (2) - 1 freq saroonded (2) - 1 freq roondan (2) - 4 freq roond (2) - 946 freq boonced (2) - 20 freq rooted (2) - 12 freq rooed (2) - 2 freq roondit (2) - 13 freq hooded (2) - 1 freq crooned (2) - 15 freq dooned (2) - 3 freq |
roonded (0) - 13 freq roondid (1) - 1 freq rounded (1) - 7 freq soonded (2) - 23 freq roonder (2) - 4 freq foonded (2) - 1 freq droonded (2) - 1 freq groonded (2) - 4 freq grounded (3) - 3 freq roonds (3) - 8 freq wounded (3) - 11 freq pounded (3) - 2 freq hounded (3) - 1 freq suroonded (3) - 1 freq sounded (3) - 25 freq roondit (3) - 13 freq founded (3) - 3 freq rounder (3) - 1 freq unroonded (3) - 1 freq roond (3) - 946 freq roondin (3) - 1 freq poinded (3) - 1 freq bounded (3) - 7 freq ronged (3) - 1 freq roondan (3) - 4 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 |
ROONDED |
| Time to execute Levenshtein function - 0.209978 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.396938 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.028473 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.038685 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.000836 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. |