The exploration step of the A* search is to expand the translation hypothesis of a substring by combining with neighboring translation hypotheses.
this system makes use of the A* heuristic, and our speed/performance curve shows that the heuristic allows us to achieve higher BLEU scores with the same amount of computation.