Discover how computers can 'understand' word meanings and relationships just like you do!
Why Word similarity and analogies in NLP? - Purpose & Use Cases
Start learning this pattern below
Jump into concepts and practice - no test required
Imagine you have a huge list of words and you want to find which words mean similar things or how words relate to each other, like 'king' is to 'queen' as 'man' is to 'woman'. Doing this by hand means reading dictionaries or guessing relationships one by one.
Manually checking word meanings and relationships is slow and tiring. It's easy to miss subtle connections or make mistakes because words can have many meanings and contexts. This makes it hard to keep up with new words or slang.
Word similarity and analogies use smart math to turn words into numbers that capture their meaning. This lets computers quickly find words that are alike or solve analogy puzzles automatically, saving time and catching hidden links.
if word1 == 'king' and word2 == 'queen': print('related')
similarity = model.similarity('king', 'queen') print(similarity)
It lets machines understand and compare word meanings like humans do, unlocking smarter search, translation, and chatbots.
When you type a search query, the system can suggest related words or correct spelling by knowing which words are similar or connected.
Manual word comparison is slow and error-prone.
Word similarity uses math to capture meaning as numbers.
This helps machines find related words and solve analogies fast.
Practice
Solution
Step 1: Understand the concept of word similarity
Word similarity measures how close two words are in meaning, often represented by a number like cosine similarity.Step 2: Differentiate from other word properties
Frequency or letter count does not capture meaning closeness, so those options are incorrect.Final Answer:
How close two words are in meaning using numbers -> Option AQuick Check:
Word similarity = meaning closeness [OK]
- Confusing similarity with word frequency
- Thinking similarity is about word length
- Assuming similarity counts shared letters
vec1 and vec2 in Python using NumPy?Solution
Step 1: Recall cosine similarity formula
Cosine similarity = dot product of vectors divided by product of their norms.Step 2: Match formula to code
np.dot(vec1, vec2) / (np.linalg.norm(vec1) * np.linalg.norm(vec2)) matches the formula exactly using np.dot and np.linalg.norm.Final Answer:
np.dot(vec1, vec2) / (np.linalg.norm(vec1) * np.linalg.norm(vec2)) -> Option AQuick Check:
Cosine similarity = dot / (norm1 * norm2) [OK]
- Adding norms instead of multiplying
- Subtracting norms from dot product
- Multiplying dot product by sum of norms
king = [0.5, 0.8, 0.3] queen = [0.45, 0.75, 0.35] man = [0.6, 0.7, 0.2] woman = [0.55, 0.65, 0.25]
What is the closest word to the vector
king - man + woman?Solution
Step 1: Calculate the vector for king - man + woman
Subtract man from king: [0.5-0.6, 0.8-0.7, 0.3-0.2] = [-0.1, 0.1, 0.1]. Add woman: [-0.1+0.55, 0.1+0.65, 0.1+0.25] = [0.45, 0.75, 0.35].Step 2: Compare result to known vectors
The resulting vector matches queen exactly: [0.45, 0.75, 0.35].Final Answer:
queen -> Option CQuick Check:
king - man + woman = queen [OK]
- Not subtracting man vector before adding woman
- Mixing up vector addition order
- Choosing original words instead of analogy result
king - man + woman but has a flaw:import numpy as np
words = {'king': np.array([0.5, 0.8, 0.3]), 'queen': np.array([0.45, 0.75, 0.35]), 'man': np.array([0.6, 0.7, 0.2]), 'woman': np.array([0.55, 0.65, 0.25])}
result = words['king'] - words['man'] + words['woman']
max_word = None
max_sim = -1
for word, vec in words.items():
sim = np.dot(result, vec) / (np.linalg.norm(result) * np.linalg.norm(vec))
if sim > max_sim:
max_word = word
print(max_word)What is the main flaw?
Solution
Step 1: Analyze the similarity search loop
The loop compares the result vector to all words including 'king', 'man', and 'woman' which are part of the calculation.Step 2: Understand why this is problematic
Including original words can cause the highest similarity to be the input words themselves, which is usually unwanted and can cause misleading results.Final Answer:
The code does not exclude the original words from similarity search -> Option DQuick Check:
Exclude input words to avoid bias [OK]
- Assuming zero division error without checking norms
- Thinking max_sim initialization causes error
- Ignoring normalization in dot product
Paris is to France as Tokyo is to ? Using pre-trained word vectors, which approach is best to find the answer?Solution
Step 1: Understand analogy vector arithmetic
Analogies use the formula: word2 - word1 + word3 to find the missing word. Here, Paris is word1, France is word2, Tokyo is word3.Step 2: Apply formula to this analogy
Calculate Tokyo - Paris + France to get the vector representing the answer.Final Answer:
Calculate vector: Tokyo - Paris + France, then find closest word vector -> Option BQuick Check:
Analogy vector = word3 - word1 + word2 [OK]
- Swapping order of subtraction and addition
- Adding all vectors without subtraction
- Using wrong words in formula
