| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pavilion (0) - 2 freq pavillion (1) - 2 freq pallion (2) - 1 freq pailin (2) - 8 freq hamilton (3) - 40 freq palin (3) - 4 freq position (3) - 95 freq nailin (3) - 1 freq hallion (3) - 16 freq javelin (3) - 1 freq palio (3) - 1 freq petition (3) - 11 freq pailins (3) - 4 freq vision (3) - 61 freq magilton (3) - 2 freq paplin (3) - 1 freq pavin (3) - 4 freq paidlin (3) - 1 freq villon (3) - 1 freq ravelin (3) - 3 freq paikin (3) - 3 freq sailin (3) - 38 freq pawlin (3) - 1 freq pilton (3) - 1 freq naition (3) - 1 freq |
pavilion (0) - 2 freq pavillion (2) - 2 freq pavelyeon (3) - 1 freq pailin (3) - 8 freq pallion (3) - 1 freq pavin (4) - 4 freq paplin (4) - 1 freq paidlin (4) - 1 freq pawlin (4) - 1 freq pillion (4) - 1 freq ravelin (4) - 3 freq civilian (4) - 2 freq pilin (4) - 9 freq paveelions (4) - 1 freq palin (4) - 4 freq javelin (4) - 1 freq pallin (4) - 2 freq pairdon (5) - 12 freq unveilin (5) - 1 freq pulin (5) - 1 freq prevailin (5) - 2 freq pivotin (5) - 2 freq paddlin (5) - 5 freq peelin (5) - 5 freq mailin (5) - 3 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 - PFLN pavilion - 2 freq pavillion - 2 freq pvlne - 1 freq |
PAVILION |
| Time to execute Levenshtein function - 0.310303 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.604222 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.063836 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.049825 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.001161 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. |