A new compression method of double array for compact dictionaries

DOI10.1080/00207160410001714600MaRDI QIDQ4828662zbMATH OpenOpenAlexFDO

Authors Masao Fuketa, Kazuhiro Morita, Toru Sumitomo, Shinkaku Kashiji, Elsayed Atlam, Jun-ichi Aoe

Publication date 26 November 2004

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

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

zbMATH Keywords

information retrievalnatural language analysis

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50)

Recommendations

• Compressed data structures: Dictionaries and data-aware measures
• Compressed string dictionaries via data-aware subtrie compaction
• scientific article; zbMATH DE number 2182423
• Compressed matching in dictionaries
• Compressed Dictionaries: Space Measures, Data Sets, and Experiments
• Special issue: Dictionary based compression

Cited in

(4)

• A link trie structure of storing multiple attribute relationships for natural language dictionaries
• Fast insertion methods of a double-array structure
• An Efficient Trie Construction for Natural Language Dictionaries
• An efficient representation for implementing finite state machines based on the double-array

Describes a project that uses

Uses Software

• WordNet

This page was built for publication: A new compression method of double array for compact dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828662)