in reply to Re: Help required in RE strategy
in thread Help required in RE strategy
Then you could use expensive algorithms like http://en.wikipedia.org/wiki/Levenshtein_distance to find the closest match.Compaq Presario Laptop Model PSLA 0L00U00E
You could also split the word database for a better filtering. For example require that one word matches in a vendor table (so that you examine only Compaq products).
A nice thing of this algorithm is that you can start with a very restrictive filter and whenever you get not hits, you can reduce the minimal number of matching words.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Help required in RE strategy
by suaveant (Parson) on Aug 22, 2007 at 15:08 UTC | |
by lima1 (Curate) on Aug 22, 2007 at 17:06 UTC | |
by suaveant (Parson) on Aug 22, 2007 at 18:02 UTC |