Sciweavers

1425 search results - page 41 / 285
» Beyond Dependency Graphs
Sort
View
EMNLP
2008
14 years 11 months ago
Triplet Lexicon Models for Statistical Machine Translation
This paper describes a lexical trigger model for statistical machine translation. We present various methods using triplets incorporating long-distance dependencies that can go be...
Sasa Hasan, Juri Ganitkevitch, Hermann Ney, Jes&ua...
ACL
2006
14 years 11 months ago
Minimum Cut Model for Spoken Lecture Segmentation
We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizes the normalized cut criterion. Our approach moves b...
Igor Malioutov, Regina Barzilay
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
15 years 3 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
ACL
2003
14 years 11 months ago
Unsupervised Learning of Dependency Structure for Language Modeling
This paper presents a dependency language model (DLM) that captures linguistic constraints via a dependency structure, i.e., a set of probabilistic dependencies that express the r...
Jianfeng Gao, Hisami Suzuki
IJICT
2007
143views more  IJICT 2007»
14 years 9 months ago
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar