Lecture

Neural Network Syntactic Parsing

Description

This lecture covers neural network-based syntactic parsing, focusing on graph-based parsing with iterative refinement. It discusses LSTM-based dependency score estimation, a neural graph-based dependency parser, and the G2GT iterative refinement parser. The lecture explains the EPEL motivation for finding graph structures, the RNGTr encoder architecture, and the iterative non-autoregressive refinement process. It introduces the Recursive Non-Autoregressive Graph-to-Graph Transformer (RNGTr) model, detailing the encoder and score function. The lecture also explores model selection, results on UD and Penn Treebanks, and the performance analysis based on dependency types and projectivity of dependency graphs.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.