An Efficient Trie Construction for Natural Language Dictionaries (Q4551463): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for trie compaction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Method for Improving String Pattern Matching Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A practical method for reducing sparse matrices with invariant entries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compressed tries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storing a sparse table / rank | |||
Normal rank |
Latest revision as of 15:17, 4 June 2024
scientific article; zbMATH DE number 1791199
Language | Label | Description | Also known as |
---|---|---|---|
English | An Efficient Trie Construction for Natural Language Dictionaries |
scientific article; zbMATH DE number 1791199 |
Statements
An Efficient Trie Construction for Natural Language Dictionaries (English)
0 references
21 October 2003
0 references
digital search
0 references
key retrieval algorithm
0 references
trie structure
0 references