Sciweavers

CSLP
2004
Springer

Parsing Unrestricted German Text with Defeasible Constraints

14 years 4 months ago
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.
Kilian A. Foth, Michael Daum, Wolfgang Menzel
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where CSLP
Authors Kilian A. Foth, Michael Daum, Wolfgang Menzel
Comments (0)