STL and Boost based programs in C Plus Plus

Implementation of a Patricia/radix tree data structure, storing a dictionary.

Identifies and removes specific Parts-of-Speech from a given text.

A DIY text-editor with autocomplete and spell checking feature.

A Trie data structure which can be searched using wild characters.

Projet d’algorithmie (ALGAV - Master 1 STL, à l'UPMC) : Implémentation et études en Java de tries «Hybrides» et «Arbre de la Briandais» - Note : 19/20

Word Autocompletion using Trie Data Structure.

Repository for course project, Data Structures & Algorithms - Spring 2017.

Backup for Advanced Data Structures class labs

simple data structures for C

Prefix Trie data structure with Pattern Matching, in C++

Efficient and reliable memoization using WeakMaps and tries

Natural Language Processing algorithms implementation. Current implementation features sentence completion and knowledge building

Contains CPP code for prefix searching using Trie (n-ary trees)

Data Structures and Algorithms course solutions

An implementation of Tries Algorithm in C.

Given an input file with keywords and their synonyms, find the frequency of their occurrences in a body of text entered through standard input.