Towards a Robuster Interpretive Parsing

Towards a Robuster Interpretive Parsing - Learning from Overt Forms in Optimality Theory

The input data to grammar learning algorithms often consist of overt forms that do not contain full structural descriptions. This lack of informationmay contribute to the failure of learning. Past work on Optimality Theory introduced Robust Interpretive Parsing (RIP) as a partial solution to this problem.We generalize RIP and suggest replacing the winner candidate with a weighted mean violation...

A Robuster Scott Rank

We give a new definition of Scott rank motivated by our main theorem: For every countable structure A and ordinal α < ω1, we have that: every automorphism orbit is Σ α -definable without parameters if and only if A has a Π α+1 Scott sentence, if and only if A is uniformly boldface ∆α-categorical. As a corollary, we show that a structure is computably categorical on a cone if and only if it is t...

Robust Interpretive Parsing in Metrical Stress Theory

Towards quality communication design in interpretive settings

The practice of communication design gives visual form to interpretation. Both are capable of profoundly affecting people’s knowledge, attitudes and behaviour. Interpretation projects provide designers with complex, eclectic and large scale design challenges, requiring collaboration with a diverse range of other professionals. The author’s research, based on interviews with graphic designers in...

Robuster Combiners for Oblivious Transfer

A (k;n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F , which is secure assuming that at least k of the input candidates are secure. Such constructions provide robustness against insecure implementations and wrong assumptions underlying the candidate schemes. In a recent work Harnik et al. (Eurocrypt 2005) have proposed a...