Snowball stemming algorithms, for information retrieval
Project description
Stemming algorithms
PyStemmer provides access to efficient algorithms for calculating a “stemmed” form of a word. This is a form with most of the common morphological endings removed; hopefully representing a common linguistic base form. This is most useful in building search engines and information retrieval software; for example, a search with stemming enabled should be able to find a document containing “cycling” given the query “cycles”.
PyStemmer provides algorithms for several (mainly european) languages, by wrapping the libstemmer library from the Snowball project in a Python module.
It also provides access to the classic Porter stemming algorithm for english: although this has been superseded by an improved algorithm, the original algorithm may be of interest to information retrieval researchers wishing to reproduce results of earlier experiments.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
File details
Details for the file PyStemmer-2.2.0.tar.gz
.
File metadata
- Download URL: PyStemmer-2.2.0.tar.gz
- Upload date:
- Size: 698.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.1 CPython/3.10.8
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | e2171b91b86bb1c6a9dddf09e8c867e488f8bd69bde07d0410a35cdcee0d857c |
|
MD5 | b0bf0271bc3715418d09c1a5f98d0a53 |
|
BLAKE2b-256 | b53088cf6197726de7ad8b7d3227582df3087ffd6ab53b9f0d9370ce084403e9 |