Index of papers in Proc. ACL 2010 that mention
  • beam search
Seen in text as:
  • beam search (9)
Seen in 9 sentences in 2 papers.
1. Efficient Staggered Decoding for Sequence Labeling
Kaji, Nobuhiro and Fujiwara, Yasuhiro and Yoshinaga, Naoki and Kitsuregawa, Masaru
In Proc. ACL 2010.
Introduction
Approximate algorithms, such as beam search or island-driven search, have been proposed for speeding up decoding.
Introduction
In our experiments, we use the path located by the left-to-right deterministic decoding (i.e., beam search with a beam width of 1).
Introduction
with beam search , which is the approximate algorithm widely adopted for sequence labeling in NLP.
beam search is mentioned in 5 sentences in this paper.
Topics mentioned in this paper:
2. Optimizing Informativeness and Readability for Sentiment Summarization
Nishikawa, Hitoshi and Hasegawa, Takaaki and Matsuo, Yoshihiro and Kikui, Genichiro
In Proc. ACL 2010.
Conclusion
The preferred sequence is determined by using dynamic programming and beam search .
Introduction
Our algorithm efficiently searches for the best sequence of sentences by using dynamic programming and beam search .
Optimizing Sentence Sequence
To alleviate this, we find an approximate solution by adopting the dynamic programming technique of the Held and Karp Algorithm (Held and Karp, 1962) and beam search .
Optimizing Sentence Sequence
Therefore, we adopt the Held and Karp Algorithm and beam search to find approximate solutions.
beam search is mentioned in 4 sentences in this paper.
Topics mentioned in this paper:
Send us an email