| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pivveran (0) - 1 freq pivvered (2) - 1 freq kivverin (2) - 2 freq pivver (2) - 1 freq peeran (3) - 2 freq livveen (3) - 1 freq kieran (3) - 26 freq yivvery (3) - 1 freq kivvers (3) - 5 freq kivver (3) - 6 freq shiveran (3) - 1 freq ivver (3) - 276 freq nivver (3) - 977 freq fivver (3) - 4 freq shivverin (3) - 5 freq patteran (3) - 3 freq kivvert (3) - 5 freq kiverin (3) - 2 freq rivven (3) - 1 freq wivven (3) - 3 freq hooveran (3) - 1 freq lipperan (3) - 2 freq hivven (3) - 54 freq ivvery (3) - 74 freq silverin (3) - 2 freq |
pivveran (0) - 1 freq kivverin (3) - 2 freq pivver (3) - 1 freq pivvered (3) - 1 freq bovverin (4) - 1 freq kivvered (5) - 2 freq kivverage (5) - 1 freq divven (5) - 1 freq silverin (5) - 2 freq ivvery (5) - 74 freq picterin (5) - 1 freq coveran (5) - 2 freq kivvverin (5) - 1 freq nivvers (5) - 1 freq sivven (5) - 15 freq pierian (5) - 1 freq pipperin (5) - 3 freq waveran (5) - 1 freq ivverie (5) - 25 freq hoveran (5) - 1 freq hivven (5) - 54 freq hivvan (5) - 10 freq yivver (5) - 4 freq ivver (5) - 276 freq peeran (5) - 2 freq |
SoundEx code - P165 pepperami - 1 freq pepperoni - 3 freq papier-maché - 1 freq paperin - 2 freq pipperin - 3 freq pepperin - 3 freq pivveran - 1 freq peppermills - 1 freq peffermill - 3 freq pepper-mashie - 1 freq peppermints - 2 freq paper-mills - 1 freq pawprints - 1 freq peppermint - 2 freq paper-news - 1 freq papayranger - 4 freq |
MetaPhone code - PFRN pivveran - 1 freq |
PIVVERAN |
| Time to execute Levenshtein function - 0.252397 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.453029 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.030364 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.040375 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.000881 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. |