| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| according (0) - 26 freq accordin (1) - 85 freq accordin' (1) - 3 freq recording (2) - 6 freq accordit (2) - 4 freq accordain (2) - 2 freq accoardin (2) - 13 freq accordinly (2) - 3 freq accordingly (2) - 2 freq accordian (2) - 4 freq accordion (2) - 24 freq accorded (3) - 1 freq recordin (3) - 20 freq accord (3) - 7 freq accepting (3) - 3 freq accusing (3) - 3 freq recordings (3) - 2 freq anchoring (3) - 1 freq wording (3) - 7 freq accoordinly (3) - 1 freq coding (3) - 1 freq occurring (3) - 2 freq accompong (3) - 2 freq awarding (3) - 1 freq avoiding (3) - 1 freq |
according (0) - 26 freq accordin' (2) - 3 freq accordin (2) - 85 freq accordingly (3) - 2 freq accordion (3) - 24 freq accordinly (3) - 3 freq accordian (3) - 4 freq accoardin (3) - 13 freq recording (3) - 6 freq accordain (3) - 2 freq accordance (4) - 3 freq occurring (4) - 2 freq accoordinly (4) - 1 freq accordit (4) - 4 freq accompong (5) - 2 freq awarding (5) - 1 freq recordin' (5) - 1 freq recordins (5) - 10 freq racordins (5) - 1 freq scoring (5) - 7 freq byording (5) - 1 freq accepting (5) - 3 freq accorded (5) - 1 freq recordin (5) - 20 freq coding (5) - 1 freq |
SoundEx code - A263 assuired - 1 freq agreed - 106 freq ackwart - 6 freq accordinly - 3 freq aakward - 6 freq assured - 30 freq assert - 7 freq aseert - 1 freq aess-cairt - 1 freq asserting - 1 freq awkwardly - 8 freq awkward - 30 freq awkwart - 1 freq acrid - 1 freq accordin - 85 freq accordion - 24 freq ascertainin - 1 freq asserted - 1 freq ackwartness - 1 freq asgairth - 17 freq assertin - 2 freq accordin' - 3 freq ackwartly - 1 freq accured - 1 freq accord - 7 freq akward - 3 freq accordingly - 2 freq asserts - 1 freq assuredly - 1 freq awkwardness - 4 freq assortit - 3 freq accoard - 2 freq agreet - 17 freq acquired - 10 freq agreeit - 2 freq aukward - 1 freq accordionists - 1 freq a-grade - 1 freq accoardin - 13 freq accordance - 3 freq ackward - 3 freq accoordinly - 1 freq ackwird - 2 freq accurate - 9 freq accordit - 4 freq accreditit - 1 freq accurately - 5 freq akwardness - 1 freq aakwardly - 1 freq accordian - 4 freq akwird - 2 freq accredited - 2 freq accordain - 2 freq awkart - 2 freq acquirt - 1 freq aakwirt - 2 freq according - 26 freq assertioun - 2 freq akwirt - 1 freq asseert - 1 freq accurate-like - 1 freq accreditation - 2 freq asseirt - 1 freq asseired - 1 freq aujord - 1 freq assortment - 2 freq assuret - 4 freq awkartly - 1 freq assertit - 2 freq assurt - 1 freq acrood - 1 freq agreed-upo - 1 freq assertive - 2 freq assertion - 1 freq accorded - 1 freq aujourd'hui - 1 freq €˜accordingly - 1 freq asjrdjr - 1 freq ascertained - 1 freq akrtywscoj - 1 freq |
MetaPhone code - AKKRTNK according - 26 freq |
ACCORDING |
| Time to execute Levenshtein function - 0.241846 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.386088 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.029220 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.038327 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.000833 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. |