621 search results - page 78 / 125 » Parsing As Tree Traversal |
138
Voted
ACL
2006
15 years 10 days ago
2006
This paper proposes a novel composite kernel for relation extraction. The composite kernel consists of two individual kernels: an entity kernel that allows for entity-related feat...
82
Voted
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
113
click to vote
TIC
2000
Springer
15 years 2 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
AMAST
2008
Springer
15 years 29 days ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
83
Voted
PPSC
2001
15 years 9 days ago
2001
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...