Computational Linguistics
Linguistics · University · Computational Linguistics
In this unit you will: reliably distinguish tokens, types, lemmas, and corpora; understand language models, probabilities, and Zipf’s law; apply the Chomsky hierarchy, automata, grammars, and trees; calculate edit distance, use HMMs, and compute precision and recall; apply all content as on a final exam.
There are 50 exercises to practice: interaktive Aufgaben. Every answer gets instant feedback, free and without signing up.
What's included
- Reliably distinguish tokens · types · lemmas · and corpora
- Understand language models · probabilities · and Zipf’s law
- Apply the Chomsky hierarchy · automata · grammars · and trees
- Calculate edit distance · use HMMs · and compute precision and recall
- Apply all content as on a final exam
Example questions
- Which base form does lemmatization give for “went”?
- True or false? “Stemming always produces a real word of the language.”
- How many tokens and types does “a bird sees a worm” have (ignoring punctuation)?