Hierarchical phrase-based machine translation can capture global reordering with synchronous context-free grammar, but has little ability to evaluate the correctness of word orderings during decoding. We propose a method to integrate word-based reordering model into hierarchical phrasebased machine translation to overcome this weakness. Our approach extends the synchronous context-free grammar ...

We describe an approach to the automatic generation of convincing jazz melodies using probabilistic grammars. Uses of this approach include a software tool for assisting a soloist in the creation of a jazz solo over chord progressions. The method also shows promise as a means of automatically improvising complete solos in real-time. Our approach has been implemented and demonstrated in a free s...

In this paper we present conclusions, drawn from our research on context-aware systems. Based on reviewing the literature, from which we collected definitions of context and context awareness. We provide the basis for a taxonomy of context-aware systems grouped in eight categories. They include technical aspects of these systems as well as some views of privacy and security. Usefulness of taxon...

It is well known that, for context-free grammars, a leftmost derivation of a sentence univocally defines its syntactical tree; the construction of this tree consists of an iterative procedure during which two successive strings in the leftmost derivation are compared (see, e.g., [1, 2]). These -o r similar--properties do not hold for leftmost derivations in general phrase-structure grammars [3-...

Growing number and complexity of context-aware systems requires a modeling framework suited for comparison of approaches. As a step towards modeling context-aware systems, we describe basic elements of such a framework. We introduce internal and external context information and define context models. We describe two conceptual architectures for context-aware systems and present their implicatio...

By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated by this work, taking the obvious next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise an arc-consistency algorithm for context-free grammars, investigate when logic combi...

The paper describes the idea of bringing awareness to nomadic users. Based on a discussion of different context models and approaches to model context, several scenarios for awareness in context-aware systems are presented. We describe the combination of a context aware guidance system and an awareness platform to enable awareness for nomadic users about other users that are either in a similar...

In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because the patterns heavily utilize regular expressions, the pertinent tree structures are covered using a limited number of patterns. The probabilistic model is essentially a probabilistic context-free grammar (PCFG) approach...

This paper proposes a direct parsing of non-local dependencies in English. To this end, we use probabilistic linear context-free rewriting systems for data-driven parsing, following recent work on parsing German. In order to do so, we first perform a transformation of the Penn Treebank annotation of non-local dependencies into an annotation using crossing branches. The resulting treebank can be...