Sciweavers

662 search results - page 26 / 133
» Trees, Automata and XML
Sort
View
IWPT
2001
15 years 7 months ago
Bidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
Miguel A. Alonso, Víctor J. Díaz, Ma...
ICALP
1998
Springer
15 years 10 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
DEXA
2004
Springer
126views Database» more  DEXA 2004»
15 years 11 months ago
Detecting Content Changes on Ordered XML Documents Using Relational Databases
Abstract. Previous works in change detection on XML focused on detecting changes to text file using ordered and unordered tree model. These approaches are not suitable for detecti...
Erwin Leonardi, Sourav S. Bhowmick, T. S. Dharma, ...
DEXAW
2007
IEEE
124views Database» more  DEXAW 2007»
15 years 10 months ago
XML Query Optimisation: Specify your Selectivity
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
Sven Hartmann, Sebastian Link
NAACL
2001
15 years 7 months ago
Re-Engineering Letter-to-Sound Rules
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
Martin Jansche