| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isbn (0) - 23 freq isn (1) - 20 freq islan (2) - 13 freq bsb (2) - 1 freq asn (2) - 1 freq isxcn (2) - 1 freq risin (2) - 136 freq i'sun (2) - 12 freq iss' (2) - 1 freq isg (2) - 1 freq ibsen (2) - 2 freq i'bin (2) - 2 freq 'sin (2) - 1 freq bison (2) - 2 freq ipn (2) - 1 freq uisin (2) - 105 freq san (2) - 44 freq isss (2) - 1 freq iron (2) - 103 freq ion (2) - 1 freq wisn (2) - 3 freq is-' (2) - 1 freq ifbw (2) - 1 freq risen (2) - 17 freq usin (2) - 94 freq |
isbn (0) - 23 freq isn (2) - 20 freq isno (3) - 36 freq aisin (3) - 1 freq isni (3) - 5 freq snn (3) - 1 freq sin (3) - 674 freq sbt (3) - 6 freq usb (3) - 2 freq usbf (3) - 14 freq inben (3) - 5 freq gbn (3) - 1 freq i'bun (3) - 6 freq uscn (3) - 61 freq sbd (3) - 2 freq sen (3) - 155 freq sbc (3) - 1 freq issin (3) - 1 freq eisin (3) - 1 freq aisan (3) - 1 freq dbn (3) - 1 freq sbbn (3) - 1 freq isna (3) - 390 freq asbo (3) - 1 freq ishin (3) - 2 freq |
SoundEx code - I215 isbn - 23 freq ice-boond - 1 freq ixkfmpbsxq - 2 freq isbimpfllr - 1 freq |
MetaPhone code - ISBN isbn - 23 freq |
ISBN |
| Time to execute Levenshtein function - 0.186277 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.310604 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.027135 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.036811 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.000823 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. |