Editing an XML document manually is a complicated task. While many XML editors exist in
the market, we argue that some important functionalities are missing in all of them. Our goal …

The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for
XML manipulation languages. XML applications would benefit from the extension of REs …

We study the problem of, given a corpus of XML documents and its schema, finding an
optimal (generative) probabilistic model, where optimality here means maximizing the …

We consider the problem of repairing unranked trees (eg, XML documents) satisfying a
given restriction specification R (eg, a DTD) into unranked trees satisfying a given target …

Deterministic regular expressions (DREGs) are a core part of XML Schema and used in
other applications. But unlike regular expressions, DREGs do not have a simple syntax …

We study the problem of, given a corpus of XML documents and its schema, finding an
optimal probabilistic model (optimality meaning maximizing the likelihood of the corpus to be …

Deterministic regular expressions are a core part of XML Schema and used in other
applications. But unlike regular expressions, deterministic regular expressions do not have a …

We study the problem of bounded repairability of a given restriction tree language R into a
target tree language T. More precisely, we say that R is bounded repairable with respect to T …

Deterministic regular expressions are a core part of XML Schema and used in other
applications. But unlike regular expressions, deterministic regular expressions do not have a …

We study the problem of, given a corpus of XML documents and its schema, finding an
optimal (generative) probabilistic model, where optimality here means maximizing the …