Lukas Faulstich wrote:
Hi,
in the context of software testing I'm faced with the problem of
comparing two large terms (the specified and the actual result of a
computation) and to find out how one term differs from the other. It
would be helpful to discover, for instance, that some subterm of term
A has moved to a different place in term B. In short, the algorithm
should compute a (minimal) tree edit script that converts term A into
term B.
Does anyone know of an existing prolog implementation for this?
No, but there a variety of algorithms with varying complexities to
compute the edit distance and associated edit script between two trees.
Googling for "tree edit distance" should be a good starting point.
Since the advent of XML, there has been lately a renewed interest in the
subject applied to XML document differencing.
ft.vcf
Description: Vcard
|
