This lecture introduces concurrent constraint programming and shows how to model natural a language processing on basis of this paradigm.
All models are elaborated in the programming
language Mozart-Oz, and can be tested by the reader.
The lecture addresses students
of computer science who are interested in constraint programming or in Mozart-Oz and students of computational linguistics who
want to learn natural language processing
based on programming technology beyond
Prolog and LISP.
The following topics are discussed in detail, while
presupposing as few knowledge as possible:
functional programming with imperative data structures
chart parsing for context free grammars,
unification based parsing,
concurrent constraint programming,
constraint solving for scope underspecification in natural language semantics
constraint solving for parsing with dependency grammar.
The lecture is available online.
HTML
PDF
PS