Re: How to achieve scalability

The Frog <Mr.Frog.to.you@[EMAIL PROTECTED]
> wrote in news:74a5e2d0-406b-
4292-8732-b1b714e0a244@[EMAIL PROTECTED]
> OK, here is a quick test on the simil() function done in vba as
> follows:
> 
> Debug.Print "Start time: " & Now()
> For i = 1 To 700000
>     score = Simil("The Yummy and Tasty Waffle Cor****ation",
> "TASTYWAFFLE")
> Next
> Debug.Print "Finish time: " & Now()
> Debug.Print score
> 
> and the results are:
> Start time: 4/07/2008 9:19:55 AM
> Finish time: 4/07/2008 9:21:13 AM
>  0.448979591836735

No need for Viagra here; the process is already incredibly long.
> 
> I would love to run a test with this using SALAD's ShortName function
> and see if the score is higher.

I called ShortName with your parameters for a million iterations. Took 
six seconds.

I ran the a RegExp with the same functionanlity. Took one second.

> To answer Lyle's "Why Not?" : The difference between probability and
> certainty. While ambiguity exists you can only ever assign a
> probability that one one thing is another (or equal to another), and
> as such there is always a margin of error (a chance they are not the
> same). As a result you cannot guarantee 100% effectiveness for any
> query of this type where a probabilistic determination is involved.
> The best you can do manage / minimise the risks by setting your P
> cutoff threshold high enough for the result of the query to be
> considered significant enough to be trusted.

There is no certainty, except that CDMA will have a whole bunch of stupid 
posts. But I am SURE I could run a regexp 10^n (where n is a very large 
number) times without any error .