562 search results - page 53 / 113 » Dependency Pairs Revisited |
114
click to vote
CONCUR
2003
Springer
15 years 7 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
116
Voted
AAAI
2007
15 years 4 months ago
2007
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
115
Voted
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
123
Voted
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
123
click to vote
JMLR
2011
14 years 8 months ago
2011
We propose a distance phrase reordering model (DPR) for statistical machine translation (SMT), where the aim is to learn the grammatical rules and context dependent changes using ...