<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="harbusch-1990-efficient">
    <titleInfo>
        <title>An Efficient Parsing Algorithm for Tree Adjoining Grammars</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Karin</namePart>
        <namePart type="family">Harbusch</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1990-jun</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>28th Annual Meeting of the Association for Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Pittsburgh, Pennsylvania, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <identifier type="citekey">harbusch-1990-efficient</identifier>
    <identifier type="doi">10.3115/981823.981859</identifier>
    <location>
        <url>https://aclanthology.org/P90-1036</url>
    </location>
    <part>
        <date>1990-jun</date>
        <extent unit="page">
            <start>284</start>
            <end>291</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T An Efficient Parsing Algorithm for Tree Adjoining Grammars
%A Harbusch, Karin
%S 28th Annual Meeting of the Association for Computational Linguistics
%D 1990
%8 jun
%I Association for Computational Linguistics
%C Pittsburgh, Pennsylvania, USA
%F harbusch-1990-efficient
%R 10.3115/981823.981859
%U https://aclanthology.org/P90-1036
%U https://doi.org/10.3115/981823.981859
%P 284-291

Markdown (Informal)

[An Efficient Parsing Algorithm for Tree Adjoining Grammars](https://aclanthology.org/P90-1036) (Harbusch, ACL 1990)

• An Efficient Parsing Algorithm for Tree Adjoining Grammars (Harbusch, ACL 1990)

ACL

• Karin Harbusch. 1990. An Efficient Parsing Algorithm for Tree Adjoining Grammars. In 28th Annual Meeting of the Association for Computational Linguistics, pages 284–291, Pittsburgh, Pennsylvania, USA. Association for Computational Linguistics.