| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paving (0) - 1 freq having (1) - 61 freq pavin (1) - 4 freq paying (1) - 13 freq pacing (1) - 1 freq raving (1) - 2 freq waving (1) - 9 freq saving (1) - 5 freq packing (2) - 6 freq faking (2) - 1 freq havins (2) - 1 freq lavin (2) - 2 freq pavia (2) - 2 freq placing (2) - 2 freq rating (2) - 1 freq lavins (2) - 1 freq caaing (2) - 1 freq dating (2) - 8 freq parins (2) - 3 freq patina (2) - 1 freq carving (2) - 2 freq piling (2) - 1 freq phasing (2) - 1 freq wading (2) - 1 freq poling (2) - 1 freq |
paving (0) - 1 freq raving (2) - 2 freq saving (2) - 5 freq pacing (2) - 1 freq waving (2) - 9 freq paying (2) - 13 freq having (2) - 61 freq pavin (2) - 4 freq piping (3) - 5 freq pairing (3) - 2 freq weaving (3) - 1 freq paven (3) - 1 freq heving (3) - 1 freq luving (3) - 1 freq irving (3) - 1 freq hiving (3) - 1 freq living (3) - 49 freq papingo (3) - 4 freq heaving (3) - 1 freq loving (3) - 27 freq pining (3) - 1 freq pausing (3) - 1 freq pang (3) - 3 freq proving (3) - 3 freq giving (3) - 26 freq |
SoundEx code - P152 puffins - 5 freq papinjay - 1 freq puffing - 2 freq papingo - 4 freq papingos - 1 freq piping - 5 freq pippens - 1 freq pavonis - 1 freq pippins - 1 freq paving - 1 freq peeping - 2 freq poppins - 1 freq puffinstuff - 1 freq pupping - 1 freq popping - 1 freq |
MetaPhone code - PFNK puffing - 2 freq pighing - 1 freq paving - 1 freq |
PAVING |
| Time to execute Levenshtein function - 0.226460 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.408611 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.028742 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.043672 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.000931 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. |