Wow

I'm impressed...

When you say very CPU intensive - how intensive are we talking?

I am planning on doing the comparison as a one time task, when a new version of a document is uploaded...

Problem is, some of the documents may be upto a couple of hundred pages long...

If you do have any more info, I'd be grateful - I think for me to create such a procedure from scratch may be beyond the scope of this project...

Also, I think the rendering of content changes may be a little awkward - its really the content, and not the source html I want to compare - which would be easy enough to strip out from the html - but it would then be quite hard to render the resulting redline document with formatting preserved...

Thanks

Dan

>I came up with the algorithm because I have some experience with this
>subject, I haven't found any custom tags being able to compare
>documents, so I had to create one for a client last week. I don't have
>the tag by hand, unfortunately. What you have to do is split the strings
>create a matrix, and loop through the matrix to find the highest cost.
>Compare this cost to the minimal, diagonal and horizontal cost and you
>are able to find whether the string is added, modified or removed from
>the version. The process is very cpu intensive when running on
>ColdFusion, especially creating the matrix which is len(chars) *
>len(chars) in length.
>
>I also made a PHP implementation which was way more faster than
>ColdFusion did.
>
>
>Micha Schopman
>Software Engineer
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings] [Donations and Support]

Reply via email to