A low-complexity, broad-coverage probabilistic Dependency Parser for English

Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this problem by combining finite-state approaches, statistical parsing techniques and engineering knowledge, thus keeping parsing complexity as low as possible at the cost of a slight decrease in performance. The parser is robust and fast and at the same time based on strong linguistic foundations.

• Type: Conference
• Year: 2003
• Where: NAACL
• Authors: Gerold Schneider
• Keywords: Large-scale Parsing, NAACL 2003, NAACL 2007, Parsing, Statistical Parsing Techniques