Speaker: Ryan McDonald, NPL
UCL Contact: Sebastian Riedel (Visitors from outside UCL please email in advance).
Date/Time: 26 Feb 14, 16:00 - 17:00
If you're interested in NLP research feel free to register there to get NLP seminar announcements and help us with logistics by RVSPing.See also http://groupspaces.com/SouthEnglandNLPMeetup/item/494696
State-of-the-art graph-based dependency parsers use features over higher-order dependencies that rely on decoding algorithms that are slow and hyper-specialized. In contrast, transition-based dependency parsers can easily utilize such features without an increase in asymptotic complexity. To address this imbalance, we generalize the Eisner algorithm to handle arbitrary features by enriching chart signatures without changing the underlying dynamic programming algorithm. While this gene