Finding an optimum edit script between an XML document and a DTD

Nobutaka Suzuki
2005 Proceedings of the 2005 ACM symposium on Applied computing - SAC '05  
Finding optimum and near optimum edit scripts between an XML document and a schema is essential to correcting invalid XML documents. In this paper, we consider finding K optimum edit scripts between an XML document and a regular tree grammar. We first prove that the problem is NP-hard. We next show a pseudopolynomial-time algorithm for solving the problem.
doi:10.1145/1066677.1066825 dblp:conf/sac/Suzuki05 fatcat:tabhsfkc6fh6tlwdaawjmlekae