We recast dependency parsing as a sequence labeling problem, exploring
several encodings of dependency trees as labels. While dependency parsing by
means of sequence labeling had been attempted in existing work, results
suggested that the technique was impractical. We show instead that with a
conventional BiLSTM-based model it is possible to obtain fast and accurate
parsers. These parsers are conceptually simple, not needing traditional parsing
algorithms or auxiliary structures. However, experiments on the PTB and a
sample of UD treebanks show that they provide a good speed-accuracy tradeoff,
with results competitive with more complex approaches.

本文研究使用基于 BiLSTM 的序列标注方法重构了依存句法分析，并通过在 PTB 和 UD 树库样本上的实验，证明该方法在速度和准确性之间提供了很好的平衡，结果与更复杂的方法相当竞争力。

可行的依存句法分析作为序列标注

Viable Dependency Parsing as Sequence Labeling

We show that a simple modification of the 1-nearest neighbor classifier
yields a strongly Bayes consistent learner. Prior to this work, the only
strongly Bayes consistent proximity-based method was the k-nearest neighbor
classifier, for k growing appropriately with sample size. We will argue that a
margin-regularized 1-NN enjoys considerable statistical and algorithmic
advantages over the k-NN classifier. These include user-friendly finite-sample
error bounds, as well as time- and memory-efficient learning and test-point
evaluation algorithms with a principled speed-accuracy tradeoff. Encouraging
empirical results are reported.

通过简单修改最近邻分类器，我们展示了一个强 Bayes 一致的学习器，优于 k-NN 分类器，并在限制样本大小和算法时间方面具有较大的优势，获得了令人鼓舞的实验结果。

一个贝叶斯一致的 1-NN 分类器

A Bayes consistent 1-NN classifier

We study collective decision-making in a model of human groups, with network
interactions, performing two alternative choice tasks. We focus on the
speed-accuracy tradeoff, i.e., the tradeoff between a quick decision and a
reliable decision, for individuals in the network. We model the evidence
aggregation process across the network using a coupled drift diffusion model
(DDM) and consider the free response paradigm in which individuals take their
time to make the decision. We develop reduced DDMs as decoupled approximations
to the coupled DDM and characterize their efficiency. We determine high
probability bounds on the error rate and the expected decision time for the
reduced DDM. We show the effect of the decision-maker's location in the network
on their decision-making performance under several threshold selection
criteria. Finally, we extend the coupled DDM to the coupled Ornstein-Uhlenbeck
model for decision-making in two alternative choice tasks with recency effects,
and to the coupled race model for decision-making in multiple alternative
choice tasks.

研究了人类群体在网络相互作用中的集体决策过程及速度 - 准确度之间的权衡，使用联合漂移扩散模型对网络中的证据聚合过程进行建模，并开发了降维 DDM 以评估决策效率；同时考虑决策者在网络中的位置对其决策表现的影响，最后分别扩展到 Ornstein-Uhlenbeck 模型和竞赛模型以实现多选项任务的决策过程建模。