Silviu-Petru Cucerzan
JHU/CLSP
Short Introduction - Turing Test Grammars: - regular languages (with examples) - context free languages (with examples) - Chomsky hierarchy Context Free Grammars for Natural Language (examples) Probabilist models / Markov Assumption Entropy / Perplexity / Mutual Information (just examples followed by definitions) Types / Tokens / Zipf's Law Brief description of some common NLP tasks: - POS tagging - parsing - meaning extraction & sense disambiguation - named entity recognition - error detection