| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| partridge (0) - 7 freq parridge (1) - 3 freq pantridge (1) - 1 freq purridge (2) - 8 freq oatridge (2) - 2 freq cartridges (2) - 2 freq porridge (2) - 44 freq arrige (3) - 1 freq partying (3) - 1 freq porrige (3) - 1 freq particle (3) - 1 freq carriage (3) - 7 freq cambridge (3) - 14 freq parrie (3) - 4 freq parting (3) - 3 freq marriage (3) - 14 freq merridge (3) - 1 freq astride (3) - 3 freq partitch (4) - 1 freq parentage (4) - 2 freq purring (4) - 1 freq provide (4) - 68 freq cairridges (4) - 1 freq petrie (4) - 4 freq pathie (4) - 9 freq |
partridge (0) - 7 freq pantridge (2) - 1 freq parridge (2) - 3 freq purridge (3) - 8 freq porridge (3) - 44 freq oatridge (4) - 2 freq cartridges (4) - 2 freq parting (5) - 3 freq merridge (5) - 1 freq partying (5) - 1 freq porrige (5) - 1 freq protrudin (6) - 3 freq putrid (6) - 3 freq trudge (6) - 4 freq pasturage (6) - 1 freq portrayed (6) - 2 freq partricides (6) - 1 freq patronage (6) - 3 freq pairtrick (6) - 1 freq porndge (6) - 1 freq portling (6) - 1 freq portree (6) - 1 freq trodge (6) - 1 freq gertrude (6) - 1 freq parted (6) - 1 freq |
SoundEx code - P636 portrait - 18 freq partridge - 7 freq portraits - 12 freq porters - 6 freq prittier - 1 freq porter - 13 freq porterfield - 1 freq porter's - 2 freq protrudin - 3 freq parturition - 1 freq portray - 1 freq portraiture - 1 freq paratrooper - 1 freq porturfeeld - 1 freq protractit - 3 freq portrayals - 1 freq portrayin - 2 freq porrtrait - 1 freq parterres - 1 freq €œporter - 1 freq pairtrick - 1 freq preterite - 2 freq pre-drinks - 1 freq pairtricks - 1 freq partricides - 1 freq protractin - 1 freq portrayed - 2 freq preterites - 2 freq pooer-hauders - 1 freq perturbation - 1 freq portrush - 1 freq prodrill - 3 freq protradeuk - 1 freq portrayal - 1 freq portrays - 1 freq prettier - 2 freq portree - 1 freq |
MetaPhone code - PRTRJ partridge - 7 freq |
PARTRIDGE |
| Time to execute Levenshtein function - 0.330460 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.642703 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.030016 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.071189 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.001114 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. |