A Python tool which takes the license text from the user, compares it with the SPDX License List using an algorithm which finds close matches and returns differences if the input license text is found to be a close match.
A Redis server is used to store the license texts.
spdx-license-matcher -f filename -t thresholdfilenameis the file with the license text (required)thresholdis a value up to which we will just won't consider a match (optional; default: 0.9)
Run spdx-license-matcher --help for more info.
Ensure that you are using Python 3 for installation of the tool.
-
Clone the repository
git clone https://github.com/spdx/spdx-license-matcher.git
-
Make a Python3 virtual environment
cd spdx-license-matcher python3 -m venv virtual-env-name -
Activate the virtual environment
source virtual-env-name/bin/activate -
Install spdx-license-matcher with required dependencies inside the virtual environment
pip install . -
Install Redis (or Valkey) server on your local machine
-
Linux
sudo apt-get install redis-server
-
macOS
brew install redis
To run the Redis server:
redis-server /opt/homebrew/etc/redis.conf
To run the Redis whenever your computer starts:
brew services start redis
-
Windows
Download the Redis server from https://github.com/microsoftarchive/redis/releases and install it.
Make sure the Redis/Valkey server is running and keep it running until you are done using the tool.
-
To test if the Redis is working:
redis-cli ping
If it returns
PONGthen you are good to go. -
For the very first time it may take a while to build the license.
-
SPDX_REDIS_HOSTenvironment variable can be set to the location of your Redis/Valkey server (default islocalhost). The port is6379.
-
The workflow of the tool is as follows:
-
Reads the license text as input from the user.
-
Build a Redis/Valkey database with all the license text present on the SPDX License List.
-
Compare the license text with the license text present in the database.
- Normalizes the license text based on the SPDX Matching guidelines while ignore the replaceable text and only focusing on substantial text for matching purposes.
- Tokenizes the normalized text into a list of bigrams. This is necessary for the token-based algorithm we are using for our use case.
- Use a token based similarity metric algorithm namely Sørensen-Dice algorithm which is based on the logic to find the common tokens, and divide it by the total number of tokens present by combining both of the sets. This algorithm helps us to distinguish our close matches.
- A threshold value is used where we just won't consider a match.
- If the match is 100% then we say it's a perfect match.
- If the match is between a threshold value and 100% then we apply the
full matching algorithms and compares the closely matched license text
to the license text of SPDX Standard License using a method
present in the SPDX tools.
- If there is a match then the given license text matches with the SPDX standard license.
- If there is no match then we simply display the differences of the given license text with that of SPDX License List.
- This project started as a Google Summer of Code 2019 project, with contribution from @ugtan.
- Now maintained by the SPDX community and updated for Python 3.
- See SPDX's participation in Google Summer of Code (GSoC): https://github.com/spdx/GSoC.