Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix ValueError when instantiating SparseTermSimilarityMatrix #2689

Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions gensim/similarities/levenshtein.py
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@
This module provides a namespace for functions that use the Levenshtein distance.
"""

from itertools import islice
import itertools
import logging
from math import floor

Expand Down Expand Up @@ -150,4 +150,4 @@ def most_similar(self, t1, topn=10):
for (similarity, t2) in sorted(similarities, reverse=True)
if similarity > 0
)
return islice(most_similar, topn)
return itertools.islice(most_similar, int(topn))
5 changes: 5 additions & 0 deletions gensim/test/test_similarities.py
Original file line number Diff line number Diff line change
Expand Up @@ -1225,6 +1225,11 @@ def test_most_similar(self):
second_similarities = numpy.array([similarity for term, similarity in index.most_similar(u"holiday", topn=10)])
self.assertTrue(numpy.allclose(first_similarities ** 2.0, second_similarities))

# check proper integration with SparseTermSimilarityMatrix
index = LevenshteinSimilarityIndex(self.dictionary, alpha=1.0, beta=1.0)
similarity_matrix = SparseTermSimilarityMatrix(index, dictionary)
self.assertTrue(scipy.sparse.issparse(similarity_matrix.matrix))


if __name__ == '__main__':
logging.basicConfig(format='%(asctime)s : %(levelname)s : %(message)s', level=logging.DEBUG)
Expand Down