Грамматики подстановки деревьев

Tree substitution grammars (TSGs) are a com- pelling alternative to context-free grammars for modelling syntax. However, many popu- lar techniques for estimating weighted TSGs (under the moniker of Data Oriented …...

Most existing algorithms for learning latent- variable models—such as EM and existing Gibbs samplers—are token-based, meaning that they update the variables associated with one sentence at a time. The incremental …...

Multiword expressions (MWE), a known nui- sance for both linguistics and NLP, blur the lines between syntax and semantics. Previous work on MWE identification has relied primar- ily on surface …...

We propose a new variant of Tree- Adjoining Grammar that allows adjunc- tion of full wrapping trees but still bears only context-free expressivity. We provide a transformation to context-free form, …...