7421 search results - page 40 / 1485 » In search of dependable design |
159
click to vote
EMNLP
2007
15 years 7 months ago
2007
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
172
click to vote
JAR
2006
15 years 6 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
118
click to vote
CONTEXT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In this paper we propose to re-read the past work on formalizing context as the search for a logic of the relationships between partial, approximate, and perspectival the...
156
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
165
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...