CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Manifesto: what CTK is about |Store| Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot

CTK Exchange

Subject: "Distance between strings"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange This and that Topic #96
Reading Topic #96
berenguer (Guest)
guest
Feb-20-01, 12:16 PM (EST)
 
"Distance between strings"
 
   You want to find similar words to one you may be thinking of against a dictionary in your computer. How to do so?

1- Get only those words whith a Levenshtein's distance which migth seem acceptable to you.

2- Convert both the dictionary words and the original one to a binary array. F.e.: 'AAA' -> '010000010100000101000001'

3- Get the crossed-correlation coeficient between the oroginal and the dictionary words.

4- Print only those whose crossed-correlation coeficient at bit-level is higher than 94% (or whatever you want):

5- Amazing eh? I didn't either thought it could work so well (at least it does in spanish)

6- Carefull!-> It's slow an uses a lot of CPU.


  Alert | IP Printer-friendly page | Edit | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to visit the old CTK Exchange archive.

|Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny

[an error occurred while processing this directive]
 Advertise

New Books
Second editions of J. Conway's classic On Numbers And Games and the inimitable Winning Ways for Your Mathematical Plays