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

Schneider, G (2003). A low-complexity, broad-coverage probabilistic Dependency Parser for English. In: NAACL/HLT 2003 Student session, Edmonton, Canada, May 2003.

## Abstract

Large-scale parsing is still a complex and time-consuming process, often so much that it is in-feasible in real-world applications. The parsing system described here addresses this problem by combining finite-state approaches, statistical parsing techniques and engineering knowl- edge, 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.

## Abstract

Large-scale parsing is still a complex and time-consuming process, often so much that it is in-feasible in real-world applications. The parsing system described here addresses this problem by combining finite-state approaches, statistical parsing techniques and engineering knowl- edge, 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.