This paper describes details of the TSUKU machine translation system in the NTCIR-10 PatentMT task [8] . This system is an implementation of our tree-to-string statistical machine translation model that combines a context-free grammar (CFG) parse tree and a dependency parse tree.

The clinical presentation, course and treatment of methamphetamine (METH)-associated psychosis (MAP) are similar to that observed in schizophrenia (SCZ) and subsequently MAP has been hypothesized as a pharmacological and environmental model of SCZ. However, several challenges currently exist in diagnosing MAP accurately at the molecular and neurocognitive level before the MAP model can contribu...

In this paper, we study a classical discrete dynamical system, the Chip Firing Game, used as a model in physics, economics and computer science. We use order theory and show that the set of reachable states (i.e. the configuration space) of such a system started in any configuration is a lattice, which implies strong structural properties. The lattice structure of the configuration space of a d...

Much attention is currently focused on the scientific, ethical, and political implications of the draft sequence of the human genome. In line with this, the next issue of CFG will carry pieces from two researchers in the field of human genetics/genomics on the impact that the draft sequence will have on their research. Andrew Simpson (Ludwig Institute, Sao Paulo, Brazil) will review the importa...

Should probability play a role in linguistics? Whereas Chomsky (1957: 16–17) influentially rejected probability in syntactic theory, “[i]n phonological theory, probability has not so much been rejected as disregarded” (Coleman, 2003: 89). Disregard has, however, given way to a growing literature on the use of probability across the various linguistic sub-disciplines (see, e.g., Bod et al., 2003...

Grammar binarization is the process and result of transforming a grammar to an equivalent form whose rules contain at most two symbols in their right-hand side. Binarization is used, explicitly or implicity, by a wide range of parsers for contextfree grammars and other grammatical formalisms. Non-trivial grammars can be binarized in multiple ways, but in order to optimize the parser’s computati...