シャドーイング練習: The Math Behind Recommender Systems - 動画で英語スピーキングを学ぶ

練習モードを選ぶ

各モードは全画面の練習ルームで開きます。

89 文
文が短すぎたり長すぎる場合は、Editをタップして調整してください。
1
In 2006, Netflix famously offered a prize to solve a simple problem which had been around for years.
2
All online commerce giants are fighting to get better at solving this same problem.
3
Given observations of a user's past behavior, predict which other things that same user will like.
4
For example, based on Alice's viewing history, will she like
5
The Matrix or Grapes of Wrath?
6
We can represent user preferences graphically as connections between people on one side and things on the other, such as movies.
7
Here, the strength of connection is visually represented by the thickness of the lines.
8
So the problem is to fill out all of these missing connections we don't yet know, shown in red.
9
But because of the messy, unpredictable nature of people's taste, we can never perfectly predict what they will like
10
because for one it involves a guess about the future based on something you've never seen
11
and two the answer is always in flux
12
because people's tastes change over time what we can do is try to estimate those values as best
13
we can using whatever data we have access to
14
so regardless of the context we can describe the problem in the following mathematical form we use a matrix
15
which is a collection of numbers organized into rows and columns, where the rows are users and the columns are items, in this case movies.
16
And each cell in this matrix contains a number that describes how much each individual likes each movie.
17
For example, we could use a scale from 0 to 4, where 0 would represent I hate it,
18
2 is neutral, and 4 is I love it.
19
At any given moment, there will be some set of preference data for users and movies.
20
But it will be incomplete because users have only seen and rated a few movies each.
21
And so the problem boils down to trying to predict these missing values.
22
How should we make these predictions?
23
There are two general approaches to this problem.
24
The first is called content filtering, which is to use information we know about people and things as connective tissue for recommendations.
25
It's like asking Alice questions about what kinds of movies she likes to figure out if she will like The Matrix.
26
It begins by labeling each person and movies with some known attributes, or what we call features, for example, action and comedy.
27
That means if Alice likes comedy and hates action, we can represent her as 3 -0.
28
Each movie is also mapped to each feature in the same way.
29
For example, the matrix has no comedy and lots of action, so we could represent it as 0, 4.
30
And to determine whether someone will like a movie, we need to multiply these factors together.
31
So we could represent the strength of connection between Alice
32
and the matrix as 3 times 0 plus 0 times 4 equals 0.
33
So our estimation is that she will hate the movie.
34
So to make our predictions, we first need to gather this feature data for every user and movie.
35
To simplify, let's return to a matrix representation.
36
We can store this information in two matrices.
37
One defines the mapping between people and features.
38
The other defines the mapping between movies and features.
39
And by multiplying these two matrices together, using matrix multiplication, we get an estimated strength of connection between every person and movie.
40
And if we'd like, we can normalize our data to make sure the scale stays between 0
41
and 4 by dividing all values by 8 and rounding to the nearest 0 .5.
42
That's one way to solve this problem, known as content filtering.
43
The problem is, it's overly simplistic and not very accurate it.
44
That's because there are obviously more relevant features of a movie than just comedy or action.
45
The obvious way to improve this is just to include more features.
46
If you recall when Netflix started, it did just this.
47
It would ask new users to fill out a laundry list of questions about their preferences before presenting them with suggested movies.
48
And this leads to the problem of having to collect all of this preference data on users.
49
Not only is it a burden for users, it's also prone to failure, as we aren't always great at describing our own preferences.
50
Sometimes we simply can't explain why we like things.
51
We just do.
52
Which brings us to the other approach, called collaborative filtering.
53
The motivation for collaborative filtering comes from the idea that you will probably like things people with similar viewing habits also like.
54
This idea was popularized in this 2009 paper by Cohen, Bell, and Walensky.
55
So to begin, we can throw away the idea of dreaming up features used to connect peoples in movies.
56
Instead, we flip things around and use the user preference data we do have to generate the features.
57
For example, we might have this incomplete set of preference data,
58
and we will instead learn or discover the relevant features based on patterns in this data.
59
And this is done by simply reversing the problem.
60
We first perform an approximate factorization into two matrices, and we can do this using a machine learning approach.
61
The job of the machine learning algorithm is to guess values for those matrices,
62
which will match the existing data in the preference matrix as closely as possible.
63
The simplest approach is to simply guess numbers over
64
and over until you arrive at a set of numbers which predict the data with the lowest error overall.
65
Once this estimation is finished, we can multiply the matrices as before to fill in all of the missing values.
66
And it's important to note that we won't know exactly what to label these discovered features, so we call them latent features,
67
because they arise out of the underlying patterns in the data.
68
You can think of them as an average or weighted sum of the patterns in the data.
69
They are not based on a human -defined feature, such as comedy.
70
And that's the key insight behind this method.
71
With content filtering, the features come from the human mind,
72
whereas with collaborative filtering, the features are extracted directly from the patterns in the data.
73
And this will predict the data in the same way but more accurately.
74
It's also important to notice that this kind of prediction is actually a form of compression
75
because we can represent a huge matrix of preference data by two smaller matrices of feature data.
76
And once our feature data is determined or learned, we can throw away the original data we started with,
77
because we can simply multiply the features together to recreate that data.
78
And the reason this is possible is because the preference data we started with is not random, but follow patterns which exist across people.
79
If instead the preference data was filled with random numbers,
80
we would not be able to compress it accurately because there would be no patterns to extract.
81
This collaborative filtering approach has also been applied to a wide range of contexts,
82
such as evaluating policy outcomes before they are implemented in the real world, known as synthetic control.
83
For example, if we wanted to understand the effect of gun control or minimum wage increases in some city,
84
we could look at the effect in similar cities first
85
which have implemented those policies to approximate the outcome using the same mechanism.
86
So it is the patterns we share that allow this method to work.
87
Recommendation systems based on these ideas are in widespread use today, whether it's movies, music, news articles, or anything else you search for online.
88
The things
89
that are recommended to you are based on patterns the machine has observed in other people who are similar to yourself.

