1000 search results - page 51 / 200 » Dependency Tree Automata |
102
click to vote
LREC
2010
15 years 1 months ago
2010
This paper investigates the mapping between two semantic formalisms, namely the tectogrammatical layer of the Prague Dependency Treebank 2.0 (PDT) and (Robust) Minimal Recursion S...
116
click to vote
CGO
2009
IEEE
15 years 3 months ago
2009
IEEE
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
ICLP
2005
Springer
15 years 5 months 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...
102
click to vote
ACL
2010
14 years 10 months ago
2010
In this paper we describe an intuitionistic method for dependency parsing, where a classifier is used to determine whether a pair of words forms a dependency edge. And we also pro...
104
click to vote
NAACL
2010
14 years 9 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...