Skip to main content
Help us improve Python packaging – donate today!

Directed Acyclic Word Graph (DAWG) allows to store huge strings set in compacted form

Project Description

pyDAWG implements DAWG structure. Testing if word is present in a set has complexity O(n), where n is length of tested string.

Algorithm used to build DAWG is incremental, memory overhead during graph construction is small.

Module supports also minimal perfect hashing — it is possible to get unique number for any word from a set, or find which word has assigned given number. This makes possible to use DAWG as a dictionary.

The module has been written in C. There is also a pure python version providing most of C version functionality.

Release history Release notifications

This version
History Node

1.1

History Node

1.0.0

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page