NLP.Partage.Auto.DAWG

A version where the grammar is actually compressed to a form of a single directed acyclic word graph, i.e. a minimal finite state automaton.

Documentation

fromGram :: (Ord n, Ord t) => FactGram n t -> GramAuto n t

Build the DAWG-based representation of the given grammar.