This routine applies the Porter Stemming Algorithm to its parameters, returning the stemmed words. It is derived from the C program "stemmer.c" as found in freewais and elsewhere, which contains these notes: Purpose: Implementation of the Porter stem...

A pangram is a text that contains every letter of the alphabet. This module provides utilities for identifying pangrams. $pangram->new Constructor. Receives the text that will be analyzed. $pangram->is_pangram Returns true if the supplied text is a p...

Text::DAWG implements implements string set recognition by way of directed acyclic word graphs....

This started as a spell and quality check for my novel, "Manuel the Magnificent Mechanical Man". Eventually, it can be used for checking any kind of markdown-formatted text, be it fiction or non-fiction. The first version included as documentation, t...

Parallel to the idea of JSP and PHP, PORE was designed to separate data from presentation. The data is encapsulated in Perl objects, like Java Beans. The presentation is represented by PORE::Template, like JSP files. PORE consists of a templating lan...

n-Gram analysis is a field in textual analysis which uses sliding window character sequences in order to aid topic analysis, language determination and so on. The n-gram spectrum of a document can be used to compare and filter documents in multiple l...

This modules provides a number of name normalization routines, plus high-level parsing and name comparison utilities such as those illustrated in the synopsis. While it tries to accommodate non-Western names, this module definitely works better with ...

Collins English Dictionary defines a "widow" in typesetting as: A short line at the end of a paragraph, especially one that occurs as the top line of a page or column. For example, in the text... How much wood could a woodchuck chuck if a woodchuck c...

This module implement text n-gram analysis, supporting several types of analysis, including character and word n-grams. The module Text::Ngrams is very flexible. For example, it allows a user to manually feed a sequence of any tokens. It handles seve...

This module provides a Perl interface to the GNU Aspell library. This module is to meet the need of looking up many words, one at a time, in a single session, such as spell-checking a document in memory. The GNU C interface is described at: http://as...

The "Text::BibTeX" module serves mainly as a high-level introduction to the "Text::BibTeX" library, for both code and documentation purposes. The code loads the two fundamental modules for processing BibTeX files ("Text::BibTeX::File" and "Text::BibT...

Text::CSV_XS provides facilities for the composition and decomposition of comma-separated values. An instance of the Text::CSV_XS class will combine fields into a "CSV" string and parse a "CSV" string into fields. The module accepts either strings or...

"Text::Summarize" contains routines for ranking the sentences in English text for inclusion in a summary using the sumBasic algorithm....

Text::Toalpha converts arbitary characters into letters. The interface is the functions toalpha($var) and fromalpha($alpha). They do what there names suggest. NOTE: This module does not use a code format used anywhere else. NOTE 2: The code for this ...

The module provides a way to extract shingles from a piece of text. Shingles can then be used for other operations such as clustering, deduplication, etc. Given a document, the w-shingles represent a set of sorted groups of *w* adjacent words in the ...

Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for names with the same pronunciation to be encoded to the same representation so that they can be matched despite minor differences in spelling. Sound...