<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="vilares-etal-2000-editing">
    <titleInfo>
        <title>The Editing Distance in Shared Forest</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Manuel</namePart>
        <namePart type="family">Vilares</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">David</namePart>
        <namePart type="family">Cabrero</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Francisco</namePart>
        <namePart type="given">J</namePart>
        <namePart type="family">Ribadas</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>In an information system indexing can be accomplished by creating a citation based on context-free parses, and matching becomes a natural mechanism to extract patterns. However, the language intended to represent the document can often only be approximately defined, and indices can become shared forests. Queries could also vary from indices and an approximate matching strategy becomes also necessary. We present a proposal intended to prove the applicability of tabulation techniques in this context.</abstract>
    <identifier type="citekey">vilares-etal-2000-editing</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.44</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>323</start>
            <end>324</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T The Editing Distance in Shared Forest
%A Vilares, Manuel
%A Cabrero, David
%A Ribadas, Francisco J.
%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 vilares-etal-2000-editing
%X In an information system indexing can be accomplished by creating a citation based on context-free parses, and matching becomes a natural mechanism to extract patterns. However, the language intended to represent the document can often only be approximately defined, and indices can become shared forests. Queries could also vary from indices and an approximate matching strategy becomes also necessary. We present a proposal intended to prove the applicability of tabulation techniques in this context.
%U https://aclanthology.org/2000.iwpt-1.44
%P 323-324

Markdown (Informal)

[The Editing Distance in Shared Forest](https://aclanthology.org/2000.iwpt-1.44) (Vilares et al., IWPT 2000)

• The Editing Distance in Shared Forest (Vilares et al., IWPT 2000)

ACL

• Manuel Vilares, David Cabrero, and Francisco J. Ribadas. 2000. The Editing Distance in Shared Forest. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 323–324, Trento, Italy. Association for Computational Linguistics.