• No results found

dual-decomposition

Dual Decomposition with Many Overlapping Components

Dual Decomposition with Many Overlapping Components

... DD-ADMM has been proposed and theoretically analyzed by Martins et al. (2011) for problems rep- resentable as factor graphs. The general ADMM method has a long-standing history in optimization (Hestenes, 1969; Powell, ...

12

A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing

A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing

... The same experiment shows that the supertag- ger prunes many bad parses. So, while we want to avoid the error propagation inherent to a pipeline, ideally we still want to benefit from the key insight of supertagging: ...

11

2 Slave Dual Decomposition for Generalized Higher Order CRFs

2 Slave Dual Decomposition for Generalized Higher Order CRFs

... on dual decomposition (DD), which has attracted much attention recently due to its simplicity and effectiveness (Rush and Collins, ...good decomposition, ...lightweight decomposition is not at ...

12

Syntactic Parsing and Compound Recognition via Dual Decomposition: Application to French

Syntactic Parsing and Compound Recognition via Dual Decomposition: Application to French

... In Section 3.2 we described several annotation schemes that lead to different CRF models. These schemes give the same lexical segmentation information but they use more or less rich part-of-speech tag sets. It is not ...

11

Robust Biomedical Event Extraction with Dual Decomposition and Minimal Domain Adaptation

Robust Biomedical Event Extraction with Dual Decomposition and Minimal Domain Adaptation

... This paper presents the UMass entry to the BioNLP 2011 shared task (Kim et al., 2011a). We introduce a simple joint model for the extraction of biomedical events, and show competitive results for four tracks of the ...

5

A Dual Decomposition Approach to Partial Crosstalk Cancelation in a Multiuser DMT-xDSL Environment

A Dual Decomposition Approach to Partial Crosstalk Cancelation in a Multiuser DMT-xDSL Environment

... The extension to the multiuser case can be made by divid- ing the cancellation tap budget over the users in advance. By varying the cancellation tap budget allocated to each user, various tradeo ff s can be made in the ...

11

Joint Word Alignment and Bilingual Named Entity Recognition Using Dual Decomposition

Joint Word Alignment and Bilingual Named Entity Recognition Using Dual Decomposition

... the dual decomposition method for joint in- ference problems, all of the past work deals with cases where the various model components have the same inference output space ...novel dual decom- ...

10

Fast and Robust Compressive Summarization with Dual Decomposition and Multi Task Learning

Fast and Robust Compressive Summarization with Dual Decomposition and Multi Task Learning

... We present a dual decomposition frame- work for multi-document summarization, using a model that jointly extracts and compresses sentences. Compared with previous work based on integer linear pro- gramming, ...

11

AD3: Alternating Directions Dual Decomposition for MAP Inference in Graphical Models

AD3: Alternating Directions Dual Decomposition for MAP Inference in Graphical Models

... and dual decomposition algorithms have been proposed to address the resulting LP problems, taking advantage of the underlying graph structure (Wainwright et ...subgradient dual decomposition ...

51

On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing

On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing

... This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracle solvers for sub-problems, ...

11

Combining PCFG LA Models with Dual Decomposition: A Case Study with Function Labels and Binarization

Combining PCFG LA Models with Dual Decomposition: A Case Study with Function Labels and Binarization

... It has recently been shown that different NLP models can be effectively combined using dual decomposition. In this paper we demon- strate that PCFG-LA parsing models are suit- able for combination in this ...

12

Two Knives Cut Better Than One: Chinese Word Segmentation with Dual Decomposition

Two Knives Cut Better Than One: Chinese Word Segmentation with Dual Decomposition

... In this work, we propose a simple and prin- cipled joint decoding method for combining character-based and word-based segmenters based on dual decomposition. This method has strong optimality guarantees and ...

6

Coordination Structure Analysis using Dual Decomposition

Coordination Structure Analysis using Dual Decomposition

... Table 2 and Table 3 show the non-terminals and production rules used in the model. The only ob- jective of the grammar is to ensure the consistency of two or more coordinations in a sentence, which means for any two ...

9

Dual Decomposition Inference for Graphical Models over Strings

Dual Decomposition Inference for Graphical Models over Strings

... We investigate dual decomposition for joint MAP inference of many strings. Given an arbitrary graphical model, we de- compose it into small acyclic sub-models, whose MAP configurations can be found by ...

11

Implicitly Intersecting Weighted Automata using Dual Decomposition

Implicitly Intersecting Weighted Automata using Dual Decomposition

... In this paper, we propose a more efficient method for finding the best path in an intersection without actually computing the full intersection. Our ap- proach is based on dual decomposition, a combina- ...

11

Dual Decomposition for Parsing with Non Projective Head Automata

Dual Decomposition for Parsing with Non Projective Head Automata

... described dual decomposition algorithms for non-projective parsing, which leverage existing dynamic programming and MST ...develop dual decomposition algorithms for this case, using similar ...

11

Model Based Aligner Combination Using Dual Decomposition

Model Based Aligner Combination Using Dual Decomposition

... Unsupervised word alignment is most often modeled as a Markov process that generates a sentence f conditioned on its translation e. A similar model generating e from f will make different alignment predictions. ...

10

Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition

Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition

... Unsupervised dependency parsing aims to learn a dependency parser from unanno- tated sentences. Existing work focus- es on either learning generative model- s using the expectation-maximization al- gorithm and its ...

6

Dual Decomposition for Natural Language Processing

Dual Decomposition for Natural Language Processing

... Decoding tasks many common problems are intractable to decode exactly high complexity • combined parsing and part-of-speech tagging Rush et al., 2010 • “loopy” HMM part-of-speech tagging[r] ...

43

Bidirectional Transition-Based Dependency Parsing

Bidirectional Transition-Based Dependency Parsing

... In this paper, we propose a framework for bidirectional tran- sition based dependency parsing. During training, we learn two unidirectional parsers separately. During parsing, we perform joint decoding using the two ...

8

Show all 10000 documents...

Related subjects