アプリをダウンロード

流暢に話すために必要なすべて

AI発音採点文ごとに採点
IPA練習すべての音をマスター
単語学習自分の単語帳を作る
単語ゲーム遊びながら覚える
FOR YOU

おすすめ動画

このレッスンの語彙とスピーキングのポイント

このスピーキングレッスンは、動画「The Math Behind Recommender Systems」を教材にしています。 繰り返し出てくる語は次のとおりです:feature, movie, preference, matrix, user。 この動画には、シャドーイング用の文が89文、単語が1284語あります。 音声の長さは8:04です。 話す速さは1分あたり約159語で、日常会話に近い自然なペースです。 単語の84%は英語の頻出3,000語に含まれます。残りは練習の前に確認しておきましょう。

この動画の重要語彙

動画に出てくる覚えておきたい単語15語を、発音と意味つきで紹介します。

単語発音意味
preference 名詞/ˈpɹɛf(ə)ɹ(ə)ns/選択
filter 名詞/ˈfɪltɚ/濾過器, フィルター
predict 動詞/pɹɪˈdɪkt/予言する
solve 動詞/sɒlv/解決する
prediction 名詞/pɹɪˈdɪkʃən/予言, 予測
label 名詞/ˈleɪ.bəl/荷札, 貼り札
discover 動詞/dɪˈskʌvə/発見する, 見つける
estimate 名詞/ˈɛs.tɪ.mət/推定
implement 動詞/ˈɪmpləmənt/実行する, 実現する
recommendation 名詞/ˌɹɛkəmɛnˈdeɪʃən/勧告, 推薦
extract 名詞/ˈɛkstɹækt/エキス, 越幾斯
accurately 副詞/ˈæk.jə.ɹɪt.li/正確に
incomplete 形容詞/ɪn.kəmˈpliːt/不完全, 未完
wage 名詞/weɪd͡ʒ/給料, サラリー
recall 動詞/ɹɪˈkɔl/呼び返す

動画に出てくる句動詞

単語発音意味
fill out 動詞/fɪl ˈaʊt/書き込む, 記入する
throw away 動詞棄てる, 捨てる

