Paket: libstemmer-dev (2.2.0-4 och andra) [debports]

[ Källkod:  ]

Snowball stemming algorithms, development kit

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 the static library and header files used in development.

Andra paket besläktade med libstemmer-dev

• dep: libstemmer0d (= 2.2.0-4+b1)

  Snowball stemming algorithms for use in Information Retrieval

Hämta libstemmer-dev

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Version	Paketstorlek	Installerad storlek	Filer
m68k (inofficiell anpassning)	2.2.0-4+b1	133,2 kbyte	911,0 kbyte	[filförteckning]