lucavilla
asked on
Similarity search through 10000 italian city names
I have a list of 10000 italian city names.
I would like to "fuzzy search" through them.
What's the most popular or fast algorithm for doing it?
I would like to "fuzzy search" through them.
What's the most popular or fast algorithm for doing it?
ASKER
I need to contain every search within 2 seconds of CPU time. Wouldn't the Levenshtein algorithm be too slow to be used on 10000 words every time?
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
see also
http://laurikari.net/tre/
http://laurikari.net/tre/
agrep satisfies the requirements, but this may also be of interest http://www-db.deis.unibo.it/Mtree/
Forced accept.
Computer101
EE Admin
Computer101
EE Admin
It's especially good for languages like Italian.
(°v°)