Optimizing Rule-Based Morphosyntactic Analysis of Richly Inflected Languages — a Polish Example

We consider finite-state optimization of morphosyntactic analysis of richly and ambiguously annotated corpora. We propose a general algorithm which, despite being surprisingly simple, proved to be effective in several applications for rulesets which do not match frequently.