Approximately matching context-free languages
Information Processing Letters
XIS: an XML document integration system
Proceedings of the 2005 ACM symposium on Document engineering
Proceedings of the 2006 ACM symposium on Applied computing
A multidimensional scaling approach for representing XML documents
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
An agent framework for recommendation
TELE-INFO'07 Proceedings of the 6th WSEAS Int. Conference on Telecommunications and Informatics
Xdiff+: a visualization system for XML documents and Schemata
Proceedings of the 46th Annual Southeast Regional Conference on XX
Structural and semantic aspects of similarity of Document Type Definitions and XML schemas
Information Sciences: an International Journal
Fast approximate matching between XML documents and schemata
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
| Hi-index | 0.00 |
Regular Hedge Grammar is a formal method to specify XML schema. XML document can be viewed as an ordered labeled tree. Computing the approximate matching between an XML document with a schema with minimum cost is not only theoretically interesting. This problem can be modeled as: Given an ordered labeled tree F and a regular hedge grammar P, how to compute the minimum edit distance to transform the forest F into F' so that F' is exactly matched by P. In this paper, with the introduction of leaf forest, we gave an algorithm for this problem in O(F2P(F + log P)) time, where F is the size of the forest and P is the size of the grammar. From the authors' knowledge, this is the first algorithm to transform an XML document (ordered labeled tree) to conform to a schema (tree grammar).