An Efficient Trie Construction for Natural Language Dictionaries
From MaRDI portal
Publication:4551463
Recommendations
Cites work
Cited in
(8)- A link trie structure of storing multiple attribute relationships for natural language dictionaries
- Fast insertion methods of a double-array structure
- A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.
- scientific article; zbMATH DE number 2185642 (Why is no real title available?)
- Anatree
- Algorithms for trie compaction
- Dictionary compression and information source correction
- Constructing Efficient Dictionaries in Close to Sorting Time
This page was built for publication: An Efficient Trie Construction for Natural Language Dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551463)