On 23/03/2008, Guy Van den Broeck guyvdb@gmail.com wrote:
It's reasonably fast for medium sized documents. The problem is that it relies on a word-for-word LCS pass which means that the number of elements increases with (let's say a line has an average of 30 words) a factor 30 and the maximum execution time increases by 900. In Daisy this has not shown to be a problem. There are heuristics that work in constant time and in practice the LCS complexity is O(N) in stead of O(N²). Performance might still be a problem though and investigating all options in that department would be part of the project itself.
Ahh, yeah, you'd need a better algorithm :-)
Still, it's pretty darn shiny and a highly desirable thing!
- d.