<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="henderson-2000-neural">
    <titleInfo>
        <title>A Neural Network Parser that Handles Sparse Data</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">James</namePart>
        <namePart type="family">Henderson</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2000-feb&quot; 23-25&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Sixth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Trento, Italy</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>Previous work has demonstrated the viability of a particular neural network architecture, Simple Synchrony Networks, for syntactic parsing. Here we present additional results on the performance of this type of parser, including direct comparisons on the same dataset with a standard statistical parsing method, Probabilistic Context Free Grammars. We focus these experiments on demonstrating one of the main advantages of the SSN parser over the PCFG, handling sparse data. We use smaller datasets than are typically used with statistical methods, resulting in the PCFG finding parses for under half of the test sentences, while the SSN finds parses for all sentences. Even on the PCFG ‘s parsed half, the SSN performs better than the PCFG, as measure by recall and precision on both constituents and a dependency-like measure.</abstract>
    <identifier type="citekey">henderson-2000-neural</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.14</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>123</start>
            <end>134</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Neural Network Parser that Handles Sparse Data
%A Henderson, James
%S Proceedings of the Sixth International Workshop on Parsing Technologies
%D 2000
%8 feb" 23 25"
%I Association for Computational Linguistics
%C Trento, Italy
%F henderson-2000-neural
%X Previous work has demonstrated the viability of a particular neural network architecture, Simple Synchrony Networks, for syntactic parsing. Here we present additional results on the performance of this type of parser, including direct comparisons on the same dataset with a standard statistical parsing method, Probabilistic Context Free Grammars. We focus these experiments on demonstrating one of the main advantages of the SSN parser over the PCFG, handling sparse data. We use smaller datasets than are typically used with statistical methods, resulting in the PCFG finding parses for under half of the test sentences, while the SSN finds parses for all sentences. Even on the PCFG ‘s parsed half, the SSN performs better than the PCFG, as measure by recall and precision on both constituents and a dependency-like measure.
%U https://aclanthology.org/2000.iwpt-1.14
%P 123-134

Markdown (Informal)

[A Neural Network Parser that Handles Sparse Data](https://aclanthology.org/2000.iwpt-1.14) (Henderson, IWPT 2000)

• A Neural Network Parser that Handles Sparse Data (Henderson, IWPT 2000)

ACL

• James Henderson. 2000. A Neural Network Parser that Handles Sparse Data. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 123–134, Trento, Italy. Association for Computational Linguistics.