<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="nelimarkka-etal-1984-two">
    <titleInfo>
        <title>Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Esa</namePart>
        <namePart type="family">Nelimarkka</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Harri</namePart>
        <namePart type="family">Jappinen</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Aarno</namePart>
        <namePart type="family">Lehtola</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1984-07</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Stanford, California, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <identifier type="citekey">nelimarkka-etal-1984-two</identifier>
    <identifier type="doi">10.3115/980491.980571</identifier>
    <location>
        <url>https://aclanthology.org/P84-1080/</url>
    </location>
    <part>
        <date>1984-07</date>
        <extent unit="page">
            <start>389</start>
            <end>392</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages
%A Nelimarkka, Esa
%A Jappinen, Harri
%A Lehtola, Aarno
%S 10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics
%D 1984
%8 July
%I Association for Computational Linguistics
%C Stanford, California, USA
%F nelimarkka-etal-1984-two
%R 10.3115/980491.980571
%U https://aclanthology.org/P84-1080/
%U https://doi.org/10.3115/980491.980571
%P 389-392

Markdown (Informal)

[Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages](https://aclanthology.org/P84-1080/) (Nelimarkka et al., COLING-ACL 1984)

• Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages (Nelimarkka et al., COLING-ACL 1984)

ACL

• Esa Nelimarkka, Harri Jappinen, and Aarno Lehtola. 1984. Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages. In 10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics, pages 389–392, Stanford, California, USA. Association for Computational Linguistics.