| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rugby-tackle (0) - 1 freq unbuckle (6) - 3 freq regrettable (6) - 1 freq ramshackle (6) - 6 freq receptacle (6) - 1 freq sub-title (6) - 1 freq rugbyaid (6) - 1 freq fairy-tale (6) - 4 freq riggy-bane (6) - 2 freq unbeatable (6) - 2 freq tackle (6) - 30 freq ruckle (6) - 2 freq tiggy-winkle (6) - 1 freq rugbysco (6) - 1 freq cuddy-back (6) - 1 freq obstacle (6) - 7 freq mega-muckle (6) - 1 freq humfy-backit (6) - 1 freq repeatable (7) - 1 freq fuhl-back's (7) - 1 freq cullybackey (7) - 3 freq unbearable (7) - 2 freq undertake (7) - 1 freq tickle (7) - 13 freq stock-take (7) - 1 freq |
rugby-tackle (0) - 1 freq mega-muckle (9) - 1 freq ruckle (10) - 2 freq tackle (10) - 30 freq tiggy-winkle (10) - 1 freq obstacle (10) - 7 freq arbuckle (10) - 9 freq arse-cockle (10) - 1 freq rugbysco (10) - 1 freq ramshackle (10) - 6 freq receptacle (10) - 1 freq sub-title (10) - 1 freq unbuckle (10) - 3 freq regrettable (10) - 1 freq redoubtable (11) - 1 freq rusticall (11) - 1 freq dabarbuckle (11) - 3 freq tick-tack (11) - 1 freq rickle (11) - 31 freq buckle (11) - 12 freq bruckle (11) - 15 freq rebuttal (11) - 1 freq fag-packet (11) - 1 freq argle-bargle (11) - 1 freq rug-sooked (11) - 1 freq |
SoundEx code - R213 received - 53 freq reception - 30 freq risped - 1 freq receipt - 18 freq recaptured - 3 freq receivit - 3 freq rose-fite - 1 freq reeseeved - 1 freq respite - 4 freq rugby-tackle - 1 freq rose-bed - 1 freq receptionist - 10 freq rasped - 3 freq resaived - 2 freq receptacles - 1 freq receipts - 5 freq respiyt - 1 freq rosebuds - 1 freq rispit - 1 freq receptautioun - 1 freq recapturin - 1 freq receptioun - 1 freq receptive - 4 freq receptacle - 1 freq re-shaped - 1 freq rosebed - 1 freq receptionists - 2 freq rikfyddljv - 1 freq recipt - 1 freq rugbyaid - 1 freq rosebeds - 1 freq rsbatxdve - 1 freq rspbdandg - 1 freq |
MetaPhone code - RKBTKL rugby-tackle - 1 freq |
RUGBY-TACKLE |
| Time to execute Levenshtein function - 0.667493 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.028378 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.083151 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.096167 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.000869 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. |