Not logged in.
Quick Search - Contribution
Contribution Details
| Type | Conference or Workshop Paper |
| Scope | Discipline-based scholarship |
| Published in Proceedings | No |
| Title | A low-complexity, broad-coverage probabilistic Dependency Parser for English |
| Item Subtype | Original Work |
| Refereed | Yes |
| Status | Published in final form |
| Event Title | Proceedings of NAACL/HLT 2003 Student session |
| Place of Publication | Edmonton, Canada |
| Abstract Text | 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. |
| Export |
BibTeX
EP3 XML (ZORA)
|