أرسل هذا في رسالة قصيرة: A probabilistic forest-to-string model for language generation from typed lambda calculus expressions

  ______   _    _     _____    __   __     _____  
 /_   _// | || | ||  /  ___||  \ \\/ //   / ___// 
 `-| |,-  | || | || | // __     \ ` //    \___ \\ 
   | ||   | \\_/ || | \\_\ ||    | ||     /    // 
   |_||    \____//   \____//     |_||    /____//  
   `-`'     `---`     `---`      `-`'   `-----`