Papers for Relevance Assessment by Jun'ichi Kazama

Research Question: Is it possible to efficiently convert trees into vectors whose dimensions are the subtrees that appear in only the tree pairs that do not have extremely large number of subtrees in common?

Paper ID
(Link to PDF)

Title

Author(s)

E03-1005

An efficient implementation of a new DOP model

Rens Bod

H91-1045

Calculating the Probability of a Partial Parse of a Sentence

Fred Kochman; Joseph Kupin

W96-0111

Two Questions about Data-Oriented Parsing

Rens Bod

E93-1047

Type-Driven Semantic Interpretation of f-Structures

Jurgen Wedekind; Ronald M. Kaplan

C00-2161

Querying Temporal Databases Using Controlled Natural Language

Rani Nelken; Nissim Francez

244_pdf_2-col

Dependency Tree Kernels for Relation Extraction

Aron Culotta and Jeffrey Sorensen

C00-1011

Parsing with the Shortest Derivation

Rens Bod

C00-2092

Data-Oriented Translation

Arjen Poutsma

P01-1010

What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?

Rens Bod

W02-1010

Kernel Methods for Relation Extraction

Dmitry Zelenko; Chinatsu Aone; Anthony Richardella

P02-1034

New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron

Michael Collins; Nigel Duffy

P03-1005

Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data

Jun Suzuki; Tsutomu Hirao; Yutaka Sasaki; Eisaku Maeda

W93-0212

"Act promptly, make your god happy": Representation and Rhetorical Relations in Natural Language Generation

Margaret Hundleby

E93-1006

Using an Annotated Corpus as a Stochastic Grammar

Rens Bod

E85-1039

TOWARDS AN AUTOMATIC IDENTIPEATION OF TOPIC AND FOCUS

Eva Hajicova; Petr Sgall