Search Descriptions

Main Topics

Search Publications


author

title

other

year

Decoding Complexity

Assessing the computational complexity of the search space informs the theoretical limitations for the efficiency of decoding algorithms.

Decoding Complexity is the main subject of 5 publications.

Publications

Knight (1999) showed that the decoding problem for word-based models is NP-complete. Udupa and Maji (2006) provide further complexity analysis for training and decoding with IBM Models. Lopez (2009) discusses the impact of reordering limits in decoding complexity.

Benchmarks

Discussion

Related Topics

New Publications

  • Fleming et al. (2015)
  • Leusch et al. (2008)

Actions

Download

Contribute