1000 search results - page 49 / 200 » Dependency Tree Automata |
101
click to vote
FORTE
2007
15 years 1 months ago
2007
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...
CG
2010
Springer
14 years 11 months ago
2010
Springer
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as in...
104
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
112
click to vote
EMNLP
2010
14 years 9 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
109
click to vote
ACL
2009
14 years 9 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...