University of Cambridge > Talks.cam > NLIP Seminar Series > Shift-Reduce CCG Parsing with a Dependency Model

  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

Shift-Reduce CCG Parsing with a Dependency Model

Download to your calendar using vCal

If you have a question about this talk, please contact Ekaterina Kochmar .

We present the first dependency model for a shift-reduce CCG parser. Modelling dependencies is desirable for a number of reasons, including handling the “spurious” ambiguity of CCG ; fitting well with the theory of CCG ; and optimizing for structures which are evaluated at test time. We develop a novel training technique using a dependency oracle, in which all derivations are hidden. A challenge arises from the fact that the oracle needs to keep track of exponentially many gold-standard derivations, which is solved by integrating a packed parse forest with the beam-search decoder. Standard CCG Bank tests show the model achieves up to 1.05 labeled F-score improvements over three existing, competitive CCG parsing models.

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

GR05, English Faculty Online (Teams link will appear before the talk) Average on weekdays: 8955.9084507 kWh

Other talks

Discovery Investigations: Science, Empire and the Making of the British South Atlantic Morning Break / Group Photo Group Work A Novel Diffusion Model based Approach for Sleep Music Generation Title and abstract tba Zooming in on the assembly of galaxies in the early Universe
 

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