<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="bechet-2003-incremental">
    <titleInfo>
        <title>Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Denis</namePart>
        <namePart type="family">Béchet</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>The paper describes an incremental parsing algorithm for natural languages that uses normalized interfaces of modules of proof-nets. This algorithm produces at each step the different possible partial syntactical analyses of the first words of a sentence. Thus, it can analyze texts on the fly leaving partially analyzed sentences.</abstract>
    <identifier type="citekey">bechet-2003-incremental</identifier>
    <location>
        <url>https://aclanthology.org/W03-3003</url>
    </location>
    <part>
        <date>2003-04</date>
        <extent unit="page">
            <start>31</start>
            <end>42</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces
%A Béchet, Denis
%S Proceedings of the Eighth International Conference on Parsing Technologies
%D 2003
%8 April
%C Nancy, France
%F bechet-2003-incremental
%X The paper describes an incremental parsing algorithm for natural languages that uses normalized interfaces of modules of proof-nets. This algorithm produces at each step the different possible partial syntactical analyses of the first words of a sentence. Thus, it can analyze texts on the fly leaving partially analyzed sentences.
%U https://aclanthology.org/W03-3003
%P 31-42

Markdown (Informal)

[Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces](https://aclanthology.org/W03-3003) (Béchet, IWPT 2003)

• Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces (Béchet, IWPT 2003)

ACL

• Denis Béchet. 2003. Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces. In Proceedings of the Eighth International Conference on Parsing Technologies, pages 31–42, Nancy, France.