Несупервизируемые Парсеры

We propose a relaxed correspondence as- sumption for cross-lingual projection of con- stituent syntax, which allows a supposed constituent of the target sentence to corre- spond to an unrestricted treelet …...

AbstractRecently, there has been an increasing interest in unsupervised parsers that optimize semantically oriented objectives, typically using reinforcement learning. Unfortunately, the learned trees often do not match actual syntax trees …...