Evaluation of Dependency Parsers on Unbounded Dependencies
- 👤 Speaker: Laura Rimell - University of Cambridge
- 📅 Date & Time: Wednesday 28 July 2010, 12:00 - 12:30
- 📍 Venue: GS15, Computer Laboratory
Abstract
Joint work with Joakim Nivre, Ryan McDonald and Carlos Gómez-Rodríguez.
We evaluate two dependency parsers, MST Parser and MaltParser, with respect to their capacity to recover unbounded dependencies in English, a type of evaluation that has been applied to grammar-based parsers and statistical phrase structure parsers but not to dependency parsers. The evaluation shows that when combined with simple post-processing heuristics, the parsers correctly recall unbounded dependencies roughly 50% of the time, which is only slightly worse than two grammar-based parsers specifically designed to cope with such dependencies.
Series This talk is part of the NLIP Seminar Series series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge Forum of Science and Humanities
- Cambridge Language Sciences
- Cambridge talks
- Chris Davis' list
- Computer Education Research
- Computing Education Research
- Department of Computer Science and Technology talks and seminars
- Graduate-Seminars
- GS15, Computer Laboratory
- Guy Emerson's list
- Interested Talks
- Language Sciences for Graduate Students
- ndk22's list
- NLIP Seminar Series
- ob366-ai4er
- PMRFPS's
- rp587
- School of Technology
- Simon Baker's List
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Laura Rimell - University of Cambridge
Wednesday 28 July 2010, 12:00-12:30