-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathP6_vectorspace.py
33 lines (27 loc) · 1.54 KB
/
P6_vectorspace.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
import numpy as np
from sklearn.feature_extraction.text import CountVectorizer
from scipy.spatial.distance import euclidean, cityblock
from sklearn.metrics.pairwise import cosine_similarity
documents = [
"Shipment of gold damaged in a fire",
"Delivery of silver arrived in a silver truck",
"Shipment of gold arrived in a truck",
"Purchased silver and gold arrived in a wooden truck",
"The arrival of gold and silver shipment is delayed."
]
query = input("Enter a query sentence: ")
vectorizer = CountVectorizer(stop_words="english")
X = vectorizer.fit_transform(documents + [query]).toarray()
doc_vectors, query_vector = X[:-1], X[-1]
def compute_distances(doc_vectors, query_vector):
euclidean_distances = [euclidean(doc, query_vector) for doc in doc_vectors]
manhattan_distances = [cityblock(doc, query_vector) for doc in doc_vectors]
cosine_similarities = cosine_similarity(doc_vectors, query_vector.reshape(1, -1)).flatten()
return euclidean_distances, manhattan_distances, cosine_similarities
euclidean_distances, manhattan_distances, cosine_similarities = compute_distances(doc_vectors, query_vector)
top_2_euclidean = np.argsort(euclidean_distances)[:2] + 1
top_2_manhattan = np.argsort(manhattan_distances)[:2] + 1
top_2_cosine = np.argsort(-cosine_similarities)[:2] + 1
print("Euclidean Distance:", euclidean_distances,"\nTop 2 documents", top_2_euclidean)
print("Manhattan Distance:", manhattan_distances, "\nTop 2 documents",top_2_manhattan)
print("Cosine Similarity:", cosine_similarities,"\nTop 2 documents",top_2_cosine )