Parsing as tree traversal

Gerdemann, Dale

doi:10.3115/991886.991955

Cited by 5 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different syntactic parsing strategies can be viewed as different ways to traverse a tree. 58 A tree traversal visits nodes in a particular order; at any point, the set of nodes visited (and its complement) form parts of a tree. Thus the choice of parsing strategy affects which parts are available.…”

Section: (26)mentioning

confidence: 99%

Ellipsis: computation of

Kobele

2012

WIRES Cognitive Science

View full text Add to dashboard Cite

A computational account of ellipsis should specify not only how the meaning of an elliptical sentence is computed in context but also a description of what is being computed. Many proposals can be divided into two groups, as per whether they compute the meaning of an elliptical sentence based on the semantic or the syntactic parts of its context. A unifying theme of these proposals is that they are all based on the idea that the meaning of an elliptical sentence is determinable based on a structured representation which is transformationally related to its surface syntactic structure. WIREs Cogn Sci 2012, 3:411-418. doi: 10.1002/wcs.1168 For further resources related to this article, please visit the WIREs website.

show abstract

Section: (26)mentioning

confidence: 99%

Ellipsis: computation of

Kobele

2012

WIRES Cognitive Science

View full text Add to dashboard Cite

show abstract

“…Since the delimiter in C-DO-VLEI codes is assigned to bit string (10), any place where the bit changes from (1) to (0) is a delimiter candidate. However, when "10" appears in the DO-VLEI code, the corresponding C-DO-VLEI will be (110).…”

Section: Do-1mentioning

confidence: 99%

“…Note that the shortest bit string (0) is assigned to the "0" that can be manually adjusted to appear more frequently than the other two components, and that the set of bit strings: (0), (10), and (11) are prefix codes. A prefix code is a set of words such that no word of the set is a prefix of another word in the set.…”

Section: Definition 3 (C-do-vlei Code) the Three Elements Of A Do-vlmentioning

confidence: 99%

“…One traditional labeling method is the preorder-postorder method [10], which assigns preorder and postorder numbers to all nodes. Another traditional method is the DO method [20], which uses a delimiter "."…”

Section: Related Workmentioning

confidence: 99%

“…Structural information, such as containment relationship, order of sibling and depth of nodes in the XML tree, is possible to be obtained from the regularity of the labels. A number of XML labeling methods based on numbering schemes such as the preorder-postorder [10] and Dewey Order (DO) [20] have been proposed. The preorder-postorder method assigns preorder and postorder numbers to all nodes to maintain the containment and order information between nodes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

Liang

Takahashi

Yokota

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Recently, labeling methods to extract and reconstruct the structural information of XML data, which are important for many applications such as XPath query and keyword search, are becoming more attractive. To achieve efficient structural information extraction, in this paper we propose C-DO-VLEI code, a novel update-friendly bit-vector encoding scheme, based on register-length bit operations combining with the properties of Dewey Order numbers, which cannot be implemented in other relevant existing schemes such as ORDPATH. Meanwhile, the proposed method also achieves lower storage consumption because it does not require either prefix schema or any reserved codes for node insertion. We performed experiments to evaluate and compare the performance and storage consumption of the proposed method with those of the ORDPATH method. Experimental results show that the execution times for extracting depth information and parent node labels using the C-DO-VLEI code are about 25% and 15% less, respectively, and the average label size using the C-DO-VLEI code is about 24% smaller, comparing with ORDPATH.

show abstract

Untitled

Kobele

2002

Grammars

View full text Add to dashboard Cite

Parsing as tree traversal

Cited by 5 publications

References 7 publications

Ellipsis: computation of

Ellipsis: computation of

A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

Untitled

Contact Info

Product

Resources

About