Germann, Ulrich; Eric Joanis; Larkin, Samuel (2009). „Tightly packed tries: how to fit large models into memory, and make them load fast, too”(PDF). ACL Workshops: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing. Association for Computational Linguistics. стр. 31—39. „We present Tightly Packed Tries (TPTs), a compact implementation of read-only, compressed trie structures with fast on-demand paging and short load times. We demonstrate the benefits of TPTs for storing n-gram back-off language models and phrase tables for statistical machine translation. Encoded as TPTs, these databases require less space than flat text file representations of the same data compressed with the gzip utility. At the same time, they can be mapped into memory quickly and be searched directly in time linear in the length of the key, without the need to decompress the entire file. The overhead for local decompression during search is marginal.”
Aho, Alfred V.; Corasick, Margaret J. (1975). „Efficient string matching”. Communications of the ACM. 18 (6): 333—340. S2CID207735784. doi:10.1145/360825.360855.
Daciuk, Jan; Stoyan Mihov; Watson, Bruce W.; Watson, Richard E. (2000). „Incremental Construction of Minimal Acyclic Finite-State Automata”. Computational Linguistics. Association for Computational Linguistics. 26: 3—16. S2CID3265924. doi:10.1162/089120100561601. Архивирано из оригинала 30. 09. 2011. г. Приступљено 28. 5. 2009. „This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly”
Daciuk, Jan; Stoyan Mihov; Watson, Bruce W.; Watson, Richard E. (2000). „Incremental Construction of Minimal Acyclic Finite-State Automata”. Computational Linguistics. Association for Computational Linguistics. 26: 3—16. S2CID3265924. doi:10.1162/089120100561601. Архивирано из оригинала 30. 09. 2011. г. Приступљено 28. 5. 2009. „This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly”
Aho, Alfred V.; Corasick, Margaret J. (1975). „Efficient string matching”. Communications of the ACM. 18 (6): 333—340. S2CID207735784. doi:10.1145/360825.360855.
Daciuk, Jan; Stoyan Mihov; Watson, Bruce W.; Watson, Richard E. (2000). „Incremental Construction of Minimal Acyclic Finite-State Automata”. Computational Linguistics. Association for Computational Linguistics. 26: 3—16. S2CID3265924. doi:10.1162/089120100561601. Архивирано из оригинала 30. 09. 2011. г. Приступљено 28. 5. 2009. „This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly”
Daciuk, Jan; Stoyan Mihov; Watson, Bruce W.; Watson, Richard E. (2000). „Incremental Construction of Minimal Acyclic Finite-State Automata”. Computational Linguistics. Association for Computational Linguistics. 26: 3—16. S2CID3265924. doi:10.1162/089120100561601. Архивирано из оригинала 30. 09. 2011. г. Приступљено 28. 5. 2009. „This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly”
