A package in C++ for character or word ngram analysis. It uses Ternary Search Tree instead of hashing table for faster ngram frequency counting. Words are converted to unique IDs and encoded to more compact base 256 integers. It is a partial implementation of Dr. Vlado Keselj 's Text-Ngrams 1.6, which is a very flexible Ngram package in perl.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
A C++ package that implements ternary search tree, which combines the time efficiency of digital tries with the space efficiency of binary search trees. It it is reported comparable with hashing table in most cases, and substantially faster than hashing for unsuccessful searches.
Geo Named Entity Exrtraction
Implementation of the FriendFeed Schema-less MySQL Pattern
My Blog