Sciweavers

270 search results - page 31 / 54
» Effective natural language parsing with probabilistic gramma...
Sort
View
JQL
2008
97views more  JQL 2008»
14 years 9 months ago
Dependency-length minimization in natural and artificial languages
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...
David Temperley
SCCC
1998
IEEE
15 years 1 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
COLING
2010
14 years 4 months ago
Acquisition of Unknown Word Paradigms for Large-Scale Grammars
Unknown words are a major issue for large-scale grammars of natural language. We propose a machine learning based algorithm for acquiring lexical entries for all forms in the para...
Kostadin Cholakov, Gertjan van Noord
CICLING
2003
Springer
15 years 2 months ago
Positive Grammar Checking: A Finite State Approach
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
Sylvana Sofkova Hashemi, Robin Cooper, Robert Ande...
EMNLP
2010
14 years 7 months ago
Title Generation with Quasi-Synchronous Grammar
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...
Kristian Woodsend, Yansong Feng, Mirella Lapata