Sciweavers

15 search results - page 1 / 3
» Optimizing Grammars for Minimum Dependency Length
Sort
View
ACL
2007
13 years 5 months ago
Optimizing Grammars for Minimum Dependency Length
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
Daniel Gildea, David Temperley
COGSCI
2010
108views more  COGSCI 2010»
13 years 4 months ago
Do Grammars Minimize Dependency Length?
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
Daniel Gildea, David Temperley
ICIP
1999
IEEE
14 years 5 months ago
Minimum Mean Square Error Fir Filter Banks with Arbitrary Filter Lengths
The performance of subband image coders depends on the proper choice of filter banks. It is therefore desirable to find algorithms for optimizing the filter banks. A theory for fi...
Are Hjørungnes, Helge Coward, Tor A. Ramsta...
JQL
2008
97views more  JQL 2008»
13 years 4 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
NAACL
2010
13 years 2 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea