Sciweavers

15421 search results - page 37 / 3085
» Dependability
Sort
View
173
Voted
INLG
2010
Springer
15 years 1 months ago
Complex Lexico-syntactic Reformulation of Sentences Using Typed Dependency Representations
We present a framework for reformulating sentences by applying transfer rules on a typed dependency representation. We specify a list of operations that the framework needs to sup...
Advaith Siddharthan
109
Voted
ACL
2009
15 years 1 months ago
Cross-Domain Dependency Parsing Using a Deep Linguistic Grammar
Pure statistical parsing systems achieves high in-domain accuracy but performs poorly out-domain. In this paper, we propose two different approaches to produce syntactic dependenc...
Yi Zhang, Rui Wang
124
Voted
ACL
2009
15 years 1 months ago
Improving data-driven dependency parsing using large-scale LFG grammars
This paper presents experiments which combine a grammar-driven and a datadriven parser. We show how the conversion of LFG output to dependency representation allows for a techniqu...
Lilja Øvrelid, Jonas Kuhn, Kathrin Spreyer
EMNLP
2009
15 years 1 months ago
Statistical Bistratal Dependency Parsing
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
Richard Johansson
130
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 10 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi