Semiring Parsing without Parsing

Add to your list(s) Download to your calendar using vCal

• Adam Lopez, University of Edinburgh
• Friday 20 November 2009, 12:00-13:00
• SW01, Computer Laboratory.

If you have a question about this talk, please contact Laura Rimell.

Machine translation, summarization, and parsing under most formalisms are examples of what is now popularly known as structured prediction. Semiring parsing is an algorithmic framework that elegantly describes structured problems: it combines deductive logic and probability, cleanly separating model specification from statistical inference via generic dynamic programming algorithms. However, two popular ingredients of modern NLP systems are missing from the semiring parsing abstraction: non-local features and approximate inference. I’ll talk about extending to semiring parsing to include these concepts, including the case in which we don’t use dynamic programming at all.

This talk is part of the NLIP Seminar Series series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• 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
• NLIP Seminar Series
• PMRFPS's
• SW01, Computer Laboratory
• Simon Baker's List
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.