Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
libskk is a library to deal with Japanese kana-to-kanji conversion method.
This module provides a utility method, "to_identifier" for converting an arbitrary string into a readable representation using the ASCII subset of "\w" for use as an identifier in a computer program. The intent is to make unique identifier names from which the content of the original string can be easily inferred by a human just by reading the identifier.
This module provides a regular expression for finding numbers in English text. It also provides functions for extracting and manipulating such numbers.
This module applies the Porter Stemming Algorithm to its parameters, returning the stemmed Russian (KOI8-R only) word.
This package contains dictionary data derived from ipadic for use with MeCab.
Praat is a tool to perform phonetics tasks. It can do speech analysis (pitch, formant, intensity, ...), speech synthesis, labelling, segmenting and manipulation.
This module extends the functionality of Lingua::EN::Inflect with three new functions for determining plurality of a word and forcefully converting a word to singular or plural.
Liblouis is a braille translator and back-translator named in honor of Louis Braille. It features support for computer and literary braille, supports contracted and uncontracted translation for many languages and has support for hyphenation. New languages can easily be added through tables that support a rule- or dictionary based approach. Tools for testing and debugging tables are also included. Liblouis also supports math braille, Nemeth and Marburg.
Lingua::Stem::Snowball::Da is a perl port of the danish stemmer at http://snowball.sourceforge.net, it was originally altered from the Lingua::Stem::Snowball::Se.
This module is a rather incomplete implementation of work done by Gudrun Putze-Meier.
UniDic for morphological analysis is a dictionary for analysis with the morphological analyser MeCab, where the short units exported from the database are used as entries (heading terms).
Lingua::Stem::Snowball::No is a perl port of the norwegian stemmer at http://snowball.tartarus.org.
This module uses a modified version of the Porter Stemming Algorithm to return a stemmed French word.
Liblouisutdml is a library providing complete braille transcription services for xml, html and text documents. It translates into appropriate braille codes and formats according to its style sheet and the specifications in the document.
This module implements a Portuguese stemming algorithm proposed in the paper A Stemming Algorithm for the Portuguese Language by Moreira, V. and Huyck, C.
Lingua::EN::Inflect provides plural inflections, "a"/"an" selection for English words, and manipulation of numbers as words. Plural forms of all nouns, most verbs, and some adjectives are provided. Where appropriate, "classical" variants (for example: "brother" -> "brethren", "dogma" -> "dogmata", etc.) are also provided.
LibStemmer provides stemming library, supporting several languages.
Nimf is a lightweight, fast and extensible input method framework. This package provides a fork of the original nimf project, that focuses especially on Korean input (Hangul, Hanja, ...).
Lingua::Stem::Snowball::Se is a perl port of the swedish stemmer at http://snowball.sourceforge.net.
This module attempts to pluralize or singularize short English phrases.
Chewing is an intelligent phonetic (Zhuyin/Bopomofo) input method, one of the most popular choices for Traditional Chinese users.
DParser is scannerless GLR parser generator. The form of the text to be parsed can be specified using a combination of regular expressions and grammar productions. Because of the parsing technique, a scannerless GLR parser based on the Tomita algorithm the grammar can be ambiguous, right or left recursive, have any number of null productions, and because there is no separate tokenizer, can include whitespace in terminals and have terminals which are prefixes of other terminals.
This module will tell you if a number, either in words or as digits, is a cardinal or ordinal number.
This module converts English text into numbers. It supports both ordinal and cardinal numbers, negative numbers, and very large numbers.