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
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministi...
In this paper we study automata which work on directed ordered acyclic graphs, in particular those g...
Python library for computing Deterministic Acyclic Finite State Automata (DAFSA)
This work describes dafsa, a Python library for computing graphs from lists of strings for identifyi...
We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and u...
AbstractIn this paper, we present an on-line algorithm for adding words (strings) in deterministic d...
In this paper, we present an on-line algorithm for adding words (strings) in deterministic directed ...
\u3cp\u3eFailure deterministic finite automata (FDFAs) represent regular languages more compactly th...
summary:An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DA...
Graphs have a variety of uses in natural language processing, particularly as representations of lin...
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministi...
In this paper we study automata which work on directed ordered acyclic graphs, in particular those g...
Python library for computing Deterministic Acyclic Finite State Automata (DAFSA)
This work describes dafsa, a Python library for computing graphs from lists of strings for identifyi...
We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and u...
AbstractIn this paper, we present an on-line algorithm for adding words (strings) in deterministic d...
In this paper, we present an on-line algorithm for adding words (strings) in deterministic directed ...
\u3cp\u3eFailure deterministic finite automata (FDFAs) represent regular languages more compactly th...
summary:An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DA...
Graphs have a variety of uses in natural language processing, particularly as representations of lin...
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministi...
In this paper we study automata which work on directed ordered acyclic graphs, in particular those g...