nltk.IBMModel3.hillclimb¶
-
IBMModel3.
hillclimb
(alignment_info, j_pegged=None)¶ Starting from the alignment in
alignment_info
, look at neighboring alignments iteratively for the best oneThere is no guarantee that the best alignment in the alignment space will be found, because the algorithm might be stuck in a local maximum.
Parameters: j_pegged (int) – If specified, the search will be constrained to alignments where j_pegged
remains unchangedReturns: The best alignment found from hill climbing Return type: AlignmentInfo