| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pipeline (0) - 3 freq pipelines (1) - 2 freq tideline (2) - 1 freq timeline (2) - 14 freq pinglin (3) - 1 freq pizenin (3) - 1 freq piecin (3) - 1 freq paplin (3) - 1 freq paplin' (3) - 1 freq piecing (3) - 1 freq pipperin (3) - 3 freq feline (3) - 16 freq incline (3) - 7 freq ripplin (3) - 12 freq paperin (3) - 2 freq purelie (3) - 1 freq pipin (3) - 8 freq wilelife (3) - 2 freq madeline (3) - 1 freq pirlie (3) - 1 freq sidelines (3) - 2 freq pippins (3) - 1 freq kinelie (3) - 1 freq tim'line (3) - 1 freq pey-line (3) - 1 freq |
pipeline (0) - 3 freq pipelines (2) - 2 freq paplin (3) - 1 freq appeelin (4) - 1 freq spielin (4) - 1 freq pipin (4) - 8 freq paperin (4) - 2 freq pey-line (4) - 1 freq tipplin (4) - 1 freq appealin (4) - 6 freq papplin (4) - 2 freq pilin (4) - 9 freq ripplin (4) - 12 freq kipplin (4) - 1 freq paplin' (4) - 1 freq timeline (4) - 14 freq pirlin (4) - 8 freq pauline (4) - 36 freq peelin (4) - 5 freq tideline (4) - 1 freq pulin (5) - 1 freq speilin (5) - 1 freq poppin (5) - 22 freq airplane (5) - 4 freq appealing (5) - 1 freq |
SoundEx code - P145 paveelions - 1 freq pipelines - 2 freq pavilion - 2 freq papplin - 2 freq paplin' - 1 freq paplin - 1 freq pipeline - 3 freq pavelyeon - 1 freq pavillion - 2 freq |
MetaPhone code - PPLN papplin - 2 freq paplin' - 1 freq paplin - 1 freq pipeline - 3 freq |
PIPELINE |
| Time to execute Levenshtein function - 0.229302 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.392315 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.029507 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.050269 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.001183 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. |