Welcome to the Wiki page of the course '''Search Engines, WS 2009 / 2010'''. Lecturer: [[http://ad.informatik.uni-freiburg.de/staff/bast|Hannah Bast]]. Tutorials: [[http://ad.informatik.uni-freiburg.de/staff/celikik|Marjan Celikik]]. Course web page: [[http://ad.informatik.uni-freiburg.de/teaching/winter-term-2009-2010/suchmaschinen-vorlesung|click here]].

Here are PDFs of the slides of the lectures so far: [[attachment:SearchEnginesWS0910/lecture-1.pdf|Lecture 1]], [[attachment:SearchEnginesWS0910/lecture-2.pdf|Lecture 2]], [[attachment:SearchEnginesWS0910/lecture-3.pdf|Lecture 3]], [[attachment:SearchEnginesWS0910/lecture-4.pdf|Lecture 4]], [[attachment:SearchEnginesWS0910/lecture-5.pdf|Lecture 5]], [[attachment:SearchEnginesWS0910/lecture-6.pdf|Lecture 6]], [[attachment:SearchEnginesWS0910/lecture-7.pdf|Lecture 7]], [[attachment:SearchEnginesWS0910/lecture-8.pdf|Lecture 8]].

Here are .lpd files of the recordings of the lectures so far (except Lecture 2, where we had problems with the microphone): [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-1.lpd|Recording Lecture 1]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-3.lpd|Recording Lecture 3]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-4.lpd|Recording Lecture 4]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-5.lpd|Recording Lecture 5 (no audio)]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-6.lpd|Recording Lecture 6 (with audio for a change)]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-7.avi|Recording Lecture 7 (AVI)]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-8.avi|Recording Lecture 8 (AVI)]].

Here are PDFs of the exercise sheets so far: [[attachment:SearchEnginesWS0910/exercise-1.pdf|Exercise Sheet 1]], [[attachment:SearchEnginesWS0910/exercise-2.pdf|Exercise Sheet 2]], [[attachment:SearchEnginesWS0910/exercise-3.pdf|Exercise Sheet 3]], [[attachment:SearchEnginesWS0910/exercise-4.pdf|Exercise Sheet 4]], [[attachment:SearchEnginesWS0910/exercise-5.pdf|Exercise Sheet 5]], [[attachment:SearchEnginesWS0910/exercise-6.pdf|Exercise Sheet 6]], [[attachment:SearchEnginesWS0910/exercise-7.pdf|Exercise Sheet 7]], [[attachment:SearchEnginesWS0910/exercise-8.pdf|Exercise Sheet 8]].

Here are your solutions and comments on the previous exercise sheets: [[SearchEnginesWS0910/ExerciseSheet1|Solutions and Comments 1]], [[SearchEnginesWS0910/ExerciseSheet2|Solutions and Comments 2]], [[SearchEnginesWS0910/ExerciseSheet3|Solutions and Comments 3]], [[SearchEnginesWS0910/ExerciseSheet4|Solutions and Comments 4]], [[SearchEnginesWS0910/ExerciseSheet5|Solutions and Comments 5]], [[SearchEnginesWS0910/ExerciseSheet6|Solutions and Comments 6]], [[SearchEnginesWS0910/ExerciseSheet7|Solutions and Comments 7]].

= Exercise Sheet 8 =

The recordings of all lectures are now available, see above. Lecture 2 is missing because we had technical problems there. To play the Lecturnity recordings (.lpd files) you need the [[http://www.lecturnity.de/de/download/lecturnity-player|Lecturnity Player, which you can download here]]. I put the Camtasia recordings as .avi files, which you can play with any ordinary video player; I would recommend [[http://www.videolan.org/vlc|VLC]].

[[SearchEnginesWS0910/Rules|Here are the rules for the exercises as explained in Lecture 2]].

[[SearchEnginesWS0910/ExerciseSheet8|Here you can upload your solutions for Exercise Sheet 8]].

== Questions or comments below this line, most recent on top please ==

One question on exercise 3: Do we have to assume that each transformation is of a certain form (i.e. insert at i'th character of current word, where it matters how many deletes/inserts have been done previously)? Or can we assume that a transformation somehow "knows" its position? If we have to deal with it in an abstract way, should we create our own way of describing a transformation or is there a formalism we all should use. '''Björn 13:31'''

Here is another bonus point system: http://www.informatik.uni-freiburg.de:8081/swt/teaching/winter-term-2009/informatik-iii-theoretische-informatik. Additionally I would like to add that most of these bonus point systems have exercises which are far less work. '''Björn'''


In some other lectures the points from the sheets are used to increase the grade from the exam. If one got 50% then she/he got 0.3 grade better, 80% for 0.6 better, but min. 4.0 in exam. I.e. 83% of the exercise points and 2.3 in exam = 1.7 final grade.
Data Mining & Machine Learning used a more complex scheme, there was theoretical sheets and practical sheets using Weka (the slides should be on electures server). '''Markus 14Dec09 9:23'''

Many exercise sheets contained two tasks and for each task we could get 1 point. That means that we could got 2 or  even 3 points per sheet. The exercises were optional, but because of the bonus points most students did the exercises. There was another reason to do the exercises. In this lecture the exam was very similar to the exercise sheet tasks, so we had two considerable advantages. In two other lectures we had to achieve 30 and 50% of the exercise points to participate at the exam.  '''Manuela 14Dec09 00:57'''

Now that I think about it, there were points for solving exercises in exercise-class. Also, there were more than 15 points achievable over the semester, but max. 15 were credited in the exam.  '''alex  13Dec09 23:57'''

In that lecture we could reach max. 15 bonus points for the exercises. Each exercise sheet scored one point + one extra point for specially good/clever solutions. I don't think there was a constraint on admission to the exam. There might have been points for solving exercises in the exercise-class, but I'm not sure about that. (--> already one year ago) '''alex  13Dec09 23:48'''

Thanks for the link, Alex, can you please explain the thing with the "bonus point of the exercise"? Is it that there were 15 bonus points to reach in the exercises? How many tasks in the exercises got bonus points and how many didn't? And the non-bonus tasks than only counted for admission to the exam? '''Hannah 13Dec09 23:36'''

I quite liked this scheme, although it does not put that much weight on the exercises: http://cone.informatik.uni-freiburg.de/teaching/vorlesung/algorithmentheorie-w08/exam.html '''alex  13Dec09 23:17'''

Can someone please post the details of one of the existing bonus systems here? (Something like: for xyz % of the exercises, you can improve your exam mark by abc.) Or the links to a course site where these details are given. Thanks! '''Hannah 13Dec09 23:09'''

To Mirko + all: Yes, it's d, I don't know how I've missed this one. '''Marjan  12Dec09 13:16'''

About Exercise 1: in the second part, is it really delta? shouldn't it be d? '''Mirko 12Dec09, 12:43'''