NATURAL LANGUAGE PROCESSING

INTRODUCTION
   One of the fundamental Artificial Intelligence problems prevalent today is the inability of a computer program to be able to convert a piece of English text into a programmer friendly
data structure that describes the meaning of the natural language text.  As long as no consensus has emerged about the form or the existence of such a data structure, scientists must settle for the lesser objective of extracting simpler representations that describe limited aspects of the textual information.
   These simpler representations are often motivated by specific applications or by our belief that they capture something more general about natural language. They can describe syntactic information (e.g., part-of-speech tagging, chunking, and parsing) or semantic information (e.g., word-sense disambiguation, semantic role labeling, named entity extraction, and anaphora resolution). Text corpora have been manually annotated with such data structures in order to compare the performance of various systems. The availability of standard benchmarks has stimulated research in Natural Language Processing (NLP) and effective systems have been designed for all these tasks


Subscribe to access this work and thousands more
Overall Rating

0

5 Star
(0)
4 Star
(0)
3 Star
(0)
2 Star
(0)
1 Star
(0)
APA

Ogunwale, F. (2018). NATURAL LANGUAGE PROCESSING. Afribary. Retrieved from https://afribary.com/works/natural-language-processing-1177

MLA 8th

Ogunwale, Funbi "NATURAL LANGUAGE PROCESSING" Afribary. Afribary, 29 Jan. 2018, https://afribary.com/works/natural-language-processing-1177. Accessed 26 Apr. 2024.

MLA7

Ogunwale, Funbi . "NATURAL LANGUAGE PROCESSING". Afribary, Afribary, 29 Jan. 2018. Web. 26 Apr. 2024. < https://afribary.com/works/natural-language-processing-1177 >.

Chicago

Ogunwale, Funbi . "NATURAL LANGUAGE PROCESSING" Afribary (2018). Accessed April 26, 2024. https://afribary.com/works/natural-language-processing-1177

Document Details
Field: Computer Science Type: Paper 33 PAGES (12019 WORDS) (docx)