Labeling dynamic XML trees

By Edith Cohen, Haim Kaplan, Tova Milo. SIAM journal on computing (Print), 2002

358 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Probing What Different NLP Tasks Teach Machines about Function Word Comprehension (2019, background): “Su-pertags are similar to part-of-speech tags but capture more syntactic context (“almost-parsing”; Bangalore and Joshi, 1999).”
TIMBER: A native XML database (2002, neutral): “Updates are an issue in any such labeling scheme, see [14].”
Linguistic Knowledge and Transferability of Contextual Representations (2019, background): “It is considered “almost parsing” (Bangalore and Joshi, 1999), since a sequence of supertags maps a sentence to a small set of possible parses.”
MonetDB/XQuery: a fast XQuery processor powered by a relational engine (2006, neutral): “, node insertions, subtree deletions) are to be processed [11].”
ViST: a dynamic index method for querying XML data by tree structures (2003, neutral): “Cohen et al [8] introduced a dynamic labeling scheme, which is indispensable for dynamic index structures.”
LSTM CCG Parsing (2016, background): “Supertagging is almost parsing (Bangalore and Joshi, 1999)—consequently the task is very chal- Algorithm 1 Agenda-based parsing algorithm Definitions x1...”