English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Paper

DAFSA: a Python library for Deterministic Acyclic Finite State Automata [Software]

MPS-Authors
/persons/resource/persons220957

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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

shh2515.pdf
(Publisher version), 728KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Tresoldi, T. (2020). DAFSA: a Python library for Deterministic Acyclic Finite State Automata [Software]. The Journal of Open Source Software, 5(46): 1986. doi:10.21105/joss.01986.


Cite as: https://hdl.handle.net/21.11116/0000-0005-AD0D-B
Abstract
This work describes dafsa, a Python library for computing graphs from lists of strings for
identifying, visualizing, and inspecting patterns of substrings. The library is designed for
usage by linguists in studies on morphology and formal grammars, and is intended for faster, easier, and simpler generation of visualizations. It collects frequency weights by default, it can condense structures, and it provides several export options. Figure 1 depicts a basic DAFSA, based upon five English words and generated with default settings.