crfmc / similarity-measures Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Python scripts used to calculate 3 basic similarity measures, suitable for ad hoc information retrieval systems: Levenshtein Edit Distance, Jaccard, and a Term-Document matrix.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
README.md		README.md
document_matrix.py		document_matrix.py
jaccard.py		jaccard.py
levenshtein.py		levenshtein.py

Repository files navigation

similarity-measures

This is a repository that contains 3 independent python scripts:

levenshtein.py

A program that uses a Numpy library to calculate the Levenshtein edit distance between two strings.

document_matrix.py

Calculates the document-term matrix from a collection of strings.

jaccard.py

Calculates the Jaccard similarity measure for two lists of strings.

About

Python scripts used to calculate 3 basic similarity measures, suitable for ad hoc information retrieval systems: Levenshtein Edit Distance, Jaccard, and a Term-Document matrix.

information-retrieval jaccard-similarity levenshtein-algorithm edit-distance-algorithm document-term-matrix

Report repository

Releases

No releases published

Packages

No packages published

Languages

Python 100.0%