English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Other

DAFSA [Software]

MPS-Authors
/persons/resource/persons220957

Tresoldi,  Tiago
CALC, Max Planck Institute for the Science of Human History, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Tresoldi, T. (2019). DAFSA [Software]. GitHub. Retrieved from https://pypi.org/project/dafsa/#description.


Cite as: http://hdl.handle.net/21.11116/0000-0005-3B89-F
Abstract
DAFSA is a library for computing Deterministic Acyclic Finite State Automata (also known as "directed acyclic word graphs", or DAWG). DAFSA are data structures derived from tries that allow to represent a set of sequences (typically character strings or n-grams) in the form of a directed acyclic graph with a single source vertex (the start symbol of all sequences) and at least one sink edge (end symbols, each pointed to by one or more sequences). In the current implementation, a trait of each node expresses whether it can be used a sink.