| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rinnals (0) - 1 freq rinnal (1) - 1 freq sannals (2) - 1 freq runnels (2) - 2 freq rentals (2) - 2 freq rinners (2) - 7 freq rinnan (2) - 3 freq dinnaes (2) - 1 freq finals (2) - 7 freq annals (2) - 5 freq rituals (2) - 3 freq signals (2) - 13 freq rivals (2) - 3 freq missals (3) - 1 freq winnan (3) - 1 freq dinnae' (3) - 2 freq innards (3) - 4 freq winners (3) - 30 freq fitnaes (3) - 1 freq winniks (3) - 2 freq hinners (3) - 5 freq sinngle (3) - 8 freq bunnels (3) - 1 freq finns (3) - 1 freq rinds (3) - 1 freq |
rinnals (0) - 1 freq rinnal (2) - 1 freq runnels (2) - 2 freq annals (3) - 5 freq rinners (3) - 7 freq sannals (3) - 1 freq rentals (3) - 2 freq originals (4) - 3 freq funnels (4) - 4 freq kennels (4) - 5 freq ragnails (4) - 1 freq trinnles (4) - 2 freq cannels (4) - 4 freq runkils (4) - 1 freq vennels (4) - 12 freq rennies (4) - 4 freq hunnels (4) - 2 freq sannels (4) - 1 freq dinnles (4) - 1 freq ransels (4) - 1 freq annuals (4) - 2 freq ginnles (4) - 1 freq crennels (4) - 1 freq tonnels (4) - 1 freq rankels (4) - 1 freq |
SoundEx code - R542 rummlegumption - 3 freq runnels - 2 freq rummels - 2 freq rummles - 3 freq rhymeless - 1 freq rinnals - 1 freq rum-lookin - 1 freq reanalysed - 1 freq ramilles - 1 freq rammels - 1 freq rummle-gumption - 1 freq rummil-gumption - 1 freq |
MetaPhone code - RNLS runnels - 2 freq rinnals - 1 freq |
RINNALS |
| Time to execute Levenshtein function - 0.691128 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.936724 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.092723 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.093329 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.000889 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. |