University of Cambridge > Talks.cam > NLIP Seminar Series > Incremental CCG parsing and its applications

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Incremental CCG parsing and its applications

Download to your calendar using vCal

If you have a question about this talk, please contact Kris Cao .

In this talk, we first present an incremental algorithm for transition-based CCG parsing. As previously available shift-reduce CCG parsers use CCGbank derivations which are mostly right branching and non-incremental, we design our algorithm based on the dependencies resolved rather than the derivation. Our novel algorithm builds a dependency graph in parallel to the CCG derivation which is used for revealing the unbuilt structure without backtracking.

We then show the usefulness of an incremental CCG parser for predicting relative sentence complexity. Given a pair of sentences from wikipedia and simple wikipedia, we build a classifier which predicts if one sentence is simpler/complex than the other. We show that features from a CCG parser in general and incremental CCG parser in particular are more useful than a chart-based phrase structure parser both in terms of speed and accuracy.

This talk is part of the NLIP Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Lecture Theatre 1, Computer Laboratory Part II Lecture Theatre

Other talks

Novel neuroimaging methods in Lewy body dementia Cambridge RNA Club - ONLINE Polar Oceans Seminar Talk What Can a Spectrum Learn? AI Perspectives on the Kohn Laplacian of Sphere Quotients Kirk Public Lecture: Title TBC The Play Paradox: How video games build better humans
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity