AMR-to-text generation as a Traveling Salesman Problem
The task of AMR-to-text generation is to generate grammatical text that sustains the semantic meaning for a given AMR graph. We at- tack the task by first partitioning the AMR graph into smaller fragments, and then generating the translation for each fragment, before finally deciding the order by solving an asymmetric generalized traveling salesman problem (AGTSP). A Maximum Entropy classifier is trained to estimate the traveling costs, and a TSP solver is used to find the optimized solution. The final model reports a BLEU score of 22.44 on the SemEval-2016 Task8 dataset.
Code (0)
등록된 구현이 없습니다.
Tasks
AMR-to-Text GenerationText GenerationTranslationTraveling Salesman ProblemSimilar Papers 제목 키워드 기반
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimization. Given the list of cities and distances between them, the problem is to find the shortest tour possible which visi…
Combinatorial OptimizationTraveling Salesman ProblemSolving Traveling Salesman Problem by Marker Method
In this paper we use marker method and propose a new mutation operator that selects the nearest neighbor among all near neighbors solving Traveling Salesman Problem.
Traveling Salesman ProblemA Discrete State Transition Algorithm for Generalized Traveling Salesman Problem
Generalized traveling salesman problem (GTSP) is an extension of classical traveling salesman problem (TSP), which is a combinatorial optimization problem and an NP-hard problem. In this paper, an efficient discrete stat…
Combinatorial OptimizationTraveling Salesman ProblemEfficient Bit Labeling in Factorization Machines with Annealing for Traveling Salesman Problem
To efficiently find an optimum parameter combination in a large-scale problem, it is a key to convert the parameters into available variables in actual machines. Specifically, quadratic unconstrained binary optimization …
Traveling Salesman ProblemSolving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning
A traveling salesman problem (TSP) is a well-known NP-complete problem. Traditional TSP presumes that the locations of customers and the traveling time among customers are fixed and constant. In real-life cases, however,…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningTraveling Salesman Problem