On the Rule-Based Parsing of Czech

At the beginning of this article the parsing problem restricted to the need of this work is specified. Further, the results of the first attempts to modify the rules for RBA parsing of Czech is presented, the influence of the cardinality of the tag set size of the parsing success rates is studied and a second attempt at a wider modification of the rule templates is provided. The article contains the basic accompanying experimental results and aims to be a solid background and a starting point for any adaptation of the rule-based approach for the purposes of parsing of an inflective language within a dependency based framework.