| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| axil (0) - 1 freq ail (1) - 5 freq aail (1) - 1 freq axis (1) - 7 freq ahil (1) - 1 freq afil (1) - 1 freq axin (1) - 25 freq a'il (1) - 3 freq axfil (1) - 1 freq atil (1) - 17 freq amyl (2) - 1 freq kamil (2) - 1 freq axe (2) - 22 freq aix (2) - 42 freq kuil (2) - 1 freq il (2) - 1 freq a'll (2) - 528 freq aaib (2) - 1 freq xxi (2) - 1 freq xix (2) - 1 freq atin (2) - 3 freq moil (2) - 1 freq cxi (2) - 1 freq atal (2) - 2 freq axiom (2) - 1 freq |
axil (0) - 1 freq ail (2) - 5 freq atil (2) - 17 freq exile (2) - 20 freq xol (2) - 1 freq axle (2) - 1 freq xl (2) - 3 freq oxl (2) - 1 freq axfil (2) - 1 freq axis (2) - 7 freq aail (2) - 1 freq ahil (2) - 1 freq afil (2) - 1 freq a'il (2) - 3 freq axin (2) - 25 freq xiu (3) - 1 freq xi (3) - 13 freq feil (3) - 7 freq awol (3) - 9 freq wxl (3) - 2 freq abel (3) - 7 freq exit (3) - 27 freq avail (3) - 12 freq all (3) - 1278 freq axed (3) - 81 freq |
SoundEx code - A240 agley - 44 freq asweel - 18 freq akwally - 1 freq aswell - 6 freq aisle - 26 freq acyully - 1 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 ashley - 9 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 |
AXIL |
| Time to execute Levenshtein function - 0.203206 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.366422 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.031611 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.036683 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.000850 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. |