2006 | OriginalPaper | Buchkapitel
Reductionistic, Tree and Rule Based Tagger for Polish
verfasst von : Maciej Piasecki, Grzegorz Godlewski
Erschienen in: Intelligent Information Processing and Web Mining
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The paper presents an approach to tagging of Polish based on the combination of handmade reduction rules and selecting rules acquired by Induction of Decision Trees. The general open architecture of the tagger is presented, where the overall process of tagging is divided into subsequent steps and the overall problem is reduced to subproblems of ambiguity classes. A special language of constraints and the use of constraints as elements of decision trees are described. The results of the experiments performed with the tagger are also presented.