We present a tree diierence algorithm with expected sequential execution time O(n log log n) and expected parallel execution time of O(log n), for trees of size n. The algorithm assumes unique labels and permits operations only on leaves and frontier subtrees. Despite these limitations, it can be useful in the analysis of structured text.

We propose two Japanese-language information retrieval methods that enhance retrieval effectiveness by using relationships between words. The first method uses dependency relationships between words in a sentence, while the second method uses proximity relationships, in particular the ordered co-occurrence information of words in a sentence as an approximation to the dependency relationships be...

We present a novel, yet simple, technique for the speciication of context in struc-tured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciication for structured documents, as we shall demonstrate, and for the speciication of ...

Latent structured prediction theory proposes powerful methods such as Latent Structural SVM (LSSVM), which can potentially be very appealing for coreference resolution (CR). In contrast, only small work is available, mainly targeting the latent structured perceptron (LSP). In this paper, we carried out a practical study comparing for the first time online learning with LSSVM. We analyze the int...

Structural join has been established as a primitive technique for matching the binary containment pattern, specifically the parent–child and ancestor–descendant relationship, on the tree XML data. While current indexing approaches and evaluation algorithms proposed for the structural join operation assume the tree-structured data model, the presence of reference links in XML documents may rende...

Tractatus Logico-Philosophicus by Ludwig Wittgenstein: Three parallel tree-structured editions. (1) Tree-structured arrangement of the German text, edited David G. Stern, Joachim Schulte and Katia Saporiti. (2) English translation Ogden Ramsey, Stern. (3) Pears McGuinness,

In this paper we describe a unified document model for an authoring system that takes advantage of both hypertext and structured document models: hypertext, which represents a document as a network of information fragments freely referencing one another, helps users create ideas; and structured document models, which represent a document as a rigid tree structure of document components, help us...

A decision tree is an effective means of data classification from which one can obtain rules that are easy to understand. However, decision trees cannot be conventionally constructed for data which are not explicitly expressed with attribute-value pairs such as graph-structured data. We have proposed a novel algorithm, named Chunkingless Graph-Based Induction (Cl-GBI), for extracting typical pa...

We consider the problem of classifying an unknown observation into one of several populations using tree-structured allocation rules. Although many parametric classification procedures are robust to certain assumption violations, there is need for discriminant procedures that can be utilized regardless of the group-conditional distributions that underlie the model. The treestructured allocation...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy STRUCTURED GRAPHICAL MODELS FOR UNSUPERVISED IMAGE SEGMENTATION By Kittipat Kampa Dec 2011 Chair: Jose C. Principe Major: Electrical and Computer Engineering In the dissertation, we seek the following goals: (1) to come up with a probabi...