From 6c43f8b8e6da7b6820aa22c5c342087d2224fae3 Mon Sep 17 00:00:00 2001 From: Jen Looper Date: Fri, 21 May 2021 15:57:11 -0400 Subject: [PATCH] NLP 2 assignment --- NLP/2-Tasks/README.md | 12 ++++++------ NLP/2-Tasks/assignment.md | 10 ++++++---- 2 files changed, 12 insertions(+), 10 deletions(-) diff --git a/NLP/2-Tasks/README.md b/NLP/2-Tasks/README.md index b156550c..b140ce94 100644 --- a/NLP/2-Tasks/README.md +++ b/NLP/2-Tasks/README.md @@ -6,7 +6,7 @@ Add a sketchnote if possible/appropriate ## [Pre-lecture quiz](link-to-quiz-app) -For most *Natural Language Processing* tasks, the text to be processed must be broken down, examined, and the results stored or cross referenced with rules and data sets. This allows the programmer to derive the meaning or intent or even just the frequency of terms and words in a text. +For most *Natural Language Processing* tasks, the text to be processed must be broken down, examined, and the results stored or cross referenced with rules and data sets. This allows the programmer to derive the meaning or intent or only the frequency of terms and words in a text. Let's discover common techniques used in processing text. Combined with machine learning, these techniques help you to analyse large amounts of text efficiently. ## The Tools of NLP @@ -19,11 +19,11 @@ Let's discover common techniques used in processing text. Combined with machine > > Every word that has been tokenised can be tagged as a part of speech - is the word a noun, a verb, or adjective etc. The sentence `the quick red fox jumped over the lazy brown dog` might be POS tagged as *fox* = noun, *jumped* = verb etc. > -> Parsing is recognising what words are related to each other in a sentence - for instance `the quick red fox jumped` is an adjective-noun-verb sequence that is is separate from `lazy brown dog` sequence. +> Parsing is recognizing what words are related to each other in a sentence - for instance `the quick red fox jumped` is an adjective-noun-verb sequence that is is separate from `lazy brown dog` sequence. > 🎓 **Word and Phrase Frequencies** > -> A useful tool when analysing a large body of text is to build a dictionary of every word or phrase of interest and how often it appears. The phrase `the quick red fox jumped over the lazy brown dog` has a word frequency of 2 for `the`. +> A useful tool when analyzing a large body of text is to build a dictionary of every word or phrase of interest and how often it appears. The phrase `the quick red fox jumped over the lazy brown dog` has a word frequency of 2 for `the`. ### Example: @@ -168,11 +168,11 @@ One possible solution to the task is [here](solution/bot.py) 3. Why would extracting a 'noun phrase' from a sentence a useful thing to do? ## 🚀Challenge -TODO +Take a task in the prior knowledge check and try to implement it. Test the bot on a friend. Can it trick them? Can you make your bot more 'believable?' ## [Post-lecture quiz](link-to-quiz-app) ## Review & Self Study -TODO +In the next few lessons you will learn more about sentiment analysis. Research this interesting technique in articles such as these on [KDNuggets](https://www.kdnuggets.com/tag/nlp) -**Assignment**: [Assignment Name](assignment.md) +**Assignment**: [Search for a bot](assignment.md) diff --git a/NLP/2-Tasks/assignment.md b/NLP/2-Tasks/assignment.md index d4badb79..53213315 100644 --- a/NLP/2-Tasks/assignment.md +++ b/NLP/2-Tasks/assignment.md @@ -1,9 +1,11 @@ -# [Assignment Name] +# Search for a bot ## Instructions +Bots are everywhere. Your assignment: find one and adopt it! You can find them on web sites, in banking applications, and on the phone, for example when you call financial services companies for advice or account information. Analyze the bot and see if you can confuse it. If you can confuse the bot, why do you think that happened? Write a short paper about your experience. + ## Rubric -| Criteria | Exemplary | Adequate | Needs Improvement | -| -------- | --------- | -------- | ----------------- | -| | | | | +| Criteria | Exemplary | Adequate | Needs Improvement | +| -------- | ------------------------------------------------------------------------------------------------------------- | -------------------------------------------- | --------------------- | +| | A full page paper is written, explaining the presumed bot architecture and outlining your experience with it | A paper is incomplete or not well researched | No paper is submitted |