Dynamic Perfect Hashing with Finite-State Automata
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with minimal finite-state automata, the mapping is determined only by the (usually alphabetical) order of words in the set. Addition of new words would change the order of words already in the language of the automaton, changing the whole mapping, and making it useless in many domains. Therefore, we call it static. Dynamic minimal perfect hashing assigns consecutive numbers to consecutive words as they are added to the language of the automaton. Dynamic perfect hashing is important in many domains, including text retrieval and databases. We investigate three methods for its implementation.
Unable to display preview. Download preview PDF.
- 2.Lauri Karttunen. Constructing lexical transducers. In In Proc. of the 15th International Conference on Computational Linguistics, COLING’94, Kyoto, Japan, 1994.Google Scholar
- 3.Claudio Lucchiesi and Tomasz Kowaltowski. Applications of finite automata representing large vocabularies. Software Practice and Experience, 23(1):15–30, Jan. 1993.Google Scholar
- 5.Dominique Revuz. Dictionnaires et lexiques: méthodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France, 1991. LITP 91.44.Google Scholar
- 6.Strahil Ristov and Eric Laporte. Ziv Lempel compression of huge natural language data tries using suffix arrays. Journal of Discrete Algorithms, pages 241–256, 1999.Google Scholar
- 7.Bruce Watson. A fast new (semi-incremental) algorithm for the construction of minimal acyclic DFAs. In Third Workshop on Implementing Automata, pages 91–98, Rouen, France, September 1998. Lecture Notes in Computer Science.Google Scholar