Rule based dependency parser for Polish language

Abstract

The paper presents a dependency parser for Polish language. It uses a simple chain of word combining rules operating on fully morphosyntactically tagged input instead of a formal grammar model or statistical learning. The proposed approach generates robust dependency trees and allows parsing of uncommon texts, such as poetry. This gives a significant advantage over current state-of-the-art dependency parsers.