Anatree

DOI10.1145/2133803.2133804zbMATH Open1284.68526OpenAlexW1979589956WikidataQ61068212 ScholiaQ61068212MaRDI QIDQ5406256

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

heuristicsnatural languageconstraint satisfactionbinary decision diagram

Mathematics Subject Classification ID

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

Related Items (1)

EERTREE: an efficient data structure for processing palindromes in strings

Recommendations

• New trie data structures which support very fast search operations 👍 👎
• EERTREE: an efficient data structure for processing palindromes in strings 👍 👎
• Fast Construction of Generalized Suffix Trees over a Very Large Alphabet 👍 👎
• An Efficient Trie Construction for Natural Language Dictionaries 👍 👎
• A generalization of the trie data structure 👍 👎
• On the structure of anagrammatic encodings 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)