Tag der Computerlinguistik
The Day of Computational Linguistics will be held somewhere during May this year and will serve to attract potential students from nearby high schools and colleges to our course program. After an introduction to computational linguistics in general and to Tübingen's ISCL in particular, attendees will be free to gather information from several different sections, each devoted to one particular facet of CL. The event is currently being organized by the Fachschaft members and if you are willing to join the preparations, you are very welcome to do so.
Date and Place
The Open Door Day will be on 3 May in the SfS.
Prof. Hinrichs will give an official introduction to the visitors presenting Tübingen and the course studies in ISCL.
Everyone can go to visit a total of four different sections, each devoted to a particular topic:
- Mathematics / Logic / Philosophy
- Information Retrieval / Text Mining / Text Technology
We will invite people from EML as well as IBM and probably other companies (Daimler Chrysler?) to give talks. The absolute maximum on the number of talks is three.
No content yet.
No content yet.
We want to invite our teachers to hold a sort of introductory lecture. Who shall we invite? Ideas so far are:
- Sam Featherson
- Frank Richter
Each section will give a short intro and is to be manned by two of us. Please volunteer.
Presentation of intriguing examples, most likely from German, since most attendees are going to be German. Ideas include:
- Collection of marked sentences in Sternefeld 2006 - initiate discussion about their grammaticality
- Presenting ambiguities in languages
- Show how different languages can be (there is an excellent example of Chinese weirdness here.
On basis of the examples we can try justify bracketing patterns and tree structures and present that.
The station to convince the mathematically-minded of our program. At this station, people will be able to play around with
- Finite State Automata (using the nice graphical tools we have)
- other graph structures (trees etc.)
- some easy proofs in set theory (not formal, all based on common sense)
And I also intend to offer some info on
- complexity classes (hard versus easy problems, feasibility of computation etc.)
- How To Encode Infinity (cyclic structures, non-termination etc.)
How do search engines work? What's a (linguistic) Corpus?
This section will present a short introduction to Computer Science as practised in CL to the visitors. It will contain an introduction to problem solving using systematic methods (probably Algorithms, though people have voted to put that into the mathematics/logics section) including (but not limited to)
- Object Oriented programming
- Presentation of typical homeworks or projects (passivator)
Ideas / Sources
It seems that there is a very nice introduction to CL on the pages of CL in Stuttgart. Anyone willing to share a link? Also, Hubert Truckenbrodt's scripts for introduction to Phonology and Ede Zimmerman's scripts for introduction to Semantics are very easy to understand and contain a lot of good examples.