Parsing unrestricted German text with defeasible constraints

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 di#erent sources of linguistic knowledge, very high robustness is achieved against all sorts of extragrammatical constructions