LREC 2000 2nd International Conference on Language Resources & Evaluation
 

Previous Paper   Next Paper

Title A Robust Parser for Unrestricted Greek Text
Authors Boutsis Sotiris (Institute for Language and Speech Processing, Artemidos 6 & Epidavrou, 151 25 Maroussi, Greece, sboutsis@ilsp.gr)
Prokopidis Prokopis (Institute for Language and Speech Processing, Artemidos 6 & Epidavrou, 151 25 Maroussi, Greece, prokopis@ilsp.gr)
Giouli Voula (Institute for Language and Speech Processing, Artemidos 6 & Epidavrou, 151 25, Athens, Greece, tel: +301 6875300, fax: +301 6854270, voula@ilsp.gr)
Piperidis Stelios (Institute for Language and Speech Processing, Artemidos 6 & Epidavrou, 151 25, Athens, Greece, tel: +301 6875300, fax: +301 6854270, spip@ilsp.gr)
Keywords Finite State Transducers, Greek, Partial Parsing
Session Session WP2 - Corpus Annotation
Full Paper 174.ps, 174.pdf
Abstract In this paper we describe a method for the efficient parsing of real-life Greek texts at the surface syntactic level. A grammar consisting of non-recursive regular expressions describing Greek phrase structure has been compiled into a cascade of finite state transducers used to recognize syntactic constituents. The implemented parser lends itself to applications where large scale text processing is involved, and fast, robust, and relatively accurate syntactic analysis is necessary. The parser has been evaluated against a ca 34000 word corpus of financial and news texts and achieved promising precision and recall scores.