Fast construction of space‐optimized recursive automaton. (13th April 2014)

• Record Type: Journal Article
• Authors: Ristov, Strahil; Korenčić, Damir
• Is Part Of: Software, practice & experience. Volume 45:Number 6(2015)
• Page Start: 783
• Page End: 799
• Publication Date: 2014-04-13
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2261
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2261-abs-0001"> <title>Summary</title> <p id="spe2261-para-0001">Finite‐state automata are important components in information retrieval and natural language processing software. A recursive automaton is the most compact representation of the acyclic deterministic finite‐state automata. It is based on merging not only the equivalent states but also the identical substructures in an automaton. The LZ trie variant is the state‐of‐the‐art in automata compression regarding space, but the time needed for its construction was, until now, quadratic, which has made it impractical for large inputs. In this paper, we present the first algorithm for LZ trie construction that runs in effectively linear time thereby making it an attractive choice for finite‐state automata implementation. We achieve this goal by adding a new functionality to the enhanced suffix array data structure. We present two variants of the construction procedure – an optimal method regarding the final size and a method that sacrifices some compression for low intermediate memory usage. We have made the implementation of our algorithms available in an open source software package <italic>LzLex</italic>.Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>