<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1603.04351/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1603.04351/feed.xml" rel="self" type="application/rss+xml" /><item><title>Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations — mentioned by Al-Khwarizmi</title><link>https://news.ycombinator.com/item?id=11295555</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.04351:11295555</guid><pubDate>Wed, 16 Mar 2016 07:12:02 GMT</pubDate><description>&lt;p&gt;They definitely aren&amp;#x27;t at 97% but they aren&amp;#x27;t that bad either. For English they are at around 92% (see for example http://arxiv.org/pdf/1603.04351.pdf) in labelled attachment score (right tag+right label). If you are interested only in the syntactic tag, not in the structure of the tree, the number is somewhat higher.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.04351/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
