Sciweavers

2475 search results - page 69 / 495
» On the accuracy of language trees
Sort
View
NIPS
2001
13 years 11 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning
ECML
2006
Springer
14 years 1 months ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
COLING
1996
13 years 11 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer
ICALP
2004
Springer
14 years 3 months ago
Tree-Walking Automata Cannot Be Determinized
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
Mikolaj Bojanczyk, Thomas Colcombet
POPL
1994
ACM
14 years 2 months ago
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph
We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and dele...
G. Ramalingam, Thomas W. Reps