Paper: A Cascaded Finite-State Parser For Syntactic Analysis Of Swedish

ACL ID E99-1035
Title A Cascaded Finite-State Parser For Syntactic Analysis Of Swedish
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1999
Authors

This report describes the development of a parsing system for written Swedish and is focused on a grammar, the main component of the system, semi- automatically extracted from corpora. A cascaded, finite-state algorithm is ap- plied to the grammar in which the input contains coarse-grained semantic class information, and the output produced reflects not only the syntactic structure of the input, but grammatical functions as well. The grammar has been tested on a variety of random samples of dif- ferent text genres, achieving precision and recall of 94.62% and 91.92% respec- tively, and average crossing rate of 0.04, when evaluated against manually disam- biguated, annotated texts.