| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earringed (0) - 1 freq arreinged (2) - 4 freq arranged (2) - 33 freq earrings (2) - 8 freq rearranged (2) - 2 freq edfringe (3) - 17 freq carriages (3) - 1 freq cringed (3) - 2 freq rearrange (3) - 1 freq earrins (3) - 2 freq abridged (3) - 1 freq harried (3) - 6 freq parridge (3) - 3 freq married (3) - 30 freq reinged (3) - 5 freq arranges (3) - 1 freq arreinge (3) - 1 freq arrived (3) - 140 freq ringed (3) - 7 freq arreenged (3) - 1 freq arrynge (3) - 1 freq warring (3) - 1 freq breinged (3) - 6 freq earned (3) - 19 freq arrige (3) - 1 freq |
earringed (0) - 1 freq arreinged (2) - 4 freq arranged (2) - 33 freq arreenged (3) - 1 freq arraynged (3) - 1 freq earrings (3) - 8 freq rearranged (3) - 2 freq arreinge (4) - 1 freq ringed (4) - 7 freq arrynge (4) - 1 freq fringed (4) - 1 freq reinged (4) - 5 freq arrange (4) - 14 freq breinged (4) - 6 freq arranges (4) - 1 freq cringed (4) - 2 freq reenged (5) - 8 freq warranted (5) - 1 freq erdinger (5) - 1 freq arrangin (5) - 2 freq ranged (5) - 1 freq earrin (5) - 1 freq breenged (5) - 55 freq rroned (5) - 1 freq pronged (5) - 1 freq |
SoundEx code - E652 earrins - 2 freq erying - 1 freq erms - 48 freq ermchair - 10 freq earnestly - 4 freq earrings - 8 freq eerins - 6 freq earnest - 13 freq ernest - 6 freq eerin's - 1 freq errins - 1 freq earringed - 1 freq earns - 3 freq erns - 1 freq ee-wharms - 1 freq ern-cairriers - 1 freq erin's - 3 freq ernie's - 2 freq erm-chair - 1 freq eernest-like - 1 freq erne's - 1 freq euromosaic - 1 freq eerans - 1 freq ernes - 1 freq eringrieve - 7 freq eerrans - 1 freq |
MetaPhone code - ERNJT earringed - 1 freq |
EARRINGED |
| Time to execute Levenshtein function - 0.247208 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.414129 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.027945 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.037025 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.000859 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. |