Paper: A Low-Complexity Broad-Coverage Probabilistic Dependency Parser For English

ACL ID N03-3006
Title A Low-Complexity Broad-Coverage Probabilistic Dependency Parser For English
Venue Human Language Technologies
Session Student Session
Year 2003
Authors
  • Gerold Schneider (University of Zurich, Zurich Switzerland; University of Geneva, Geneva Switzerland)

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, statisti- cal 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 linguis- tic foundations.