Abstract | ||
---|---|---|
We present an algorithm for the correction of an XML document with respect to schema constraints expressed as a document type definition. Given a well-formed XML document t seen as a tree, a schema S and a non-negative threshold th, the algorithm finds every tree t′ valid with respect to S such that the edit distance between t and t′ is no higher than th. The algorithm is based on a recursive expl... |
Year | DOI | Venue |
---|---|---|
2014 | 10.1093/comjnl/bxt006 | The Computer Journal |
Keywords | Field | DocType |
XML processing,document-to-schema correction,tree edit distance | Document Schema Definition Languages,XML Schema (W3C),Document Definition Markup Language,Computer science,XML validation,Document Structure Description,RELAX NG,Theoretical computer science,XML schema,Document type definition | Journal |
Volume | Issue | ISSN |
57 | 5 | 0010-4620 |
Citations | PageRank | References |
5 | 0.44 | 21 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Joshua Amavi | 1 | 9 | 2.18 |
beatrice bouchou | 2 | 91 | 10.71 |
Agata Savary | 3 | 92 | 19.55 |