The "handedness" of language: Directional symmetry breaking of sign usage in words

Language, which allows complex ideas to be communicated through symbolic sequences, is a characteristic feature of our species and manifested in a multitude of forms. Using large written corpora for many different languages and scripts, we show that the occurrence probability distributions of signs at the left and right ends of words have a distinct heterogeneous nature. Characterizing this asymmetry using quantitative inequality measures, viz. information entropy and the Gini index, we show that the beginning of a word is less restrictive in sign usage than the end. This property is not simply attributable to the use of common affixes as it is seen even when only word roots are considered. We use the existence of this asymmetry to infer the direction of writing in undeciphered inscriptions that agrees with the archaeological evidence. Unlike traditional investigations of phonotactic constraints which focus on language-specific patterns, our study reveals a property valid across languages and writing systems. As both language and writing are unique aspects of our species, this universal signature may reflect an innate feature of the human cognitive phenomenon.Comment: 10 pages, 4 figures + Supplementary Information (15 pages, 8 figures), final corrected versio

The control theory of motion-based communication: problems in teaching robots to dance

The paper describes results on two components of a research program focused on motion-based communication mediated by the dynamics of a control system. Specifically we are interested in how mobile agents engaged in a shared activity such as dance can use motion as a medium for transmitting certain types of messages. The first part of the paper adopts the terminology of motion description languages and deconstructs an elementary form of the well-known popular dance, Salsa, in terms of four motion primitives (dance steps). Several notions of dance complexity are introduced. We describe an experiment in which ten performances by an actual pair of dancers are evaluated by judges and then compared in terms of proposed complexity metrics. An energy metric is also defined. Values of this metric are obtained by summing the lengths of motion segments executed by wheeled robots replicating the movements of the human dancers in each of the ten dance performances. Of all the metrics that are considered in this experiment, energy is the most closely correlated with the human judges' assessments of performance quality. The second part of the paper poses a general class of dual objective motion control problems in which a primary objective (artistic execution of a dance step or efficient movement toward a specified terminal state) is combined with a communication objective. Solutions of varying degrees of explicitness can be given in several classes of problems of communicating through the dynamics of finite dimensional linear control systems. In this setting it is shown that the cost of adding a communication component to motions that steer a system between prescribed pairs of states is independent of those states. At the same time, the optimal encoding problem itself is shown to be a problem of packing geometric objects, and it remains open. Current research is aimed at solving such communication-through-action problems in the context of the motion control of mobile robots.Support for this work is gratefully acknowledged to ODDR&E MURI07 Program Grant Number FA9550-07-1-0528, the National Science Founda tion ITR Program Grant Number DMI-0330171, and the Office of Naval Research, and by ODDR&E MURI10 Program Grant Number N00014-10- 1-0952. (FA9550-07-1-0528 - ODDRE MURI07; DMI-0330171 - National Science Foundation ITR Program; Office of Naval Research; N00014-10-1-0952 - ODDRE MURI10

A Support Tool for Tagset Mapping

Many different tagsets are used in existing corpora; these tagsets vary according to the objectives of specific projects (which may be as far apart as robust parsing vs. spelling correction). In many situations, however, one would like to have uniform access to the linguistic information encoded in corpus annotations without having to know the classification schemes in detail. This paper describes a tool which maps unstructured morphosyntactic tags to a constraint-based, typed, configurable specification language, a ``standard tagset''. The mapping relies on a manually written set of mapping rules, which is automatically checked for consistency. In certain cases, unsharp mappings are unavoidable, and noise, i.e. groups of word forms {\sl not} conforming to the specification, will appear in the output of the mapping. The system automatically detects such noise and informs the user about it. The tool has been tested with rules for the UPenn tagset \cite{up} and the SUSANNE tagset \cite{garside}, in the framework of the EAGLES\footnote{LRE project EAGLES, cf. \cite{eagles}.} validation phase for standardised tagsets for European languages.Comment: EACL-Sigdat 95, contains 4 ps figures (minor graphic changes

Anticipation as prediction in the predication of data types

Every object in existence has its type. Every subject in language has its predicate. Every intension in logic has its extension. Each therefore has two levels but with the fundamental problem of the relationship between the two. The formalism of set theory cannot guarantee the two are co-extensive. That has to be imposed by the axiom of extensibility, which is inadequate for types as shown by Bertrand Russell's rami ed type theory, for language as by Henri Poincar e's impredication and for intension unless satisfying Port Royal's de nitive concept. An anticipatory system is usually de ned to contain its own future state. What is its type? What is its predicate? What is its extension? Set theory can well represent formally the weak anticipatory system, that is in a model of itself. However we have previously shown that the metaphysics of process category theory is needed to represent strong anticipation. Time belongs to extension not intension. The apparent prediction of strong anticipation is really in the structure of its predication. The typing of anticipation arises from a combination of and | respectively (co) multiplication of the (co)monad induced by adjointness of the system's own process. As a property of cartesian closed categories this predication has signi cance for all typing in general systems theory including even in the de nition of time itself

Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability

Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and the associated Universal Distribution are (or should be) of the greatest importance in science. Here we investigate the emergence, the rates of emergence and convergence, and the Coding-theorem like behaviour of AP in Turing-subuniversal models of computation. We investigate empirical distributions of computing models in the Chomsky hierarchy. We introduce measures of algorithmic probability and algorithmic complexity based upon resource-bounded computation, in contrast to previously thoroughly investigated distributions produced from the output distribution of Turing machines. This approach allows for numerical approximations to algorithmic (Kolmogorov-Chaitin) complexity-based estimations at each of the levels of a computational hierarchy. We demonstrate that all these estimations are correlated in rank and that they converge both in rank and values as a function of computational power, despite fundamental differences between computational models. In the context of natural processes that operate below the Turing universal level because of finite resources and physical degradation, the investigation of natural biases stemming from algorithmic rules may shed light on the distribution of outcomes. We show that up to 60\% of the simplicity/complexity bias in distributions produced even by the weakest of the computational models can be accounted for by Algorithmic Probability in its approximation to the Universal Distribution.Comment: 27 pages main text, 39 pages including supplement. Online complexity calculator: http://complexitycalculator.com

CapablePtrs: Securely Compiling Partial Programs using the Pointers-as-Capabilities Principle

Capability machines such as CHERI provide memory capabilities that can be used by compilers to provide security benefits for compiled code (e.g., memory safety). The C to CHERI compiler, for example, achieves memory safety by following a principle called "pointers as capabilities" (PAC). Informally, PAC says that a compiler should represent a source language pointer as a machine code capability. But the security properties of PAC compilers are not yet well understood. We show that memory safety is only one aspect, and that PAC compilers can provide significant additional security guarantees for partial programs: the compiler can provide guarantees for a compilation unit, even if that compilation unit is later linked to attacker-controlled machine code. This paper is the first to study the security of PAC compilers for partial programs formally. We prove for a model of such a compiler that it is fully abstract. The proof uses a novel proof technique (dubbed TrICL, read trickle), which is of broad interest because it reuses and extends the compiler correctness relation in a natural way, as we demonstrate. We implement our compiler on top of the CHERI platform and show that it can compile legacy C code with minimal code changes. We provide performance benchmarks that show how performance overhead is proportional to the number of cross-compilation-unit function calls