We present a parser for German that achieves a competitive accuracy on unrestricted input while maintaining a coverage of 100%. By writing well-formedness rules as declarative, defeasible constraints that integrate different sources of linguistic knowledge, very high robustness is achieved against all sorts of extragrammatical constructions.

6 Syntactic ornaments in the binary language 21 6.1 From ornaments to projection . . . . . . . . . . . . . . . . . . . . . . . . . . 24 6.2 Syntax of the binary language . . . . . . . . . . . . . . . . . . . . . . . . . . 25 6.3 Projection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 6.4 Datatype environment . . . . . . . . . . . . . . . . . . . . . . . . . . ....

Syntax The abstract syntax is presented in a UML class diagram showing the metaclasses defining theconstructs and their relationships. The diagram also presents some of the well-formedness rules,mainly the multiplicity requirements of the relationships, and whether or not the instances of aparticular sub-construct must be ordered. Finally, a short informal description in natural...

Some runtime checks can be safely removed from code if appropriate program properties are proved. We describe how we have applied this idea to the ACL2 theorem prover to speed up the application of user-defined proof procedures. In particular, we discuss how and why we have added a new feature to ACL2 that allows the user to verify certain well-formedness properties of the expressions produced ...

Using data from ellipsis as evidence, this talk argues that a grammar formalism for natural languages should both articulate the process of building up interpretation in real time, and be sensitive to contextually provided information. Almost every natural language expression displays some form of context dependence. This is most obvious with anaphora and tense construal, but the effects go muc...

The Shape Calculus is a bio-inspired calculus for describing 3Dshapes moving in a space. A shape forms a 3D process when combinedwith a behaviour. Behaviours are specified with a timed CCS-like pro-cess algebra using a notion of channel that models naturally bindingsites on the surface of shapes. Processes can represent molecules orother mobile objects and can be part of net...

The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape forms a 3D process when combined with a behaviour. Behaviours are speci ed with a timed CCS-like process algebra using a notion of channel that models naturally binding sites on the surface of shapes. In this paper, the full formal timed operational semantics of the calculus is provided, together w...

P4 allows a new level of dynamism for routers beyond OpenFlow 1.4 by allowing headers and tables to be modified by software in the field. Without care, P4 can unleash a new wave of software bugs. Existing tools (e.g., VeriFlow, NetPlumber, Hassel, NoD) cannot model changes to forwarding behaviors without reprogramming tool internals or having users manually add new forwarding models. Further, a...

We present a novel well-formedness condition for underspecified semantic representations which requires that every correct MRS representation must be a net. We apply this condition to identify a set of eleven rules in the English Resource Grammar (ERG) with bugs in their semantics component, and thus demonstrate that the net test is useful in grammar debugging. In addition, we show that a partl...

How do grammars assess the well-formedness of words with multiple phonotactic violations? Certain models predict that as strength restrictions decrease, forms violate should be less acceptable than expected, in a pattern we term super-linear cumulativity. We test this prediction using series Artificial Grammar Learning experiments, which vary number exceptions to patterns artificial languages. ...