| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| picket-lines (0) - 1 freq pitkethlie (4) - 1 freq pipelines (4) - 2 freq picketing (4) - 1 freq lucky-lines (4) - 1 freq faut-lines (5) - 1 freq sickerlie (5) - 1 freq pickets (5) - 3 freq pey-line (5) - 1 freq pike-riven (5) - 1 freq wice-like (5) - 3 freq richt-like (5) - 2 freq likeliness (5) - 1 freq chat-line (5) - 1 freq picklin (5) - 2 freq lichtlins (5) - 1 freq pucklies (5) - 4 freq niceties (5) - 1 freq biker-like (5) - 1 freq pipeline (5) - 3 freq ricketie (5) - 3 freq pickins (5) - 5 freq ticketie (5) - 1 freq sidelines (5) - 2 freq pickles (5) - 2 freq |
picket-lines (0) - 1 freq lucky-lines (6) - 1 freq picketing (7) - 1 freq pucklies (8) - 4 freq lichtlins (8) - 1 freq pickit-lookin (8) - 1 freq pickins (8) - 5 freq chat-line (8) - 1 freq pickles (8) - 2 freq picklin (8) - 2 freq pitkethlie (8) - 1 freq pickets (8) - 3 freq pipelines (8) - 2 freq faut-lines (8) - 1 freq packin-cases (9) - 1 freq pocket-book (9) - 1 freq pocketsiller (9) - 1 freq heckle-pins (9) - 4 freq pickters (9) - 1 freq pecht-lik (9) - 1 freq pockets (9) - 22 freq kittlins (9) - 5 freq pickie-beds (9) - 1 freq lock-ins (9) - 1 freq packets (9) - 20 freq |
SoundEx code - P234 pystle - 2 freq post-lockdoon - 1 freq pistols - 18 freq pistol - 28 freq pestilence - 6 freq pastel-coloured - 1 freq picket-lines - 1 freq pauchtily - 1 freq pigtails - 13 freq pigtail - 3 freq pistoll-shot - 1 freq pickit-lookin - 1 freq piccadilly - 2 freq pecadillos - 1 freq pastel - 2 freq pistil - 3 freq pecht-lik - 1 freq pistils - 4 freq posstal - 1 freq postalveolar - 3 freq postaladdress - 10 freq postal - 3 freq pistoll - 1 freq pechtland - 2 freq pastless - 1 freq pastilles - 1 freq pkdhl - 1 freq postalworkersday - 1 freq |
MetaPhone code - PKTLNS picket-lines - 1 freq |
PICKET-LINES |
| Time to execute Levenshtein function - 0.503762 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 - 1.003713 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.081024 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.086738 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.000989 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. |