65 search results - page 5 / 13 » Some Results on Top-Context-Free Tree Languages |
EMNLP
2007
13 years 8 months ago
2007
A notable gap in research on statistical dependency parsing is a proper conditional probability distribution over nonprojective dependency trees for a given sentence. We exploit t...
MPC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
ICLP
2005
Springer
14 years 26 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...