Sciweavers

2475 search results - page 44 / 495
» On the accuracy of language trees
Sort
View
LICS
2002
IEEE
14 years 3 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
ACL
1992
13 years 11 months ago
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
David J. Weir
NIPS
2001
13 years 11 months ago
Convolution Kernels for Natural Language
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...
Michael Collins, Nigel Duffy
APLAS
2003
ACM
14 years 3 months ago
Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
Shin-Cheng Mu, Richard S. Bird
ADBIS
2004
Springer
111views Database» more  ADBIS 2004»
14 years 3 months ago
A High-Level Language for Specifying XML Data Transformations
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
Tadeusz Pankowski