Fast insertion methods of a double-array structure

DOI10.1002/1097-024X(200101)31:1%3C43::AID-SPE356%3E3.0.CO;2-RMaRDI QIDQ2721222zbMATH OpenFDO

Authors Kazuhiro Morita, Masao Fuketa, Yoshihiro Yamakawa, Jun-ichi Aoe

Publication date 1 July 2001

Published in Software. Practice \& Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/1097-024X(200101)31:1%3C43::AID-SPE356%3E3.0.CO;2-R

zbMATH Keywords

dictionarydigital searchinformation retrievalkey retrieval strategynatural language processing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Natural language processing (68T50) Computing methodologies and applications (68U99)

Recommendations

• A new compression method of double array for compact dictionaries
• An Efficient Trie Construction for Natural Language Dictionaries
• New trie data structures which support very fast search operations
• An efficient representation for implementing finite state machines based on the double-array
• A dynamic construction algorithm for the compact Patricia trie using the hierarchical structure.

Cites work

• Efficient string matching
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)

Cited in

(3)

• Fast dynamic arrays
• An efficient representation for implementing finite state machines based on the double-array
• NP-completeness on the length of double-arrays and the sparse matrix problem with at least logarithmic alphabets/widths

This page was built for publication: Fast insertion methods of a double-array structure

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