<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="nederhof-satta-2003-probabilistic">
    <titleInfo>
        <title>Probabilistic Parsing as Intersection</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Mark-Jan</namePart>
        <namePart type="family">Nederhof</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Giorgio</namePart>
        <namePart type="family">Satta</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2003-04</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Eighth International Conference on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">Nancy, France</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We show that a well-known algorithm to compute the intersection of a context-fre language and a regular language can be extended to apply to a probabilistic context-free grammar and a probabilistic finite automaton, provided the two probabilistic models are combined through multiplication. The result is a probabilistic context-free grammar that contains joint information about the original grammar and automaton.</abstract>
    <identifier type="citekey">nederhof-satta-2003-probabilistic</identifier>
    <location>
        <url>https://aclanthology.org/W03-3016</url>
    </location>
    <part>
        <date>2003-04</date>
        <extent unit="page">
            <start>137</start>
            <end>148</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Probabilistic Parsing as Intersection
%A Nederhof, Mark-Jan
%A Satta, Giorgio
%S Proceedings of the Eighth International Conference on Parsing Technologies
%D 2003
%8 April
%C Nancy, France
%F nederhof-satta-2003-probabilistic
%X We show that a well-known algorithm to compute the intersection of a context-fre language and a regular language can be extended to apply to a probabilistic context-free grammar and a probabilistic finite automaton, provided the two probabilistic models are combined through multiplication. The result is a probabilistic context-free grammar that contains joint information about the original grammar and automaton.
%U https://aclanthology.org/W03-3016
%P 137-148

Markdown (Informal)

[Probabilistic Parsing as Intersection](https://aclanthology.org/W03-3016) (Nederhof & Satta, IWPT 2003)

• Probabilistic Parsing as Intersection (Nederhof & Satta, IWPT 2003)

ACL

• Mark-Jan Nederhof and Giorgio Satta. 2003. Probabilistic Parsing as Intersection. In Proceedings of the Eighth International Conference on Parsing Technologies, pages 137–148, Nancy, France.