Natural Language Processing and Applications

Get Started. It's Free
or sign up with your email address
Rocket clouds
Natural Language Processing and Applications by Mind Map: Natural Language Processing and Applications

1. outline

1.1. 1

1.1.1. overview of applications

1.1.2. linguistic essentials

1.1.2.1. history of language

1.1.2.2. language variation

1.1.2.3. basic grammatical concepts

1.1.3. exercise: review grammar, refresh Python

1.2. 2

1.2.1. UNIX command line tools

1.2.2. some Python

1.2.3. mathematical foundations

1.2.3.1. probability theory

1.2.3.2. common distributions

1.2.3.3. Bayesian methods

1.2.3.4. information theory

1.3. 3

1.3.1. corpora

1.3.1.1. what are corpora and how are they used?

1.3.1.2. what corpora are available?

1.3.1.3. tokenization, lemmatization, stemming

1.3.1.4. markup, tagging

1.4. 4

1.4.1. n-gram models

1.4.1.1. collocations

1.4.1.2. statistical models

1.4.1.3. sparsity, smoothing, back-off

1.4.1.4. cross-validation and testing

1.5. 5

1.5.1. markov models

1.6. 6

1.6.1. finite state transducers

1.7. 7

1.7.1. CRFs

1.7.2. discriminative language models

1.8. 8

1.8.1. text classification and clustering

1.9. 9

1.9.1. recurrent neural networks

1.10. 10

1.10.1. statistical alignment and MT

1.11. 11

1.11.1. word sense disambiguation

1.12. 12

1.12.1. parts-of-speech tagging

2. not covered

2.1. lexical acquisition

2.2. probabilistic context free grammars

2.3. probabilistic parsing

2.4. clustering

3. exam preparation

3.1. after each lecture...

3.2. identify definitions and concepts

3.3. identify mathematical proofs and derivations that were covered

3.4. identify algorithms that were covered

3.5. identify major concepts/tools that were covered

3.6. make a written list of definitions, concepts, proofs, derivations, and algorithms that you studied and bring them to the oral exam

3.7. during the exam

3.7.1. For any definition/concept, you should be able to give a concise and clear definition in the exam

3.7.2. For any derivation that we covered in class or the exercises, you should be able to repeat it in the exam and also solve similar problems.

3.7.3. For any covered algorithm, you should be able to state the inputs/outputs, and the sequence of steps.

3.7.4. You also need to be able to demonstrate that you know the tools that have been used in the exercises (UNIX/POSIX command line tools, Python)

4. reading

4.1. Manning and Schütze: Foundations of Statistical NLP

4.2. Bird and Klein: Natural Language Processing in Python

4.3. Perkins: Python Text Processing with NLTK 2.0 Cookbook

4.4. Russell: Mining the Social Web (additional reading)

5. course mechanics

5.1. lectures: Room 48-462 Time Wednesdays, 1:45 - 3:15 pm

5.2. exercises: TBD

5.3. exam: oral

5.3.1. make appointments with [email protected]

5.4. office hours

5.4.1. course assistants

5.4.1.1. TBD

5.4.2. professor

5.4.2.1. make appointment with [email protected]

5.5. http://nlpa.iupr.com/

6. exercises

6.1. required for taking the oral exam

6.2. bring the completed exercises with you to the oral exam (otherwise you can't take the exam)

6.3. Exercises are mostly in Python, with some theory.

6.4. Do your exercises in iPython notebooks and hand them in.

6.5. Many exercises will give you a Python notebook as a starting point.

7. presentation on application examples