Experiments with Automata Compression-Reference-Cited by-同舟云学术

Experiments with Automata Compression

Published:2001 Issue: Volume: Page:105-112
ISSN:0302-9743
Container-title:Implementation and Application of Automata
language:
Short-container-title:

Author:

Daciuk Jan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44674-5_8

Reference12 articles.

1. R.H. Baayen, R. Piepenbrock, and H. The CELEX Lexical Database (CD-ROM). Linguistic Data Consortium, University of Pennsylvania, Philadelphia, PA, 1993, 1993.

2. Jan Daciuk. Incremental Construction of Finite-State Automata and Transducers, and their Use in the Natural Language Processing. PhD thesis, Technical University of Gdańsk, 1998.

3. Jan Daciuk, Stoyan Mihov, Bruce Watson, and Richard Watson. Incremental construction of minimal acyclic finite state automata. Computational Linguistics, 26(1):3–16, April 2000.

4. George A. Kiraz. Compressed storage of sparse finite-state transducers. In Workshop on Implementing Automata WIA99-Pre-Proceedings, pages XIX-1–XIX-31. 1997.

5. Tomasz Kowal towski, Cláudio L. Lucchesi, and Jorge Stolfi. Finite automata and efficient lexicon implementation. Technical Report IC-98-02, January 1998.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Smaller Representation of Compiled Regular Expressions;Implementation and Application of Automata;2023

2. Enumerated Automata Implementation of String Dictionaries;Implementation and Application of Automata;2019

3. Fast construction of space-optimized recursive automaton;Software: Practice and Experience;2014-04-13

4. Smaller Representation of Finite State Automata;Implementation and Application of Automata;2011

5. Gazetteer Compression Technique Based on Substructure Recognition;Advances in Soft Computing