Abbreviations

For more information about the lecture halls and seminar rooms, see our lecture room page. The names listed under "Technical Assistance" are student volunteers who will act as a contact person for technical questions of the lecturers and workshop speakers during the course or workshop.

Unification grammars

The course introduces the foundations of some of the major formalisms used in computational linguistics nowadays, providing both the linguistic motivation and the necessary mathematical infrastructure. Contents: 1. Context-free grammars Basics: strings, grammars, derivations, languages, trees Properties of CFGs The (in)adequacy of CFGs for describing natural languages 2. Extending CFGs: feature structures Motivation Properties: features, values, variables, paths, reentrancy Subsumption and unification Representing lists, trees and graphs 3. Unification grammars Adding features to rules Multi-AVMs, forms, derivations, languages, trees Internalizing categories 4. Linguistic examples Imposing subject-verb agreement Case control Subcategorization Unbounded dependencies Coordination 5. The expressiveness of unification grammars Grammars for trans-context-free languages Turing equivalence