Readme
This is a small, barely working, incomplete implementation of a Directed Acyclic Word Graph, a.k.a. Minimal Acyclic Finite State Automaton, a data structure closely related to a Trie.
Its purpose is to efficiently store a large word dataset and allow for quick lookups, which is typically used in spell checkers, autocomplete engines or environments with limited memory.
The work here was largely inspired by Steve Hanov's article. The main difference is that this implementation should work with unsorted data, and allow value retrieval.
Use at your own risk. Patches welcome.
npm install udawg
FAQs
A micro directed acyclic word graph (DAWG) implementation
The npm package udawg receives a total of 0 weekly downloads. As such, udawg popularity was classified as not popular.
We found that udawg demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Tea.xyz, a crypto project aimed at rewarding open source contributions, is once again facing backlash due to an influx of spam packages flooding public package registries.
Security News
As cyber threats become more autonomous, AI-powered defenses are crucial for businesses to stay ahead of attackers who can exploit software vulnerabilities at scale.
Security News
UnitedHealth Group disclosed that the ransomware attack on Change Healthcare compromised protected health information for millions in the U.S., with estimated costs to the company expected to reach $1 billion.