Sciweavers

236 search results - page 3 / 48
» Strong normalization results by translation
Sort
View
EMNLP
2009
13 years 7 months ago
Fast Translation Rule Matching for Syntax-based Statistical Machine Translation
In a linguistically-motivated syntax-based translation system, the entire translation process is normally carried out in two steps, translation rule matching and target sentence d...
Hui Zhang, Min Zhang, Haizhou Li, Chew Lim Tan
APLAS
2007
ACM
14 years 1 months ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama
VMCAI
2009
Springer
14 years 4 months ago
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
ACL
2008
13 years 11 months ago
Query-based Sentence Fusion is Better Defined and Leads to More Preferred Results than Generic Sentence Fusion
We show that question-based sentence fusion is a better defined task than generic sentence fusion (Q-based fusions are shorter, display less variety in length, yield more identica...
Emiel Krahmer, Erwin Marsi, Paul Pelt
JSYML
2006
98views more  JSYML 2006»
13 years 9 months ago
On weak and strong interpolation in algebraic logics
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
Saharon Shelah, Gábor Sági