<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="samuelsson-1995-novel">
    <titleInfo>
        <title>A Novel Framework for Reductionistic Statistical Parsing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Christer</namePart>
        <namePart type="family">Samuelsson</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1995-sep&quot; 20-24&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Fourth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Prague and Karlovy Vary, Czech Republic</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>A reductionistic statistical framework for part-of-speech tagging and surface syntactic parsing is presented that has the same expressive power as the highly successful Constraint Grammar approach, see [Karlsson et al. 1995]. The structure of the Constraint Grammar rules allows them to be viewed as conditional probabilities that can be used to update the lexical tag probabilities, after which low-probability tags are repeatedly removed. Experiments using strictly conventional information sources on the Susanne and Teleman corpora indicate that the system performs as well as a traditional HMM-based part-of-speech tagger, yielding state-of-the-art results. The scheme also enables using the same information sources as the Constraint Grammar approach, and the hope is that it can improve on the performance of both statistical taggers and surface-syntactic analyzers.</abstract>
    <identifier type="citekey">samuelsson-1995-novel</identifier>
    <location>
        <url>https://aclanthology.org/1995.iwpt-1.25</url>
    </location>
    <part>
        <date>1995-sep&quot; 20-24&quot;</date>
        <extent unit="page">
            <start>208</start>
            <end>215</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Novel Framework for Reductionistic Statistical Parsing
%A Samuelsson, Christer
%S Proceedings of the Fourth International Workshop on Parsing Technologies
%D 1995
%8 sep" 20 24"
%I Association for Computational Linguistics
%C Prague and Karlovy Vary, Czech Republic
%F samuelsson-1995-novel
%X A reductionistic statistical framework for part-of-speech tagging and surface syntactic parsing is presented that has the same expressive power as the highly successful Constraint Grammar approach, see [Karlsson et al. 1995]. The structure of the Constraint Grammar rules allows them to be viewed as conditional probabilities that can be used to update the lexical tag probabilities, after which low-probability tags are repeatedly removed. Experiments using strictly conventional information sources on the Susanne and Teleman corpora indicate that the system performs as well as a traditional HMM-based part-of-speech tagger, yielding state-of-the-art results. The scheme also enables using the same information sources as the Constraint Grammar approach, and the hope is that it can improve on the performance of both statistical taggers and surface-syntactic analyzers.
%U https://aclanthology.org/1995.iwpt-1.25
%P 208-215

Markdown (Informal)

[A Novel Framework for Reductionistic Statistical Parsing](https://aclanthology.org/1995.iwpt-1.25) (Samuelsson, IWPT 1995)

• A Novel Framework for Reductionistic Statistical Parsing (Samuelsson, IWPT 1995)

ACL

• Christer Samuelsson. 1995. A Novel Framework for Reductionistic Statistical Parsing. In Proceedings of the Fourth International Workshop on Parsing Technologies, pages 208–215, Prague and Karlovy Vary, Czech Republic. Association for Computational Linguistics.