Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact that they are normally trained using oracles that are deterministic and incomplete in the sense that they assume a unique canonical path through the transition system and are only valid as long as the parser does not stray from this path. In this paper, we give a gener...

in this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (dmus) in stochastic data envelopment analysis (dea) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. it is shown that this deterministic model can be converted to a quadratic programming model. so fa...

Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into deterministic parity automaton (DPA) by means of Safra-Piterman construction. One challenges size DPA, which often grows very fast in practice, and can reach double exponential length formula. In this paper, we describe single ...