Why similarity measures find related text in NLP - Model Pipeline Impact

Model Pipeline - Why similarity measures find related text

This pipeline shows how similarity measures help find related text by turning words into numbers, comparing them, and scoring how close they are.

Data Flow - 5 Stages

1Raw Text Input

1000 sentences→Collect sentences to compare→1000 sentences

"I love apples." and "Apples are great."

↓

2Text Preprocessing

1000 sentences→Lowercase, remove punctuation, tokenize→1000 lists of words

"I love apples." -> ["i", "love", "apples"]

↓

3Vectorization

1000 lists of words→Convert words to number vectors (e.g., TF-IDF or word embeddings)→1000 vectors of size 300

["i", "love", "apples"] -> [0.1, 0.3, ..., 0.05]

↓

4Similarity Calculation

2 vectors of size 300→Calculate similarity score (e.g., cosine similarity)→1 similarity score between 0 and 1

Vector1 and Vector2 -> 0.85

↓

5Related Text Identification

1000 similarity scores→Find pairs with high similarity scores→List of related text pairs

"I love apples." and "Apples are great." with score 0.85

Training Trace - Epoch by Epoch

Loss
0.5 |****
0.4 |***
0.3 |**
0.2 |*
0.1 |
     +------------
      1 2 3 4 Epochs

Epoch	Loss ↓	Accuracy ↑	Observation
1	0.45	0.6	Initial similarity scores are rough but show some relation.
2	0.3	0.75	Model better captures related text pairs.
3	0.2	0.85	Similarity scores improve, showing clearer relatedness.
4	0.15	0.9	Model converges with high accuracy in finding related text.

Prediction Trace - 5 Layers

Layer 1: Input Text

Layer 2: Preprocessing

Layer 3: Vectorization

Layer 4: Similarity Calculation

Layer 5: Related Text Output

Model Quiz - 3 Questions

What does the similarity score close to 1 mean?

A The texts are very different

B The texts are very related

C The texts are empty

D The texts have no words

Key Insight

Similarity measures work by turning text into numbers that capture meaning, then comparing these numbers to find how close texts are. This helps computers find related sentences even if words differ.

Practice

1. Why do similarity measures help find related text in NLP?

easy

A. Because they compare numeric representations of texts to find closeness

B. Because they translate text into images for comparison

C. Because they count the number of words in each text

D. Because they randomly select texts to compare

Solution

1. Step 1: Understand text representation in NLP

   Texts are converted into numbers (vectors) so computers can compare them easily.

2. Step 2: Role of similarity measures

   Similarity measures calculate how close these numeric vectors are, showing relatedness.

3. Final Answer:

   Because they compare numeric representations of texts to find closeness -> Option A

4. Quick Check:

   Similarity = Numeric comparison [OK]

Hint: Similarity means comparing numbers, not words directly [OK]

Common Mistakes:

• Thinking similarity compares raw words directly
• Confusing similarity with random selection
• Believing similarity translates text into images

2. Which of the following is the correct way to calculate cosine similarity between two vectors A and B in Python?

easy

A. cos_sim = np.linalg.norm(A - B)

B. cos_sim = np.sum(A + B)

C. cos_sim = np.dot(A, B) / (np.linalg.norm(A) * np.linalg.norm(B))

D. cos_sim = np.dot(A, B) * (np.linalg.norm(A) + np.linalg.norm(B))

Solution

1. Step 1: Recall cosine similarity formula

   Cosine similarity = dot product of vectors divided by product of their lengths.

2. Step 2: Match formula to code

   cos_sim = np.dot(A, B) / (np.linalg.norm(A) * np.linalg.norm(B)) matches this formula exactly using numpy functions.

3. Final Answer:

   cos_sim = np.dot(A, B) / (np.linalg.norm(A) * np.linalg.norm(B)) -> Option C

4. Quick Check:

   Cosine similarity formula = cos_sim = np.dot(A, B) / (np.linalg.norm(A) * np.linalg.norm(B)) [OK]

Hint: Cosine similarity = dot product ÷ product of norms [OK]

Common Mistakes:

• Adding vectors instead of dot product
• Multiplying dot product by sum of norms
• Using norm of difference instead of cosine similarity

3. Given two texts converted to sets of words: text1 = {'apple', 'banana', 'cherry'} and text2 = {'banana', 'cherry', 'date'}, what is the Jaccard similarity between them?

medium

A. 0.25

B. 0.6

C. 0.75

D. 0.5

Solution

1. Step 1: Calculate intersection and union of sets

   Intersection = {'banana', 'cherry'} (2 items), Union = {'apple', 'banana', 'cherry', 'date'} (4 items).

2. Step 2: Compute Jaccard similarity

   Jaccard similarity = size of intersection ÷ size of union = 2 ÷ 4 = 0.5.

3. Final Answer:

   0.5 -> Option D

4. Quick Check:

   Jaccard = intersection/union = 0.5 [OK]

Hint: Jaccard = common words ÷ total unique words [OK]

Common Mistakes:

• Counting union incorrectly
• Using sum instead of division
• Confusing intersection with union size

4. The following Python code tries to compute cosine similarity but gives an error. What is the main issue?

import numpy as np
A = np.array([1, 2, 3])
B = np.array([4, 5])
cos_sim = np.dot(A, B) / (np.linalg.norm(A) * np.linalg.norm(B))
print(cos_sim)

medium

A. np.linalg.norm is used incorrectly

B. Vectors A and B have different lengths causing dot product error

C. Division by zero error

D. Missing import statement for numpy

Solution

1. Step 1: Check vector sizes

   Vector A has length 3, vector B has length 2, so dot product is invalid.

2. Step 2: Understand dot product requirements

   Dot product requires vectors of same length; mismatch causes error.

3. Final Answer:

   Vectors A and B have different lengths causing dot product error -> Option B

4. Quick Check:

   Dot product needs equal length vectors [OK]

Hint: Dot product needs vectors of same length [OK]

Common Mistakes:

• Assuming norm causes error
• Thinking division by zero happened
• Ignoring vector length mismatch

5. You want to find related news articles using similarity measures. Which approach best improves accuracy when articles have different lengths and some common words?

hard

A. Use cosine similarity on TF-IDF vectors to reduce common word impact

B. Use raw word counts and Jaccard similarity without preprocessing

C. Compare articles by counting total words only

D. Use random similarity scores to guess relatedness

Solution

1. Step 1: Understand TF-IDF role

   TF-IDF reduces weight of common words, highlighting unique terms in articles.

2. Step 2: Why cosine similarity on TF-IDF helps

   Cosine similarity measures angle between vectors, handling different lengths well.

3. Final Answer:

   Use cosine similarity on TF-IDF vectors to reduce common word impact -> Option A

4. Quick Check:

   TF-IDF + cosine similarity = better relatedness [OK]

Hint: TF-IDF + cosine similarity handles length and common words best [OK]

Common Mistakes:

• Ignoring word importance by using raw counts
• Using Jaccard without preprocessing
• Relying on random scores