Skip to content
This repository was archived by the owner on Mar 8, 2021. It is now read-only.

Commit f6dd43f

Browse files
committed
typos!
1 parent 2bc5c31 commit f6dd43f

2 files changed

Lines changed: 10 additions & 10 deletions

File tree

Chapter 7 - Archiving and Searching.ipynb

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
{
22
"metadata": {
33
"name": "",
4-
"signature": "sha256:b812b955eb6663112f1e4d0d2fd16d90f387b368bed7feac53d56e8c1a3f9270"
4+
"signature": "sha256:07ff5cb408ff60a5d8061f4a0d4291d29d270327b85d3e600aff6b17c47295bb"
55
},
66
"nbformat": 3,
77
"nbformat_minor": 0,
@@ -800,7 +800,7 @@
800800
"cell_type": "markdown",
801801
"metadata": {},
802802
"source": [
803-
"**a)** In this exercize you have to add the length of each document in our collection to the IR system. Reimplement the `index_document` method. Besides updating the term-document frequencies of each term, it should update the `Counter` object `lengths` in such a way that for each document ID it stores the length of the document being indexed."
803+
"**a)** In this exercise you have to add the length of each document in our collection to the IR system. Reimplement the `index_document` method. Besides updating the term-document frequencies of each term, it should update the `Counter` object `lengths` in such a way that for each document ID it stores the length of the document being indexed."
804804
]
805805
},
806806
{
@@ -856,7 +856,7 @@
856856
"cell_type": "markdown",
857857
"metadata": {},
858858
"source": [
859-
"**b)** Once we have obtained the document length for each document, computing the average document length is trivial. In this exercize we will focus on the IDF weights. To compute the IDF weight for a particular term $q_i$ we need to know two things:\n",
859+
"**b)** Once we have obtained the document length for each document, computing the average document length is trivial. In this exercise we will focus on the IDF weights. To compute the IDF weight for a particular term $q_i$ we need to know two things:\n",
860860
"\n",
861861
"1. how many documents $N$ there are in our collection;\n",
862862
"2. in how many documents that term occurs: $n(q_i)$.\n",
@@ -1056,14 +1056,14 @@
10561056
"level": 4,
10571057
"metadata": {},
10581058
"source": [
1059-
"Final exercize"
1059+
"Final exercise"
10601060
]
10611061
},
10621062
{
10631063
"cell_type": "markdown",
10641064
"metadata": {},
10651065
"source": [
1066-
"Perhaps the biggest advantage of Object Oriented Programming is the ability to subclass objects. You could, for example, make a specialized IRSystem for searching through particular directories on your own laptop. In this final exercize you will implement a simple web searcher. This searcher can be initialized with a number of URLs of web pages. The searcher downloads these pages, strips all HTML markup and indexes the raw text. The searcher can then be used to query for particular web pages. \n",
1066+
"Perhaps the biggest advantage of Object Oriented Programming is the ability to subclass objects. You could, for example, make a specialized IRSystem for searching through particular directories on your own laptop. In this final exercise you will implement a simple web searcher. This searcher can be initialized with a number of URLs of web pages. The searcher downloads these pages, strips all HTML markup and indexes the raw text. The searcher can then be used to query for particular web pages. \n",
10671067
"\n",
10681068
"Our implementation starts with a function to retrieve a webpage given a URL. The module [urllib.request](https://docs.python.org/3/library/urllib.request.html#module-urllib.request) in Python's standard library, defines a number of functions and classes to open and read URLs. The function `urlopen` opens a `HTTPResponse` object, which has a method called `read`. Upon calling the `read` method, the complete webpage will be downloaded:"
10691069
]

answerbook/Chapter 7 - Archiving and Searching.ipynb

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
{
22
"metadata": {
33
"name": "",
4-
"signature": "sha256:ab823b2112c3f867b83311cea6db453a8f8b604f8523112ea659f1dcd8c7c665"
4+
"signature": "sha256:96d2e4f6ce3df4514366b2bc47b793ecd1919a459e63a28242dc4e61bffc7d6d"
55
},
66
"nbformat": 3,
77
"nbformat_minor": 0,
@@ -807,7 +807,7 @@
807807
"cell_type": "markdown",
808808
"metadata": {},
809809
"source": [
810-
"**a)** In this exercize you have to add the length of each document in our collection to the IR system. Reimplement the `index_document` method. Besides updating the term-document frequencies of each term, it should update the `Counter` object `lengths` in such a way that for each document ID it stores the length of the document being indexed."
810+
"**a)** In this exercise you have to add the length of each document in our collection to the IR system. Reimplement the `index_document` method. Besides updating the term-document frequencies of each term, it should update the `Counter` object `lengths` in such a way that for each document ID it stores the length of the document being indexed."
811811
]
812812
},
813813
{
@@ -866,7 +866,7 @@
866866
"cell_type": "markdown",
867867
"metadata": {},
868868
"source": [
869-
"**b)** Once we have obtained the document length for each document, computing the average document length is trivial. In this exercize we will focus on the IDF weights. To compute the IDF weight for a particular term $q_i$ we need to know two things:\n",
869+
"**b)** Once we have obtained the document length for each document, computing the average document length is trivial. In this exercise we will focus on the IDF weights. To compute the IDF weight for a particular term $q_i$ we need to know two things:\n",
870870
"\n",
871871
"1. how many documents $N$ there are in our collection;\n",
872872
"2. in how many documents that term occurs: $n(q_i)$.\n",
@@ -1071,14 +1071,14 @@
10711071
"level": 4,
10721072
"metadata": {},
10731073
"source": [
1074-
"Final exercize"
1074+
"Final exercise"
10751075
]
10761076
},
10771077
{
10781078
"cell_type": "markdown",
10791079
"metadata": {},
10801080
"source": [
1081-
"Perhaps the biggest advantage of Object Oriented Programming is the ability to subclass objects. You could, for example, make a specialized IRSystem for searching through particular directories on your own laptop. In this final exercize you will implement a simple web searcher. This searcher can be initialized with a number of URLs of web pages. The searcher downloads these pages, strips all HTML markup and indexes the raw text. The searcher can then be used to query for particular web pages. \n",
1081+
"Perhaps the biggest advantage of Object Oriented Programming is the ability to subclass objects. You could, for example, make a specialized IRSystem for searching through particular directories on your own laptop. In this final exercise you will implement a simple web searcher. This searcher can be initialized with a number of URLs of web pages. The searcher downloads these pages, strips all HTML markup and indexes the raw text. The searcher can then be used to query for particular web pages. \n",
10821082
"\n",
10831083
"Our implementation starts with a function to retrieve a webpage given a URL. The module [urllib.request](https://docs.python.org/3/library/urllib.request.html#module-urllib.request) in Python's standard library, defines a number of functions and classes to open and read URLs. The function `urlopen` opens a `HTTPResponse` object, which has a method called `read`. Upon calling the `read` method, the complete webpage will be downloaded:"
10841084
]

0 commit comments

Comments
 (0)