| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dazedpuckbunny (0) - 1 freq dustbunny (7) - 1 freq avalonbunny (8) - 2 freq jamesbundy (8) - 2 freq hamesucken (8) - 2 freq bannockburn (8) - 6 freq daecency (8) - 2 freq defeeckwulty (8) - 1 freq eaceducation (8) - 17 freq haepenny (8) - 1 freq deductan (8) - 1 freq deductions (8) - 1 freq druckenly (8) - 1 freq education (9) - 421 freq backbeen (9) - 1 freq puckin (9) - 10 freq dreep-doun (9) - 1 freq hepburn (9) - 6 freq backburner (9) - 1 freq alexbcann (9) - 1 freq davidpolson (9) - 1 freq davidmunro (9) - 1 freq 'education (9) - 2 freq daveberry (9) - 2 freq backbone (9) - 1 freq |
dazedpuckbunny (0) - 1 freq dustbunny (12) - 1 freq druckenly (13) - 1 freq deductan (13) - 1 freq deductions (13) - 1 freq bannockburn (13) - 6 freq eddickation (14) - 1 freq dedication (14) - 8 freq davidpsnp (14) - 1 freq cockburn (14) - 9 freq decking (14) - 1 freq depiction (14) - 3 freq blackburn (14) - 5 freq deckhand (14) - 1 freq depictions (14) - 2 freq daurkenin (14) - 3 freq pockmanty (14) - 2 freq wdkenny (14) - 1 freq backpacking (14) - 1 freq backbane (14) - 2 freq mackenna (14) - 1 freq dipduckdive (14) - 3 freq respeckin (14) - 2 freq davidhdickson (14) - 1 freq rhondamckenna (14) - 2 freq |
SoundEx code - D231 dustpan - 3 freq disadvantage - 8 freq dustbins - 1 freq dystopian - 4 freq disadvantaged - 1 freq disadvise - 1 freq dustbunny - 1 freq disadvantageous - 1 freq disadvantages - 1 freq dazedpuckbunny - 1 freq dzxctb - 1 freq dkqdvr - 1 freq |
MetaPhone code - TSTPKBN dazedpuckbunny - 1 freq |
DAZEDPUCKBUNNY |
| Time to execute Levenshtein function - 0.242717 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.383882 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.027423 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.037224 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.000940 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. |