Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pounces (0) - 1 freq pounce (1) - 9 freq ounces (1) - 1 freq bounces (1) - 4 freq pounced (1) - 1 freq poncey (2) - 2 freq bouncer (2) - 24 freq oonces (2) - 3 freq pounded (2) - 2 freq punies (2) - 3 freq bouncers (2) - 5 freq pouches (2) - 5 freq dunces (2) - 5 freq pences (2) - 3 freq prences (2) - 2 freq tounies (2) - 1 freq pouns (2) - 2 freq pound's (2) - 1 freq ouncer (2) - 1 freq boonces (2) - 4 freq ponce (2) - 1 freq lounges (2) - 1 freq bounced (2) - 12 freq bounce (2) - 23 freq ponies (2) - 6 freq |
pounces (0) - 1 freq pences (2) - 3 freq bounces (2) - 4 freq pounced (2) - 1 freq pounce (2) - 9 freq ounces (2) - 1 freq ponce (3) - 1 freq ponies (3) - 6 freq pounds (3) - 28 freq princes (3) - 25 freq punches (3) - 5 freq nonces (3) - 2 freq pouns (3) - 2 freq prances (3) - 1 freq poonce (3) - 1 freq boonces (3) - 4 freq dunces (3) - 5 freq oonces (3) - 3 freq poncey (3) - 2 freq prences (3) - 2 freq punies (3) - 3 freq poynts (4) - 2 freq punch (4) - 48 freq palaces (4) - 9 freq pynes (4) - 8 freq |
SoundEx code - P522 pinkies - 3 freq pancake - 52 freq punches - 5 freq pansies - 4 freq pinkish - 2 freq penicuik - 5 freq pinnaces - 2 freq pancakes - 14 freq paunch-gabbed - 1 freq pences - 3 freq punsis - 1 freq painches - 1 freq pounces - 1 freq pinches - 2 freq pan-haggis - 1 freq pancakeday - 1 freq punshees - 1 freq pingusu - 8 freq pamgosalmsp - 1 freq punkasfuck - 4 freq penicuikath - 21 freq penicuikathu - 2 freq penicuikafc - 2 freq pinechest - 1 freq pinocchios - 1 freq |
MetaPhone code - PNSS pansies - 4 freq hypnosis - 3 freq pinnaces - 2 freq pences - 3 freq punsis - 1 freq pounces - 1 freq |
POUNCES pounce - 9 freq pouncin - freq pounces - 1 freq pounced - 1 freq |
Time to execute Levenshtein function - 0.238569 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.395983 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.027533 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.037817 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.001074 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. |