Bag of Words Challenge ๐Ÿงบ๐Ÿ”ข

Fill the count table by hand. You have 60 seconds. Counts must match the vocabulary columns exactly. (No word order โ€” just counts!)
๐ŸŽฏ Round: 1
โณ Time Left: 60s
๐Ÿ† Score: โ€”
๐Ÿ“š What is Bag of Words?

Bag of Words (BoW) is a fundamental concept in Natural Language Processing (NLP) and Machine Learning. It's a simple yet powerful way to convert text into numbers that computers can understand and analyze.

Key Concepts:

๐ŸŽฏ Example:
Documents: ["I love pizza", "Pizza is great", "I love food"]
Vocabulary: [i, love, pizza, is, great, food]
BoW Matrix:
Doc 0: [1, 1, 1, 0, 0, 0] โ† "I love pizza"
Doc 1: [0, 0, 1, 1, 1, 0] โ† "Pizza is great"
Doc 2: [1, 1, 0, 0, 0, 1] โ† "I love food"

๐Ÿš€ Real-World Applications:

๐ŸŽฎ How This Game Works:
You'll see 3 text messages and a vocabulary of unique words. Your job is to manually count how many times each vocabulary word appears in each message. This hands-on practice helps you understand exactly how computers process text for machine learning!
๐Ÿง  Your Mission
1) Read the 3 messages
2) Look at the vocabulary words
3) Fill counts in each cell (0,1,2...)
4) Submit before time runs out!
๐Ÿ“š Vocabulary (columns)
Tip: Words are lowercased. Punctuation is ignored.
Click Start Timer when youโ€™re ready. You can submit early.
๐Ÿ“Š Fill the Count Table Rows = messages, Columns = vocabulary words