Natural Language Processing: An Introduction, Thesis of Natural Language Processing (NLP)

HOW TO PROCESS NATURAL LANGUAGES IN TERM OF COMPUTATION

Typology: Thesis

2016/2017

Uploaded on 01/16/2017

shero_khan
shero_khan 🇬🇧

5

(1)

4 documents

1 / 15

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Natural Language
Processing
M. Naveed Ali
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff

Partial preview of the text

Download Natural Language Processing: An Introduction and more Thesis Natural Language Processing (NLP) in PDF only on Docsity!

Natural Language

Processing

M. Naveed Ali

Natural Language Processing  (^) Natural Language Processing (NLP) is the study of the computational treatment of natural languages:  (^) Most commonly Natural Language Understanding  (^) The complementary task is Natural Language Generation  (^) NLP draws on research in Linguistics,  (^) Theoretical Computer Science, Artificial  (^) Intelligence, Mathematics and Statistics,  (^) Psychology, etc.

Problems in Natural Language Understanding  Multiword meaning  Syntactic ambiguity  (^) Imprecision  In completeness  Antecedent

Multiword Meaning  In natural languages sometime we use the same word with two different meanings For example A bank is situated at river bank.

Imprecision  Sometime same word is used for two different purposes I have been waiting for a long time Baber ruled over India a log time ago

Unclear Antecedent  Sometime problem is arises due to unclear antecedent. For example Jean told marry she was in love. س ے نننا ننن رننکھا توےھ ننن اننتےر اننتھوںپے ے کنننننن س لمی ےاسلم نننن ھ وئ ے کوئ کپکپاھٹ محسوس نننن -

Steps Involved in Natural Language Understanding  Lexical Analysis  Morphological Analysis  (^) Syntax Analysis  Semantic analysis  Pragmatic analysis

Lexical Analysis  (^) Lexical analysis deals with breaking the sentence into tokens. A man was running after the lexical analysis the output will be A man was Array of token running

Syntax analysis  Each and every language has its own grammar. So in order to understand a natural language sentence it is necessary that it should be grammatically correct. Since for computer it will become very difficult to understand sentences , which are grammatically not correct.  (^) Birds fly. (Noun Verb) ---------- > valid  (^) The are Flying birds.

Semantic Analysis  In semantic analysis the usage of various word categories in the sentence are checked. Since sometime sentence is grammatically correct but is still meaningless e.g. Wednesday fly (noun verb) --------- > invalid