Ubuntu
snowball package

snowball 0+svn585-1build1 source package in Ubuntu

Changelog

snowball (0+svn585-1build1) bionic; urgency=high

  * No change rebuild to pick up -fPIE compiler default

 -- Balint Reczey <email address hidden>  Tue, 03 Apr 2018 12:44:23 +0000

Upload details

Uploaded by:
Balint Reczey
Uploaded to:
Bionic
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
libs
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release main libs

Downloads

File Size SHA-256 Checksum
snowball_0+svn585.orig.tar.gz 6.5 MiB 03ceb3cb86abf880ef58a4948b77cc05fcdeccce3577e560137ac6daf20d0ce4
snowball_0+svn585-1build1.debian.tar.xz 6.4 KiB 700b0f1b14d997a8d162a7a6d70460f49573d27da717244d926f15198c2f1d79
snowball_0+svn585-1build1.dsc 2.2 KiB 7b25550dc3e469c8ba5696588141a8dcb2be77481b8901590d9abb0a838794fd

View changes file

Binary packages built by this source

libstemmer-dev: No summary available for libstemmer-dev in ubuntu disco.

No description available for libstemmer-dev in ubuntu disco.

libstemmer-tools: Simple word stemming utility using Snowball

 Snowball 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".
 .
 Snowball provides algorithms for several (mainly European) languages.
 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.
 .
 This package contains "stemwords", a simple utility for stemming words.

libstemmer0d: Snowball stemming algorithms for use in Information Retrieval

 Snowball 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".
 .
 Snowball provides algorithms for several (mainly European) languages.
 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.

libstemmer0d-dbg: Snowball stemming algorithms, debugging symbols

 Snowball provides access to efficient algorithms for calculating a
 "stemmed" form of a word.
 .
 This package contains the debugging symbols associated with Snowball. gdb
 will automatically use these symbols when debugging programs linked with
 Snowball.