Papers for Relevance Assessment by Ryan McDonald

Research Question: Are there efficient algorithms for exact non-projective dependency parsing?

Paper ID
(Link to PDF)

Title

Author(s)

P03-2006

Finding Non-local Dependencies: Beyond Pattern Matching

Valentin Jijkoun

P01-1045

From Chunks to Function-Argument Structure: A Similarity-Based Approach

Sandra Kubler; Erhard W. Hinrichs

J03-4001

Dependency Parsing with an Extended Finite-State Approach

Kemal Oflazer

137_pdf_2-col

Enriching the Output of a Parser Using Memory-based Learning

Valentin Jijkoun and Maarten de Rijke

W98-0509

Decision Procedures for Dependency Parsing Using Graded Constraints

Wolfgang Menzel; Ingo Schroder

W97-0307

Tagging Grammatical Functions

Thorsten Brants; Wojciech Skut; Brigitte Krenn

W98-0511

Parsing with Dependency Relations and Robust Parsing

Jacques Courtin; Damien Genthial

C00-2099

A Statistical Theory of Dependency Syntax

Christer Samuelsson

A97-1011

A non-projective dependency parser

Pasi Tapanainen; Timo Jarvinen

P98-2130

Formal Aspects and Parsing Issues of Dependency Theory

Vincenzo Lombardo; Leonaxdo Lesmo

A97-1022

A Prototype of a Grammar Checker for Czech

Tomas, Holan; Vladislav Kubon; Martin Platek

W05-1505

Corrective Modeling for Non-Projective Dependency Parsing

Keith Hall; Vaclav Novak

P98-1106

Pseudo-Projectivity, A Polynomially Parsable Non-Projective Dependency Grammar

Sylvain Kahane; Alexis Nasr; Owen Rambow

nivre

Incrementality in Deterministic Dependency Parsing

Joakim Nivre

N03-3006

A low-complexity, broad-coverage probabilistic Dependency Parser for English

Gerold Schneider