繰り返し練習したい文

動画に出てくる短く完結した文です。日常会話でそのまま使えます。

  • How should we make these predictions?
  • To simplify, let's return to a matrix representation.
  • Sometimes we simply can't explain why we like things.

この動画の文法

話し手がよく使っている文型を、動画の実際の表現とともに紹介します。

文型動画での表現
受動態 be + 過去分詞 — 誰がするかより、何が起きるかに焦点を当てるis visually represented · is called · is also mapped
現在完了形 have/has + 過去分詞 — 過去の出来事が今も関係しているyou've never seen · have only seen · has also been applied
関係詞節 who / which + 節 — 人や物について情報を加えるfiltering, which is · people who are

注意したい発音

話し手はaren't, can't, don'tなど、短縮形や弱形を6回使っています。聞こえたとおりの短い形で発音しましょう。

  • 「th」の音: gather /ˈɡæðɚ/, mathematical /ˌmæθ(.ə)ˈmæt.ɪ.kəl/, algorithm /ˈælɡəɹɪðm̩/, synthetic /sɪnˈθɛtɪk/, thickness /ˈθɪknəs/
  • 「sh」と「zh」の音: prediction /pɹɪˈdɪkʃən/, recommendation /ˌɹɛkəmɛnˈdeɪʃən/, representation /ˌɹɛp.ɹə.zɛnˈteɪ.ʃən/, tissue /ˈtɪʃ.(j)u/, motivation /ˈmoʊ.tə.veɪ.ʃən/
  • 長い単語(アクセントの位置に注意): collaborative /kəˈlæb.ə.ɹə.tɪv/, recommendation /ˌɹɛkəmɛnˈdeɪʃən/, accurately /ˈæk.jə.ɹɪt.li/, approximate /əˈpɹɑk.sə.mət/, representation /ˌɹɛp.ɹə.zɛnˈteɪ.ʃən/

日本語話者が苦手な音:

  • /r/ と /l/ の区別 — /l/ は舌先を歯茎につけ、/r/ はどこにもつけない: collaborative /kəˈlæb.ə.ɹə.tɪv/, accurately /ˈæk.jə.ɹɪt.li/, regardless /ɹɪˈɡɑɹd.lɪs/, recall /ɹɪˈkɔl/, neutral /ˈnuː.tɹəl/
  • /v/ — /b/ にならないように、上の歯を下唇に当てる: collaborative /kəˈlæb.ə.ɹə.tɪv/, solve /sɒlv/, discover /dɪˈskʌvə/, arrive /əˈɹaɪv/, reverse /ɹɪˈvɝs/
  • /f/ — 「フ」ではなく、上の歯と下唇で出す: preference /ˈpɹɛf(ə)ɹ(ə)ns/, filter /ˈfɪltɚ/, define /dɪˈfaɪn/, flip /flɪp/, flux /flʌks/

この動画での練習方法

  1. まず声を出さずに動画を最後まで聞き、知らない単語をメモします。
  2. まず0.75倍速で一文ずつシャドーイングし、慣れてきたら通常の速度に戻します。
  3. 自分の声を録音して元の音声と比べます。preference, filter, predictなどの単語に特に注意しましょう。

シャドーイングとは?英語上達に効果的な理由

シャドーイング(Shadowing)は、もともとプロの通訳者養成プログラムで開発された言語学習法で、多言語習得者として知られるDr. Alexander Arguelles によって広く普及されました。方法はシンプルですが非常に効果的:ネイティブスピーカーの英語を聞きながら、1〜2秒の遅延で声に出してすぐに繰り返す——まるで「影(shadow)」のように話者を追いかけます。文法ドリルや受動的なリスニングと異なり、シャドーイングは脳と口の筋肉が同時にリアルタイムで英語を処理・再現することを強制します。研究により、発音精度、抑揚、リズム、連音、リスニング力、そして会話の流暢さが大幅に向上することが確認されています。IELTSスピーキング対策や自然な英語コミュニケーションを目指す方に特におすすめです。

シャドーイングのやり方: ステップ別の完全ガイドを読む →