A BSTRACT We propose a context-dependent approach to the study of political information. Combining a content analysis of broadcast news with a national survey measuring public awareness of various events, issues, and individuals in the news, we show that properties of national media systems influence both the supply of news and citizens’ awareness of events in the news. Public service-oriented ...

We use evolutionary algorithms to speed up a rather complex process, the tree adjoining grammars parsing. This improvement is due due to a linear matching function which compares the fitness of different individuals. Internally, derived trees are processed as tree-to-string representations. Moreover, we present some practical results and a post running analysis that may encourage the use of evo...

Propagating scattered context grammars, introduced in [3], represent an important type of semi-parallel rewriting systems. Since their introduction, however, the exact relationship of the family of languages they generate to the family of context-sensitive languages is unknown. The language family generated by these grammars is included in the family of context-sensitive languages; on the other...

The literature on predicates of personal taste (PPTs) has focused on a surprisingly limited range of expressions. This narrow focus has led to problematic theoretical conclusions about the syntax and semantics. I argue that PPTs are an instance of a more interesting general category of (what I call) evaluational predicates. Like other gradable adjectives, PPTs are sensitive to a relevant degree...

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 tutorial will describe the use of a factored probabilistic sequence model for parsing speech and text using a bounded store of three to four incomplete constituents over time, in line with recent estimates of human shortterm working memory capacity. This formulation uses a grammar transform to minimize memory usage during parsing. Incremental operations on incomplete constituents in this t...

Starting from a question by Dan Sperber, we analyze the expressive power of massively modular systems from a computational point of view. The key operation is introducing a non-computational component, a limited amount of resources to be shared among the modules. A case study is provided showing that such systems are flexible and context-sensitive, also having interesting cognitive features suc...