In this paper, we propose a paraphrasing model to address the task of system combination for machine translation. We dynamically learn hierarchical paraphrases from target hypotheses and form a synchronous context-free grammar to guide a series of transformations of target hypotheses into fused translations. The model is able to exploit phrasal and structural system-weighted consensus and also ...

We report experimental work on improving learning methods for probabilis-tic context-free grammars (PCFGs). From stacked regression we borrow the basic idea of combining grammars. Smoothing, a domain-independent method for combining grammars, does not ooer noticeable performance gains. However , PCFGs allow much tighter, domain-dependent coupling, and we show that this may be exploited for sign...

We propose several improvements to the hierarchical phrase-based MT model of Chiang (2005) and its syntax-based extension by Zollmann and Venugopal (2006). We add a source-span variance model that, for each rule utilized in a probabilistic synchronous context-free grammar (PSCFG) derivation, gives a confidence estimate in the rule based on the number of source words spanned by the rule and its ...

Dietary behaviour is an important lifestyle aspect and directly related to long-term health. We present an approach to detect eating and drinking intake cycles from body-worn sensors. Information derived from the sensors are considered as abstract activity events and a sequence modelling is applied utilising probabilistic context-free grammars. Different grammar models are discussed and applied...

In our everyday life, we communicate with each other within a certain context; our actions are also within a certain context. Events affect every aspect of human life. The importance of the context also influences how we interact with the environment and how technologies provide services for us. The Context is generally regarded as data or information which describes the situation that is relev...

Theoretical results on HTN planning are mostly related to the plan existence problem. In this paper, we study the structure of the generated plans in terms of the language they produce. We show that such languages are always context-sensitive. Furthermore we identify certain subclasses of HTN planning problems which generate either regular or context-free languages. Most importantly we have dis...

This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the generative power and that these systems are comp...

Context-aware systems are applications that adapt to several situations involving user, network, data, hardware and the application itself. Researchers in context-awareness have concentrated on how to capture context data and to carry it to the application. In this paper, we study the impact of context on the core of the application. First, we give the guidelines of a context model based on a m...

Context-awareness is emerging as an essential component of many user-focused software domains. It is especially integral to pervasive or ambient computing, but can be used to control the behaviour of any system that adapts to the circumstances in which it is used. Like most new software projects, many existing context-aware systems have been constructed using objector component-oriented program...

In this work we propose methods to label probabilistic synchronous context-free grammar (PSCFG) rules using only word tags, generated by either part-of-speech analysis or unsupervised word class induction. The proposals range from simple tag-combination schemes to a phrase clustering model that can incorporate an arbitrary number of features. Our models improve translation quality over the sing...