The hierarchical phrase-based (HPB) model on the basis of a synchronous context-free grammar (SCFG) is prominent in solving global reorderings. However, the HPB model is inadequate to supervise the reordering process so that sometimes positions of different lexicons are switched due to the incorrect SCFG rules. In this paper, we consider the order of two lexicons as a classification problem and...

this essay examines greetings as one of the elements of politeness in a nigerian community and how it influences the cultural characteristics of the people. to analyze, this essay makes use of speech act theory and politeness principle and also considers the pragmatic context in analyzing different types of greetings such as condolences, departure and arrival, rejoicing, daily greetings, casual...

health policy has been termed a ‘chameleon concept’, referring to its ability to take on different forms of disciplinarity as well as different roles and functions. this paper extends paton’s analysis by exploring the paradox of health policy as a field of academic inquiry—sitting across many of the boundaries of social science but also marginalised by them. it situates contemporary approaches ...

Let S be a complete star-omega semiring and Σ be an alphabet. For a weighted ω-restricted one counter automaton C with stateset {1, . . . ,n}, n ≥ 1, we show that there exists a mixed algebraic system over a complete semiringsemimodule pair ((S ≪ Σ∗ ≫)n×n, (S ≪ Σω ≫)n) such that the behavior ‖C‖ of C is a component of a solution of this system. In case the basic semiring is B or N∞ we show that...

Context-aware systems observe the user’s current context and apply this information to the user’s benefit. When implementing context-awareness, several issues need to be considered and this paper concentrates on presenting the context information to the user. The key components needed to construct the context are identified, and a model, which allows using different visualization techniques for...

We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are nonoptimal, in the sense that a collection of probability distributions cannot be obtained. In particular, some probability distributions expressible in terms of a context-free grammar cannot be expressed in terms of the LR parser constructed from tha...

We present a heuristic technique for converting a constituency treebank into a dependency treebank. In particular, we comment on our experience in converting the Spanish treebank Cast3LB. We extract a context-free grammar from the treebank, automatically identify the head in each rule, and use this information for constructing the dependency tree. Our heuristics have 99% precision and 80% recal...

Muller context-free languages (MCFLs) are languages of countable words, that is, labeled countable linear orders, generated by Muller context-free grammars. Equivalently, they are the frontier languages of (nondeterministic Muller-)regular languages of infinite trees. In this article we survey the known results regarding MCFLs, and show that a language is an MCFL if and only if it can be genera...

The existing personalization systems typically base their services on general user models that ignore the issue of context-awareness. This position paper focuses on developing mechanisms for cross-context reasoning of the user models, which can be applied for the context-aware per-sonalization. The reasoning augments the sparse user models by inferring the missing information from other context...

We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Schupp, our result gives a logical characterization of context-free groups and also proves a conjecture of Schupp. To derive this result, we investigate general graphs and show that a graph of bounded degree with a high degree of...