| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goodtreesnc (0) - 2 freq goodtimes (4) - 1 freq boortrees (4) - 7 freq goldcrests (5) - 1 freq footeen (5) - 1 freq goodnes (5) - 1 freq goldereen's (5) - 1 freq coorteens (5) - 2 freq rooteen (5) - 1 freq coorteen (5) - 1 freq ootdeen (5) - 1 freq gantrees (5) - 1 freq goodreads (5) - 1 freq boortries (5) - 1 freq ooteen (5) - 1 freq goodbrand (5) - 1 freq gadarenesc (5) - 1 freq goodies (5) - 6 freq goodness (5) - 30 freq goodbyes (5) - 3 freq boortree (5) - 1 freq ootrels (5) - 18 freq doorless (6) - 1 freq good-goin (6) - 1 freq govermen (6) - 2 freq |
goodtreesnc (0) - 2 freq goodtimes (7) - 1 freq gadarenesc (8) - 1 freq gantrees (8) - 1 freq goodbrand (8) - 1 freq boortrees (8) - 7 freq greesan (9) - 1 freq govrenance (9) - 1 freq goodbyes (9) - 3 freq goodness (9) - 30 freq gadarene (9) - 1 freq godsend (9) - 3 freq gadderies (9) - 2 freq godric (9) - 1 freq gantries (9) - 1 freq goodnes (9) - 1 freq goodies (9) - 6 freq goldcrests (9) - 1 freq dooters (9) - 2 freq gousters (9) - 3 freq gadarenes (9) - 3 freq goodreads (9) - 1 freq greeance (9) - 18 freq boortries (9) - 1 freq godssend (9) - 3 freq |
SoundEx code - G362 gutters - 10 freq guitars - 4 freq gathers - 1 freq gethers - 11 freq gitters - 1 freq gaithers - 9 freq gadders - 4 freq guidèrs - 1 freq guit-ers - 1 freq gowdwark - 1 freq gadderies - 2 freq guidars - 2 freq gutters' - 1 freq guitarist - 3 freq godric - 1 freq guiders - 1 freq gaiters - 1 freq gutteryaggle - 30 freq goodtreesnc - 2 freq guitarguitaruk - 1 freq |
MetaPhone code - KTTRSNK goodtreesnc - 2 freq |
GOODTREESNC |
| Time to execute Levenshtein function - 0.233767 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.434777 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.028431 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.037953 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.000800 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. |