Lecture

Syntactic Parsing and Graph2Graph Transformers

Graph Chat

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.

Description

This lecture covers syntactic parsing, dependency grammar, and graph-based neural network parsing. It discusses the importance of sentence structure, attachment ambiguities, and coordination scope ambiguity. The instructor explains the history of dependency structure, the rise of annotated data, and different methods of dependency parsing. The lecture also delves into projectivity, transition-based parsing, and the use of neural networks in parsing. It concludes with a summary of syntactic structure and the advancements in graph-based dependency parsing.

Official source

Ontological neighbourhood

Computer engineering

Computer programming: Compilers

Related concepts (31)

Parsing

Parsing, syntax analysis, or syntactic analysis is the process of analyzing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar. The term parsing comes from Latin pars (orationis), meaning part (of speech). The term has slightly different meanings in different branches of linguistics and computer science. Traditional sentence parsing is often performed as a method of understanding the exact meaning of a sentence or word, sometimes with the aid of devices such as sentence diagrams.

Dependency grammar

Dependency grammar (DG) is a class of modern grammatical theories that are all based on the dependency relation (as opposed to the constituency relation of phrase structure) and that can be traced back primarily to the work of Lucien Tesnière. Dependency is the notion that linguistic units, e.g. words, are connected to each other by directed links. The (finite) verb is taken to be the structural center of clause structure. All other syntactic units (words) are either directly or indirectly connected to the verb in terms of the directed links, which are called dependencies.

Oral exam

The oral exam (also oral test or viva voce; Rigorosum in German-speaking nations) is a practice in many schools and disciplines in which an examiner poses questions to the student in spoken form. The student has to answer the question in such a way as to demonstrate sufficient knowledge of the subject to pass the exam. The oral exam also helps reduce (although it does not eliminate) the risk of granting a degree to a candidate who has had the thesis or dissertation ghostwritten by an expert.

Phrase structure grammar

The term phrase structure grammar was originally introduced by Noam Chomsky as the term for grammar studied previously by Emil Post and Axel Thue (Post canonical systems). Some authors, however, reserve the term for more restricted grammars in the Chomsky hierarchy: context-sensitive grammars or context-free grammars. In a broader sense, phrase structure grammars are also known as constituency grammars. The defining trait of phrase structure grammars is thus their adherence to the constituency relation, as opposed to the dependency relation of dependency grammars.

Parsing expression grammar

In computer science, a parsing expression grammar (PEG) is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language. The formalism was introduced by Bryan Ford in 2004 and is closely related to the family of top-down parsing languages introduced in the early 1970s. Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation: the choice operator selects the first match in PEG, while it is ambiguous in CFG.

Related lectures (64)

Grammars and Parsers: An Overview of Language Processing

Provides an overview of grammars and parsers in computer language processing.

CYK Algorithm for Parsing General Grammars

Explores parsing general grammars using the CYK algorithm and Chomsky Normal Form.

CYK Parsing Algorithm for General Grammars

Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.

Introduction to Grammars

Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.

Syntax Trees: Parse vs AST