| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pot-holes (0) - 1 freq pop-holes (1) - 2 freq boat-holes (2) - 1 freq pothole (2) - 5 freq bolt-hole (3) - 1 freq f-holes (3) - 1 freq tod-hole (3) - 3 freq post-codes (3) - 1 freq porthole (3) - 1 freq potatoes (3) - 7 freq wormholes (3) - 4 freq cot-hous (3) - 2 freq oot-comes (3) - 1 freq tholes (3) - 17 freq oot-hooses (3) - 1 freq neb-holes (3) - 1 freq rat-hole (3) - 3 freq a-holes (3) - 1 freq loopholes (3) - 1 freq plughole (4) - 2 freq dryholes (4) - 1 freq notches (4) - 1 freq pythons (4) - 1 freq pathogens (4) - 1 freq photoies (4) - 1 freq |
pot-holes (0) - 1 freq pop-holes (2) - 2 freq boat-holes (3) - 1 freq pothole (4) - 5 freq oot-hooses (5) - 1 freq neb-holes (5) - 1 freq tholes (5) - 17 freq a-holes (5) - 1 freq rat-hole (5) - 3 freq cot-hous (5) - 2 freq f-holes (5) - 1 freq het-houss (6) - 1 freq pathos (6) - 5 freq oot-hoose (6) - 1 freq pitches (6) - 15 freq peat-hags (6) - 4 freq patches (6) - 22 freq rat-holl (6) - 1 freq buit-soles (6) - 1 freq rat-hol (6) - 1 freq oot-hauds (6) - 1 freq aftwhiles (6) - 3 freq pit-doons (6) - 2 freq pathies (6) - 1 freq patrols (6) - 3 freq |
SoundEx code - P342 petals - 22 freq padlock - 5 freq puddles - 12 freq podlie's - 1 freq padlocks - 1 freq potless - 1 freq pitlochory - 1 freq pathologically - 1 freq peitiless - 2 freq pitlochry - 7 freq paiddles - 2 freq pitiless - 1 freq peetiless - 1 freq piddles - 4 freq pedals - 3 freq pot-holes - 1 freq pathologist - 1 freq pathological - 1 freq paddles - 1 freq potlicht - 1 freq ptlz - 1 freq padlocks - 1 freq |
MetaPhone code - PTHLS pot-holes - 1 freq |
POT-HOLES |
| Time to execute Levenshtein function - 0.261668 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.411377 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.029456 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.038808 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.000948 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. |