Files
comp-syntax-gu-mlt/lectures

Computations Syntax Lectures: Outline

Lecture 1

Coursenotes: Chapter 1

Participants' native languages: Chinese (2), Dutch, English, Finnish, French (2), Greek, Hebrew, Italian (3), Korean, Persian (2), Polish, Portuguese, Romanian (3), Russian, Spanish, Swedish (2), Swiss German, West-Assyrian - 24 students, 17 languages + 2 teachers, 1 more language

Formal grammar is no more expected to match natural language exactly

  • analysis: should be wider than the language (we will use UD)
  • generation: should be contained in the language (we will use GF)
  • in both formats, we aim to use universal concepts for many languages

Phrase structure grammars, context-free = BNF, grammar rules, trees

  • example: english.cf
  • testing grammars in GF: import, generate_random, parse, linearize, visualize_parse, help

GF grammars: dividing .cf into abstract and concrete .gf

  • example: Intro*.gf
  • forms of rules: cat, fun, lincat, lin
  • word order switch English-Italian
  • to solve next time:

Experiments in GF: