If you made any changes in Pure these will be visible here soon.

Personal profile

Research Interests

My broad interests are in the intersection of computational linguistics and machine learning. I am interested in developing ways for reasoning about compositional structures such as parse trees through the use of formalisms such as probabilistic grammars.

Much of my research has relied on capturing the syntax of natural language using probabilistic grammars -- grammars which originate in linguistics and formal language theory, and which have been augmented with a probabilistic interpretation. I have worked with various grammars, such as probabilistic context-free grammars (PCFGs), latent-variable PCFGs, dependency grammars, adaptor grammars, tree substitution grammars, shift-reduce grammars and others.


BSc Mathematics and Computer Science, 2000, Tel Aviv University, School of
Exact Sciences
MSc Computer Science, 2004, Tel Aviv University, School of Exact Sciences
PhD Language and Information Technologies, 2011, Carnegie Mellon
University, School of Computer Science


Shay Cohen is a Chancellor's fellow (assistant professor) at the University of Edinburgh (School of Informatics). Before that, he was a postdoctoral research scientist in the Department of Computer Science at Columbia University, and held an NFS/CRA Computing Innovation Fellowship. He received his B.Sc. and M.Sc. from Tel Aviv University in 2000 and 2004, and his Ph.D. from Carnegie Mellon University in 2011. His research interests span a range of topics in natural language processing and machine learning, with a focus on structured prediction. He is especially interested in developing efficient and scalable parsing algorithms as well as learning algorithms for probabilistic grammars.


Dive into the research topics where Shay Cohen is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles


Recent external collaboration on country/territory level. Dive into details by clicking on the dots or