| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| axle (0) - 1 freq aple (1) - 2 freq aule (1) - 1 freq axe (1) - 22 freq able (1) - 436 freq axte (1) - 1 freq axae (1) - 1 freq ale (1) - 53 freq aale (1) - 1 freq awld (2) - 6 freq hazle (2) - 1 freq jyle (2) - 47 freq awae (2) - 22 freq aall (2) - 3 freq -able (2) - 1 freq ane (2) - 2140 freq ahie (2) - 1 freq myle (2) - 15 freq mlle (2) - 1 freq ile (2) - 65 freq ande (2) - 4 freq mole (2) - 11 freq axd (2) - 1 freq tanle (2) - 1 freq axis (2) - 7 freq |
axle (0) - 1 freq aale (2) - 1 freq axil (2) - 1 freq xl (2) - 3 freq exile (2) - 20 freq ale (2) - 53 freq oxl (2) - 1 freq axae (2) - 1 freq aple (2) - 2 freq axe (2) - 22 freq aule (2) - 1 freq axte (2) - 1 freq able (2) - 436 freq axin (3) - 25 freq gle (3) - 4 freq xje (3) - 1 freq rale (3) - 78 freq le (3) - 53 freq allo (3) - 2 freq exe (3) - 2 freq cule (3) - 1 freq cele (3) - 1 freq paule (3) - 1 freq mele (3) - 1 freq a'li (3) - 1 freq |
SoundEx code - A240 agley - 44 freq asweel - 18 freq akwally - 1 freq aswell - 6 freq aisle - 27 freq acyully - 1 freq a-solo - 1 freq ashley - 10 freq age-owl - 2 freq aisily - 1 freq agal - 1 freq aglee - 1 freq azly - 1 freq ahoghill - 5 freq assail - 7 freq aigle - 4 freq aqual - 3 freq asweill - 2 freq aesily - 2 freq aglow - 1 freq axle - 1 freq asshole - 2 freq ackwally - 1 freq acshully - 3 freq acshull - 1 freq aizle - 1 freq acwally - 4 freq asail - 1 freq aglay - 1 freq aggie'll - 1 freq ackwal - 3 freq ackwallie - 2 freq akuallie - 1 freq ackwall - 1 freq acual - 1 freq akwallie - 2 freq asl - 1 freq agile - 2 freq axil - 1 freq azalea - 2 freq aggle - 2 freq akchilee - 1 freq akaollie - 7 freq azl - 1 freq ackley - 1 freq acshul - 1 freq ayqal - 1 freq ajzhulh - 1 freq ayshely - 1 freq |
MetaPhone code - AKSL axle - 1 freq axil - 1 freq |
AXLE |
| Time to execute Levenshtein function - 0.168489 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.321909 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.027609 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.038094 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.000936 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. |