Natural Language Processing

Below is the syllabus for Natural Language Processing:-

 

Unit-I

Fundamental components of Natural Language Processing: Lexicography, syntax, semantics, prosody, phonology, pragmatic analysis, world knowledge.

Knowledge Representation schemes: Semantic net, Frames, Conceptual Dependency, Scripts.

 

Unit-II

Representing knowledge using rules: Logic Programming, Introduction to LISP and Prolog, Rules-based deduction systems, General concepts in knowledge acquisition.

Syntax Analysis: Formal Languages and grammars, Chomsky Hierarchy, Left- Associative Grammars, ambiguous grammars, resolution of ambiguities.

 

Unit-III

Computation Linguistics: Recognition and parsing of natural language structures- ATN and RTN, General Techniques of parsing- CKY, Earley and Tomita’s algorithm.

Semantics: Knowledge representation, semantics networks logic and inference pragmatics, graph models, and optimization.

 

Unit-IV

Applications of NLP: Intelligent work processor, Machine translation, user interfaces, Man-Machine interfaces, natural language querying, tutoring and authoring systems, speech recognition, commercial use of NLP.

 

Text Books:

  1. Daniel Jurafsky, James H. Martin, “Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics and Speech Recognition”, 2nd edition, Pearson Edu.,
  2. James Allen, “Natural Language Understanding”, Pearson Education, Second Edition,

 

Reference Books:

  1. Ivan Bratko, “Prolog: Programming for Artificial Intelligence”, 3rd Edition, Pearson Education, Fifth Impression
  2. Gazder, “Natural Language processing in prolog”, Addison Wesley, 1989.

Below is the link to download Natural Language Processing notes.

Related Links

    • Neural Network and Fuzzy Logic (PDF Notes) – Click Here
    • Mobile App Development (PDF Notes) – Click Here
    • Data Mining (PDF Notes) – Click Here
    • Unix and Linux Programming (PDF Notes) – Click Here
    • Computer Graphics and Animation (PDF Notes) – Click Here