A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding with a Fixed Distortion Limit
Saved in:
| Main Authors: | Yin-Wen Chang, Michael Collins |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2021-03-01
|
| Series: | Transactions of the Association for Computational Linguistics |
| Online Access: | http://dx.doi.org/10.1162/tacl_a_00046 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
by: Ksenia Rizhenko, et al.
Published: (2023-07-01) -
Dynamic Programming Algorithms for Solving Single Machine Scheduling Problems with a Fixed Complexity Time
by: Kawa Al-Qazilchy
Published: (2009-07-01) -
A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem
by: Yi-Chou Chen, et al.
Published: (2013-01-01) -
Fixed Points of the Dickson Polynomials of the Second Kind
by: Adama Diene, et al.
Published: (2013-01-01) -
Fixed point results for contractions of polynomial type
by: Jleli Mohamed, et al.
Published: (2025-03-01)