I don't quite see how that would help - What I need to do is compare 2 documents, and have the differences highlighted - added text in red, deleted text struck out, etc.
Whilst this may be possible (with a great deal of iteration) using this algorithm, I think I would be better served using an existing piece of software (unless someone has complete source code for doing this :) ).
If anyone has any experience in doing this from CF, that would be really useful...
>You should take a look at the levenshtein distance algorithm :-) This is
>to create a cost path using a generated matrix of words. Simple line by
>line comparisons are very difficult with string comparisons because you
>need to find the original locations before add, edit and delete actions.
>Micha Schopman
>Software Engineer
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings] [Donations and Support]
