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

• Type: Conference
• Year: 2004
• Where: CSLP
• Authors: Kilian A. Foth, Michael Daum, Wolfgang Menzel
• Keywords: Competitive Accuracy, CSLP 2004, Defeasible Constraints, Natural Language Processing, Unrestricted Input