Talk:Bag-of-words model

  This article is or was the subject of a Wiki Education Foundation-supported course assignment. Further details are available on the course page. Student editor(s): Yuxiaosun. Peer reviewers: Georgexie33.

Above undated message substituted from Template:Dashboard.wikiedu.org assignmentbyPrimeBOT (talk) 15:13, 16 January 2022 (UTC)Reply

That article just describes the kind of matrices that are produced by any algorithm that assumes a BoW model. Qwertyus (talk) 13:50, 31 August 2012 (UTC)Reply

• Sentence: John likes to watch movies. Mary likes too.
• Dictionary: [...] "likes": 2, [...]
• Matrix: [1, 1, 1, 1, 1, 0, 0, 0, 1, 1]
• Algorithm: [...] each entry of the vectors refers to count of the corresponding entry in the dictionary [...]

Shouldn't matrix look like this: [1, 2, 1, 1, 1, 0, 0, 0, 1, 1]?

89.76.114.24 (talk) 21:25, 24 November 2013 (UTC)MPReply

Indeed, I've corrected this. Compvis (talk) 22:28, 29 November 2013 (UTC)Reply

It seems strange to me that

"John likes to watch movies. Mary likes too"

is a commonly used text sample, because

"Mary likes too"

isn't a sentence, or a sentence fragment. I was going to replace it with a grammatically correct sentence, but I won't because googling a bit convinces me it's probably intentional, though I don't understand it.--Elvey (talk) 02:53, 3 December 2013 (UTC)Reply

I suggest we remove the redirect of continuous bag of words, since that is a distinct concept. DMH43 (talk) 15:31, 20 December 2023 (UTC)Reply