{"push_id":989786692,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c8f1d71e55b3f672bab91270faa5e70d90dafe95","before":"8dd6f17f097071069a78f6453b70915e3febdbb4","commits":[{"sha":"c8f1d71e55b3f672bab91270faa5e70d90dafe95","author":{"email":"2ff9df59a3a4c491a53906b71740b33caf7e8998@gmail.com","name":"Dr. Ivan S. Zapreev"},"message":"Done:\n  A. Preparing for the arbitrary length LM query.\nStill need to:\n  2. Compute future costs when preparing the sentence for translation\n    2.1. Extend the LM query to go beyond the 5-gram and have a sliding window\n    2.1. Make the TM to count the number of target words and to store them in \n         a data structure easy for combining with history and querying the LM","distinct":true,"url":"https://api.github.com/repos/ivan-zapreev/Basic-Phrase-Based-Decoding/commits/c8f1d71e55b3f672bab91270faa5e70d90dafe95"}]}