Analysing biomedical text with the Stanford dependency grammar
- đ¤ Speaker: Andrew Clegg, Birkbeck, University of London
- đ Date & Time: Friday 19 October 2007, 12:00 - 13:00
- đ Venue: SW01 Computer Laboratory
Abstract
The Stanford parser and natural language tools come with a dependency grammar and a deterministic algorithm for mapping from standard Penn Treebank-style parse trees to dependency graphs. We have shown how this provides a lingua franca for comparing various statistical parsers on biomedical text, using benchmarking methods that highlight deficiencies in their behaviour much better than tree-based analyses. We also believe dependency graphs offer a tractable intermediate step between syntax and semantics and have developed some simple approaches to information extraction based on graph traversal.
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
- 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
- SW01 Computer Laboratory
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Andrew Clegg, Birkbeck, University of London
Friday 19 October 2007, 12:00-13:00