Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair parsing approaches achieve robustness by considering ungrammatical sentences as corrupted versions of valid sentences. In this article we present a deductive formalism, based on Sikkel’s parsing schemata, that can be ...

This study examined battered women's cognitive schema in relation to their cognitions about violence (i.e., the "meaning" attached to the violence), post-traumatic reactions to violence, and sexual victimization histories. Seventy-two battered women seeking help from an outpatient family violence clinic were subjects. The meaning of the violence (e.g., expectations of recurrent violence and of ...

A model for parallel computation called a schema is presented. This model is similar to that presented in the recent work of Karp and Miller 2 • Section 1 presents a description of the model, and some results on the characterization of computations within it. Section 2 stunIIlarizes some results on determinacy and equivalence. Section 3 presents a ~ormalization of the property of maximal parall...

We give a recursion-theoretic characterization of the complexity classes NC for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computati...

Abstract This paper introduces a uniform substitution calculus for $${\textsf {d{}L}} {}_{\text {CHP}}$$ d L CHP , the dynamic logic of communicating hybrid programs. Uniform enables parsimonious prover kernels ...