| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orchard (0) - 8 freq orchart (1) - 9 freq richard (2) - 71 freq chard (2) - 1 freq orchid (2) - 5 freq mcward (3) - 3 freq ootward (3) - 6 freq northart (3) - 3 freq orchis (3) - 1 freq schare (3) - 1 freq oocha (3) - 3 freq onboard (3) - 2 freq coard (3) - 3 freq accoard (3) - 2 freq chad (3) - 3 freq ornar (3) - 4 freq card (3) - 61 freq arched (3) - 3 freq orare (3) - 2 freq forwaard (3) - 1 freq crichar (3) - 151 freq chaad (3) - 3 freq oscar (3) - 8 freq forward (3) - 162 freq morcar (3) - 4 freq |
orchard (0) - 8 freq richard (2) - 71 freq orchart (2) - 9 freq orchid (3) - 5 freq chard (3) - 1 freq archied (4) - 1 freq archers (4) - 1 freq chord (4) - 11 freq archer (4) - 9 freq airnhard (4) - 1 freq mchardy (4) - 8 freq arched (4) - 3 freq record (5) - 99 freq torchirt (5) - 1 freq rocher (5) - 5 freq ochre (5) - 4 freq cyard (5) - 1 freq arecord (5) - 1 freq reward (5) - 47 freq charade (5) - 2 freq shard (5) - 2 freq chars (5) - 1 freq orphaned (5) - 5 freq charm (5) - 30 freq airched (5) - 5 freq |
SoundEx code - O626 owergrown - 1 freq owerchairgin - 1 freq ower-aiger - 1 freq orchart - 9 freq owregrowne - 1 freq owergrouwen - 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.417184 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.591266 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.068176 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.038523 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.000927 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. |