The concept of DAWGs is based on: Blumer, A. et al. (1985). The smallest automation recognizing the subwords of a text. Theoretical Computer Science, 40, 31–55.
-
Updated
Sep 13, 2022 - Java
The concept of DAWGs is based on: Blumer, A. et al. (1985). The smallest automation recognizing the subwords of a text. Theoretical Computer Science, 40, 31–55.
Pure-python reader for DAWGs on CircuitPython compatible boards.
Simple implementation of DAFSA minimization using Revuz's algorithm.
Pure-python reader for DAWGs created by dawgdic C++ library or DAWG Python extension. Fork of https://github.com/pytries/DAWG-Python
Implementation of Word Trie (directed acyclic word graph), which can be used while building basic chat-bots with simple mechanism with pre-defined responses for specific questions.
Scrabble game implemented using a microservices architecture. Technology stack: Spring (backend), Angular (frontend).
OCR reading assistant with opencv, Tesseract, kraken, DAWGs and a splay tree
A crossword game engine
Add a description, image, and links to the dawg topic page so that developers can more easily learn about it.
To associate your repository with the dawg topic, visit your repo's landing page and select "manage topics."