Anatree

DOI10.1145/2133803.2133804MaRDI QIDQ5406256zbMATH OpenOpenAlexWikidataFDO

Authors Charles Reams

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2133803.2133804

zbMATH Keywords

binary decision diagramconstraint satisfactionheuristicsnatural language

Mathematics Subject Classification ID

Data structures (68P05) Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Natural language processing (68T50)

Recommendations

• On the structure of anagrammatic encodings
• A generalization of the trie data structure
• scientific article; zbMATH DE number 4209550
• scientific article; zbMATH DE number 2185639
• Fast construction of generalized suffix trees over a very large alphabet
• An Efficient Trie Construction for Natural Language Dictionaries
• New trie data structures which support very fast search operations
• scientific article; zbMATH DE number 1268192

This page was built for publication: Anatree

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