| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pyper (0) - 4 freq pypet (1) - 2 freq pype (1) - 9 freq piper (1) - 31 freq hyper (1) - 4 freq pypar (1) - 1 freq paper (1) - 526 freq gyper (1) - 1 freq pypes (1) - 1 freq peyper (1) - 1 freq wyper (1) - 1 freq pyker (1) - 1 freq puer (2) - 1 freq ryder (2) - 1 freq ppe (2) - 3 freq papper (2) - 1 freq japer (2) - 1 freq popes (2) - 1 freq pope (2) - 26 freq tyer (2) - 1 freq 'yer (2) - 52 freq oyer (2) - 2 freq pape (2) - 1 freq pyres (2) - 2 freq gype (2) - 47 freq |
pyper (0) - 4 freq paper (1) - 526 freq pypar (1) - 1 freq piper (1) - 31 freq peyper (1) - 1 freq ppera (2) - 24 freq paiper (2) - 7 freq pooper (2) - 1 freq papier (2) - 1 freq peiper (2) - 1 freq pauper (2) - 5 freq paeper (2) - 3 freq papar (2) - 2 freq papery (2) - 1 freq popery (2) - 2 freq upper (2) - 55 freq gyper (2) - 1 freq pypes (2) - 1 freq wyper (2) - 1 freq pyker (2) - 1 freq hyper (2) - 4 freq pype (2) - 9 freq pypet (2) - 2 freq paer (3) - 3 freq pler (3) - 1 freq |
SoundEx code - P160 paper - 526 freq pepper - 83 freq piper - 31 freq puffer - 1 freq paper' - 1 freq papier - 1 freq popery - 2 freq pauper - 5 freq pyper - 4 freq papper - 1 freq pivver - 1 freq pipper - 2 freq paiper - 7 freq peyper - 1 freq papar - 2 freq paipur - 3 freq pepperie - 1 freq peiper - 1 freq popper - 3 freq pawper - 6 freq pypar - 1 freq peever - 1 freq €˜paper - 1 freq paeper - 3 freq papery - 1 freq pooper - 1 freq paybrhw - 1 freq paper- - 2 freq |
MetaPhone code - PPR paper - 526 freq pepper - 83 freq piper - 31 freq paper' - 1 freq papier - 1 freq popery - 2 freq pauper - 5 freq pyper - 4 freq papper - 1 freq pipper - 2 freq paiper - 7 freq peyper - 1 freq papar - 2 freq paipur - 3 freq pepperie - 1 freq peiper - 1 freq popper - 3 freq pawper - 6 freq pypar - 1 freq €˜paper - 1 freq paeper - 3 freq papery - 1 freq pooper - 1 freq paper- - 2 freq |
PYPER |
| Time to execute Levenshtein function - 0.195880 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.487691 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.028645 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.076051 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.001129 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. |