Probabilistic and Rule-Based Tagger of an Inflective Language- a Comparison

Abstract

We present results of probabilistic tagging of Czech texts in order to show how these techniques work for one of the highly morphologically ambiguous inflective languages. After description of the tag system used, we show the results of four experiments using a simple probabilistic model to tag Czech texts (unigram, two bigram experiments, and a t r igram… (More)

Topics

17 Figures and Tables