Search results for "module:Text::Trie"
Text::Ux - More Succinct Trie Data structure (binding for ux-trie)
Text::Ux is a perl bindng for ux-trie. <https://code.google.com/p/ux-trie/>...
JIRO/Text-Ux-0.11 - 03 Feb 2015 09:13:46 UTC
Text::Tx - Perl interface to Tx by OKANOHARA Daisuke
Tx is a library for a compact trie data structure by OKANOHARA Daisuke. Tx requires 1/4 - 1/10 of the memory usage compared to the previous implementations, and can therefore handle quite a large number of keys (e.g. 1 billion) efficiently. Suppose w...
DANKOGAI/Text-Tx-0.02 - 21 Feb 2009 14:49:14 UTC
Text::DAWG - directed acyclic word graphs
Text::DAWG implements implements string set recognition by way of directed acyclic word graphs....
BLGL/Text-DAWG-0.001 - 20 Feb 2011 17:32:11 UTC
Text::Scan - Fast search for very large numbers of keys in a body of text.
This module provides facilities for fast searching on strings with very many search keys. The basic object behaves somewhat like a perl hash, except that you can retrieve based on a superstring of any keys stored. Simply scan a string as shown above ...
TBUSCH/Text-Scan-0.31 - 02 Sep 2010 18:42:02 UTC
Text::Darts - Perl interface to DARTS by Taku Kudoh
Darts, or Double-ARray Trie System is a C++ Template Library by Taku Kudoh. This module makes use of Darts to implement global replace like below; $str = s{ (foo|bar|baz) }{ "<<$1>>" }msgex; The problem with regexp is that it is slow with alterations...
DANKOGAI/Text-Darts-0.10 - 14 Jun 2022 02:13:02 UTC
Text::SpeedyFx - tokenize/hash large amount of strings efficiently
XS implementation of a very fast combined parser/hasher which works well on a variety of *bag-of-word* problems. Original implementation <http://www.hpl.hp.com/techreports/2008/HPL-2008-91R1.pdf> is in Java and was adapted for a better Unicode compli...
SYP/Text-SpeedyFx-0.014 - 08 Jul 2022 10:07:25 UTC
Text::Prefix::XS - Fast prefix searching
This module implements a variety of algorithms to ensure fast prefix matching. It is particularly high performant with pessimistic matching (when a match is unlikely), but is still faster than other methods with optimistic matching (when a match is l...
MNUNBERG/Text-Prefix-XS-0.15 - 28 Dec 2011 07:14:46 UTC
Text::Match::FastAlternatives - efficient search for many strings
This module allows you to search for any of a list of substrings ("keys") in a larger string. It is particularly efficient when the set of keys is large. This efficiency comes at the cost of some flexibility: if you want case-insensitive matching, yo...
ARC/Text-Match-FastAlternatives-1.05 - 28 Dec 2012 15:40:55 UTC