In this paper, we describe the design, implementation, and evalutation of a system for checking NP agreement in German texts. We use shallow parsing based on finite state automata in combination with constraint relaxation and a method for parse ranking based on optimality theory. The system’s grammar was developed and tested over a reference corpus of about 800,000 words to ensure robustness and broad coverage. When evaluated against a corpus of approximately 200,000 words, the system reached recall and precision values around the 67 % mark.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.