| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peasants (0) - 11 freq peasant (1) - 12 freq pheasants (1) - 2 freq 'peasant (2) - 1 freq pleasant (2) - 18 freq pheasant (2) - 6 freq peasantry (2) - 2 freq phaesants (2) - 1 freq phaisants (2) - 1 freq pennants (2) - 1 freq persons (3) - 12 freq paisant (3) - 1 freq poasts (3) - 1 freq pleasan (3) - 1 freq pents (3) - 5 freq pasts (3) - 4 freq pendant (3) - 1 freq deviants (3) - 1 freq leavans (3) - 1 freq waants (3) - 30 freq beasts (3) - 144 freq persists (3) - 3 freq pedant (3) - 3 freq diamants (3) - 1 freq seaman's (3) - 1 freq |
peasants (0) - 11 freq pheasants (2) - 2 freq peasant (2) - 12 freq phaisants (3) - 1 freq peasantry (3) - 2 freq phaesants (3) - 1 freq peanuts (4) - 10 freq parents (4) - 173 freq plants (4) - 73 freq sants (4) - 1 freq patents (4) - 3 freq presents (4) - 48 freq paints (4) - 2 freq pants (4) - 32 freq peyments (4) - 5 freq praisents (4) - 6 freq pennants (4) - 1 freq paisant (4) - 1 freq pheasant (4) - 6 freq pleasant (4) - 18 freq 'peasant (4) - 1 freq pasts (4) - 4 freq poasts (4) - 1 freq pests (4) - 2 freq pents (4) - 5 freq |
SoundEx code - P253 passchendaele - 2 freq peasant - 12 freq paisant - 1 freq pasimatymo - 1 freq pooshint - 1 freq peasants - 11 freq phaisants - 1 freq passionate - 6 freq piesient - 1 freq peasantry - 2 freq pageant - 2 freq pizend - 1 freq pocahontas - 2 freq pheasant - 6 freq pussion't - 1 freq pacient - 3 freq pizened - 1 freq poisoned - 6 freq passchendale's - 1 freq paissionate - 1 freq pisoned - 1 freq poushion't - 1 freq pushiont - 2 freq phaesants - 1 freq passend - 1 freq pissant - 1 freq pass-mates - 1 freq pheasants - 2 freq passionately - 2 freq passendale - 2 freq pysont - 1 freq pushioned - 1 freq pageantry - 1 freq pxjzndpdh - 1 freq psnitraffic - 1 freq peaceandlove - 1 freq pheasantry - 1 freq poozhant- - 1 freq 'peasant - 1 freq |
MetaPhone code - PSNTS peasants - 11 freq |
PEASANTS |
| Time to execute Levenshtein function - 0.200663 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.349508 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.027497 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.037028 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.000833 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. |