100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached 4.6 TrustPilot
logo-home
Exam (elaborations)

Natural Language Processing (NLP), Top Exam Questions and answers, verified.

Rating
-
Sold
-
Pages
7
Grade
A+
Uploaded on
13-06-2023
Written in
2022/2023

Natural Language Processing (NLP), Top Exam Questions and answers, verified. Artificial Intelligence - -A computer performing tasks that a human can do NLP Sentiment analysis is a form of... - -classification NLP topic modeling is a form of... - -Dimensionality reduction Tokenization - -Splitting raw text into small, indivisible units for processing. Units can be words, sentences, n-grams (n-word combos), other characters defined by regex Stop words - -Words that have very little semantic value Stemming and Lemmatization - -Cut word down to base form Stemming- uses rough heuristics to reduce words to base Lemmatization- uses vocabulary and morphological analysis (makes run, runs, running, and ran all the same) Named Entity Recognition - -Identifies and tags named entities in text (people, places, organizations, phone numbers, emails, etc) aka entity extraction Compound term extraction - -extracting and tagging compound words or phrases in text Levenshtein distance - -Minimum number of operations to get from one word to another. One way of quantifying word similarity Levenshtein operations - -Deletions (delete a character) Insertions (insert a character) Mutation (change a character) Corpus - -Collection of texts Bag of words model - -- Simplified representation of text, where each document is recognized as a bag of its words - Grammar and word order are disregarded, but multiplicity is kept Cosine similarity - -Way to quantify the similarity between documents 1. Put each document in vector format 2. Find the cosine of the angle between the documents Term frequency-inverse document frequency - -(term frequency) * (inverse document frequency) Term frequency - -Term count/total terms Inverse document frequency - -- Considers how common a word is among all the documents - Rare words get additional weight Which classification models suffer from curse of dimensionality? - -KNN, SVM, linear models (linear/logisitic regression), decision trees Distance-based models feature selection - -Removes features that aren't helpful (might not be predictive of target and may not have a lot of variation) Art (try fitting with some features and changing it and comparing, regularization, feature importance scores) Feature extraction - -Uses information from all features, but creates artificial new features that are composites (uses information from all features, may put more weight on certain features) SVD - -Singular value decomposition, type of matrix decomposition (just multiplication) easy to compute & doesn't require square matrix matrices are our data, rows are observations, columns are features High level, what does SVD do? - -Generalization of eigendecomposition for rectangular matrices PCA - -Principal Components Analysis unsupervised technique care about the direction of maximal variation b/c that represents the differences in our observations and that helps us in our clustering/classification tasks What is PCA used for? - -Dropping the components that explain the least variance (uses SVD behind the scenes). Dimensionality reduction Document-term matrix - -rows = documents

Show more Read less
Institution
Course









Whoops! We can’t load your doc right now. Try again or contact support.

Written for

Course

Document information

Uploaded on
June 13, 2023
Number of pages
7
Written in
2022/2023
Type
Exam (elaborations)
Contains
Questions & answers

Subjects

Content preview

Natural Language Processing (NLP), Top
Exam Questions and answers, verified.

Artificial Intelligence - ✔✔-A computer performing tasks that a human can do



NLP Sentiment analysis is a form of... - ✔✔-classification



NLP topic modeling is a form of... - ✔✔-Dimensionality reduction



Tokenization - ✔✔-Splitting raw text into small, indivisible units for processing. Units can be words,
sentences, n-grams (n-word combos), other characters defined by regex



Stop words - ✔✔-Words that have very little semantic value



Stemming and Lemmatization - ✔✔-Cut word down to base form



Stemming- uses rough heuristics to reduce words to base



Lemmatization- uses vocabulary and morphological analysis (makes run, runs, running, and ran all the
same)



Named Entity Recognition - ✔✔-Identifies and tags named entities in text (people, places, organizations,
phone numbers, emails, etc)



aka entity extraction



Compound term extraction - ✔✔-extracting and tagging compound words or phrases in text

, Levenshtein distance - ✔✔-Minimum number of operations to get from one word to another. One way
of quantifying word similarity



Levenshtein operations - ✔✔-Deletions (delete a character)

Insertions (insert a character)

Mutation (change a character)



Corpus - ✔✔-Collection of texts



Bag of words model - ✔✔-- Simplified representation of text, where each document is recognized as a
bag of its words

- Grammar and word order are disregarded, but multiplicity is kept



Cosine similarity - ✔✔-Way to quantify the similarity between documents

1. Put each document in vector format

2. Find the cosine of the angle between the documents



Term frequency-inverse document frequency - ✔✔-(term frequency) * (inverse document frequency)



Term frequency - ✔✔-Term count/total terms



Inverse document frequency - ✔✔-- Considers how common a word is among all the documents

- Rare words get additional weight



Which classification models suffer from curse of dimensionality? - ✔✔-KNN, SVM, linear models
(linear/logisitic regression), decision trees



Distance-based models

Get to know the seller

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
PassPoint02 Chamberlain School Of Nursing
Follow You need to be logged in order to follow users or courses
Sold
173
Member since
3 year
Number of followers
105
Documents
4552
Last sold
4 weeks ago

4.1

39 reviews

5
22
4
6
3
5
2
4
1
2

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Frequently asked questions