Write conclusion

Question

Closed this issue 8 years ago · 9 comments

I have started a bit on the conclusion, not quite sure what to write though

Answer 1 · 2017-01-23T18:32:42.000Z

Here is some of my opinion:

our experiment result shows the complexity of approximate kleenex goes too large (and some other problem like cache usage), and is not practical for real world approximate matching because there are many limitations on using it, such as k<=2 or the pattern can only be short ones. It could be some implementation problems (such as coding) as the theory seems no problem (? maybe). It is worth investigating further and optimize it to make it more practical.
For approximate matching problem, kleenex can try to be more flexible to patterns just like NR-grep, dealing with different patterns (depending on the length or the number of errors) with different methods

Answer 2 · 2017-01-23T19:26:31.000Z

I've fleshed it out some more, anything else you think should be added?

Answer 3 · 2017-01-23T19:50:39.000Z

I'll also take a look now.

Answer 4 · 2017-01-23T20:30:54.000Z

I can't really think of what to add.

Answer 5 · 2017-01-23T20:47:48.000Z

So it seems we're about done. Anything to add, or should we just turn in?

Answer 6 · 2017-01-23T20:50:43.000Z

Nothing to add 👍

Answer 7 · 2017-01-23T20:51:18.000Z

Yeah, I guess it's okay to hand it in now. Who'll do it?

Answer 8 · 2017-01-23T20:53:55.000Z

I just did, but it's probably fine if you do it too.

Answer 9 · 2017-01-23T21:13:34.000Z

Nice ! 🥇