This paper presents the first empirical results to our knowledge on learning synchronous grammars that generate logical forms. Using statistical machine translation techniques, a semantic parser based on a synchronous context-free grammar augmented with λoperators is learned given a set of training sentences and their correct logical forms. The resulting parser is shown to be the bestperforming...

This proposal is an extension to the project “Generation in the Context of Machine Translation”, which is one of the projects done in the Johns Hopkins University Center for Speech and Language Processing 2002 summer workshop (WS02GMT). We first address some issues observed in WS02GMT which possibly leads to detrimental effects in machine translation performance. And hence we propose a new appr...

Experimental results from a frame size 180 brushless doubly fed (induction) machine (BDFM) fitted with four rotor designs are presented. The machine is intended for use as a variable speed generator, or drive. A per phase equivalent circuit for the machine has been developed and a method of obtaining parameters for the circuit is described. Expressions for the torque as a function of speed have...

This paper presents the simulation results of a grid-connected wind driven doubly fed induction machine (DFIM) together with some real machine performance results. The modeling of the machine considers operating conditions below and above synchronous speed, which are actually achieved by means of a double-sided PWM converter joining the machine rotor to the grid. In order to decouple the active...

Translation equivalence constitutes the basis of all Machine Translation systems including the recent hierarchical and syntax-based systems. For hierarchical MT research it is important to have a tool that supports the qualitative and quantitative analysis of hierarchical translation equivalence relations extracted from word alignments in data. In this paper we present such a toolkit and exempl...

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f +1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance threshold to n =...