An Efficient Trie Construction for Natural Language Dictionaries

DOI10.1080/00207160211286zbMATH Open1021.68095OpenAlexW2029271007MaRDI QIDQ4551463FDOQ4551463

Authors:

Publication date: 21 October 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160211286

Recommendations

• A new compression method of double array for compact dictionaries
• Algorithms for trie compaction
• scientific article; zbMATH DE number 2185642
• An experimental study of compression methods for dynamic tries
• Fast Compressed Tries through Path Decompositions

zbMATH Keywords

trie structuredigital searchkey retrieval algorithm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Natural language processing (68T50)

Cites Work

• Efficient string matching
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Storing a sparse table
• A Method for Improving String Pattern Matching Machines
• A practical method for reducing sparse matrices with invariant entries
• Compressed tries
• Algorithms for trie compaction

Cited In (8)

• Fast insertion methods of a double-array structure
• A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.
• Title not available (Why is that?)
• Anatree
• Algorithms for trie compaction
• Dictionary compression and information source correction
• Constructing Efficient Dictionaries in Close to Sorting Time
• A link trie structure of storing multiple attribute relationships for natural language dictionaries

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)