{"push_id":545387277,"size":1,"distinct_size":1,"ref":"refs/heads/ner","head":"22ba6b07511557594665ec1d1a0964216cd2acab","before":"66b5d5b4d2340c4a98df5994e000e7bcfc7c7059","commits":[{"sha":"22ba6b07511557594665ec1d1a0964216cd2acab","author":{"email":"9b466094ec991a03cb95c489c19c4d75635f0ae5@cs.jhu.edu","name":"Matt Post"},"message":"Fixed alignment computation\n\nAlignments are now stored as strings for unpacked grammars, and transformed into byte[] arrays only on demand. This commit includes a new rule type for Moses phrase table rules, so that the alignment offset of 1 (necessary because of the prepended nonterminal) can be computed on the fly without too much mess.","distinct":true,"url":"https://api.github.com/repos/joshua-decoder/joshua/commits/22ba6b07511557594665ec1d1a0964216cd2acab"}]}