Sciweavers

664 search results - page 19 / 133
» The tree Constraint
Sort
View
ACL
1997
14 years 11 months ago
A Uniform Approach to Underspecification and Parallelism
We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express e...
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg
TPLP
2008
89views more  TPLP 2008»
14 years 9 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
ACL
2010
14 years 7 months ago
Exploring Syntactic Structural Features for Sub-Tree Alignment Using Bilingual Tree Kernels
We propose Bilingual Tree Kernels (BTKs) to capture the structural similarities across a pair of syntactic translational equivalences and apply BTKs to sub-tree alignment along wi...
Jun Sun, Min Zhang, Chew Lim Tan
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
15 years 2 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
FOIKS
2010
Springer
15 years 1 months ago
On the Existence of Armstrong Data Trees for XML Functional Dependencies
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
Sven Hartmann, Henning Köhler, Thu Trinh