| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orchard (0) - 8 freq orchart (1) - 9 freq orchid (2) - 5 freq chard (2) - 1 freq richard (2) - 71 freq for'ard (3) - 2 freq odhar (3) - 1 freq charm (3) - 30 freq echaed (3) - 2 freq €˜charm (3) - 1 freq mchardy (3) - 8 freq chord (3) - 7 freq onward (3) - 5 freq orphans (3) - 35 freq €œhard (3) - 2 freq buchart (3) - 1 freq forcheid (3) - 1 freq coard (3) - 3 freq airnhard (3) - 1 freq archers (3) - 1 freq cyard (3) - 1 freq archaic (3) - 2 freq orphan (3) - 14 freq ornary (3) - 1 freq kmcharg (3) - 13 freq |
orchard (0) - 8 freq orchart (2) - 9 freq richard (2) - 71 freq chard (3) - 1 freq orchid (3) - 5 freq mchardy (4) - 8 freq chord (4) - 7 freq arched (4) - 3 freq airnhard (4) - 1 freq archer (4) - 9 freq archers (4) - 1 freq archied (4) - 1 freq richer (5) - 15 freq accoard (5) - 2 freq richted (5) - 4 freq shard (5) - 2 freq hard (5) - 782 freq orchids (5) - 2 freq orchis (5) - 1 freq 'hard (5) - 2 freq rocher (5) - 5 freq chaad (5) - 3 freq schare (5) - 1 freq card (5) - 61 freq rouchir (5) - 1 freq |
SoundEx code - O626 owergrown - 1 freq owerchairgin - 1 freq ower-aiger - 1 freq orchart - 9 freq owregrowne - 1 freq owerseer - 5 freq orgreave - 2 freq owercrowdit - 1 freq owercrowded - 1 freq orchard - 8 freq owergrouwn - 1 freq ower-critically - 1 freq owergrawn - 1 freq orxcrz - 1 freq |
MetaPhone code - ORXRT orchart - 9 freq orchard - 8 freq |
ORCHARD |
| Time to execute Levenshtein function - 0.340825 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.716971 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.081059 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.037363 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.000776 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. |