按年被提到
20142015 · 1 次2026
大模型与语言模型›序列模型与注意力机制·arXiv:1412.7449 · cs.CL

Grammar as a Foreign Language

Oriol Vinyals, Lukasz Kaiser, Terry Koo, Slav Petrov, Ilya Sutskever, Geoffrey Hinton · 2014
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2015-09-19 · 最近 2016-01-13
2不同的人
2活跃月份
2讨论串
464被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Syntactic constituency parsing is a fundamental problem in natural language processing and has been the subject of intensive research and engineering for decades. As a result, the most accurate parsers are domain specific, complex, and inefficient. In this paper we show that the domain agnostic attention-enhanced sequence-to-sequence model achieves state-of-the-art results on the most widely used syntactic constituency parsing dataset, when trained on a large synthetic corpus that was annotated using existing parsers. It also matches the performance of standard parsers when trained only on a small human-annotated dataset, which shows that this model is highly data-efficient, in contrast to sequence-to-sequence models without the attention mechanism. Our parser is also fast, processing over a hundred sentences per second with an unoptimized CPU implementation.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论nl · 2016-01

“Not the author, but I'm guessing it uses an implementation of "Grammar as a Foreign Language"[1]. TensorFlow has a tutorial that gets you most of the way[2]. Edit: playing a bit I don't think it is doing this. I think it's using Word2Vec style vectors to build similar sentences, and calculating the probability of each and maybe the edit-cost to change. …”

Show HN: Grammar checker using deep learning原评论 ↗
被提交为 story · 1 次