On 19 July 2010 19:46, tedd tedd.sperl...@gmail.com wrote:
At 12:39 PM +0100 7/19/10, Richard Quadling wrote:
I'm using MS SQL, not mySQL.
Found a extended stored procedure with a UDF.
Testing it looks excellent.
Searching for a match on 30,000 vehicles next to no additional time -
a few
At 12:39 PM +0100 7/19/10, Richard Quadling wrote:
I'm using MS SQL, not mySQL.
Found a extended stored procedure with a UDF.
Testing it looks excellent.
Searching for a match on 30,000 vehicles next to no additional time -
a few seconds in total, compared to the over 3 minutes to search
On Mon, Jul 19, 2010 at 2:46 PM, tedd tedd.sperl...@gmail.com wrote:
At 12:39 PM +0100 7/19/10, Richard Quadling wrote:
I'm using MS SQL, not mySQL.
Found a extended stored procedure with a UDF.
Testing it looks excellent.
Searching for a match on 30,000 vehicles next to no additional
At 12:09 PM -0400 7/15/10, Daniel P. Brown wrote:
On Thu, Jul 15, 2010 at 11:54, Richard Quadling rquadl...@gmail.com wrote:
I'm looking for is a way to compare what they've entered against a
known list and to provide my 10 best guesses.
Look into the following functions and families:
There is an algorithm called longest common sub sequence.
If you can find the longest common sub sequence of the strings of
database for the given string and sort it, you'll get the most matched
word.
But I think this algo is developed already and available in your
context. It's name can be
On 15 July 2010 17:09, Daniel P. Brown daniel.br...@parasane.net wrote:
Look into the following functions and families:
levenshtein()
similar_text()
Having just found a levenshtein() UDF for MS SQL [1]
I'm very impressed.
Thank you for the suggestion.
Regards,
Richard.
On Fri, Jul 16, 2010 at 07:09, Richard Quadling rquadl...@gmail.com wrote:
Having just found a levenshtein() UDF for MS SQL [1]
I'm very impressed.
Thank you for the suggestion.
Regards,
Richard.
[1] http://www.sqlteam.com/forums/topic.asp?TOPIC_ID=51540whichpage=2#425160
Dear
On 16 July 2010 13:47, Daniel P. Brown daniel.br...@parasane.net wrote:
On Fri, Jul 16, 2010 at 07:09, Richard Quadling rquadl...@gmail.com wrote:
Having just found a levenshtein() UDF for MS SQL [1]
I'm very impressed.
Thank you for the suggestion.
Regards,
Richard.
[1]
Hi.
It seems that users cannot enter a vehicle registration 100% accurately.
We have recently released a small mobile web app which allows service
engineers/inspectors to enter a vehicle registration number and a pin
number to get service history for the vehicle.
We are getting around a 40%
On Thu, 2010-07-15 at 16:54 +0100, Richard Quadling wrote:
Hi.
It seems that users cannot enter a vehicle registration 100% accurately.
We have recently released a small mobile web app which allows service
engineers/inspectors to enter a vehicle registration number and a pin
number to
On Thu, Jul 15, 2010 at 11:54, Richard Quadling rquadl...@gmail.com wrote:
I'm looking for is a way to compare what they've entered against a
known list and to provide my 10 best guesses.
Look into the following functions and families:
levenshtein()
similar_text()
You
11 matches
Mail list logo