<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="krieger-1993-typed">
    <titleInfo>
        <title>Typed feature formalisms as a common basis for linguistic specification</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Hans-Ulrich</namePart>
        <namePart type="family">Krieger</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1993-apr 26–28</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Third International EAMT Workshop: Machine Translation and the Lexicon</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Robert</namePart>
            <namePart type="given">E</namePart>
            <namePart type="family">Frederking</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Kathryn</namePart>
            <namePart type="given">B</namePart>
            <namePart type="family">Taylor</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Springer Berlin Heidelberg</publisher>
            <place>
                <placeTerm type="text">Heidelberg, Germany</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
        <identifier type="isbn">3-540-59040-4</identifier>
    </relatedItem>
    <abstract>Typed feature formalisms (TFF) play an increasingly important role in NLP and, in particular, in MT. Many of these systems are inspired by Pollard and Sag’s work on Head-Driven Phrase Structure Grammar (HPSG), which has shown that a great deal of syntax and semantics can be neatly encoded within TFF. However, syntax and semantics are not the only areas in which TFF can be beneficially employed. In this paper, I will show that TFF can also be used as a means to model finite automata (FA) and to perform certain types of logical inferencing. In particular, I will (i) describe how FA can be defined and processed within TFF and (ii) propose a conservative extension to HPSG, which allows for a restricted form of semantic processing within TFF, so that the construction of syntax and semantics can be intertwined with the simplification of the logical form of an utterance. The approach which I propose provides a uniform, HPSG-oriented framework for different levels of linguistic processing, including allomorphy and morphotactics, syntax, semantics, and logical form simplification.</abstract>
    <identifier type="citekey">krieger-1993-typed</identifier>
    <location>
        <url>https://aclanthology.org/1993.eamt-1.7</url>
    </location>
    <part>
        <date>1993-apr 26–28</date>
        <extent unit="page">
            <start>101</start>
            <end>119</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Typed feature formalisms as a common basis for linguistic specification
%A Krieger, Hans-Ulrich
%Y Frederking, Robert E.
%Y Taylor, Kathryn B.
%S Third International EAMT Workshop: Machine Translation and the Lexicon
%D 1993
%8 apr 26–28
%I Springer Berlin Heidelberg
%C Heidelberg, Germany
%@ 3-540-59040-4
%F krieger-1993-typed
%X Typed feature formalisms (TFF) play an increasingly important role in NLP and, in particular, in MT. Many of these systems are inspired by Pollard and Sag’s work on Head-Driven Phrase Structure Grammar (HPSG), which has shown that a great deal of syntax and semantics can be neatly encoded within TFF. However, syntax and semantics are not the only areas in which TFF can be beneficially employed. In this paper, I will show that TFF can also be used as a means to model finite automata (FA) and to perform certain types of logical inferencing. In particular, I will (i) describe how FA can be defined and processed within TFF and (ii) propose a conservative extension to HPSG, which allows for a restricted form of semantic processing within TFF, so that the construction of syntax and semantics can be intertwined with the simplification of the logical form of an utterance. The approach which I propose provides a uniform, HPSG-oriented framework for different levels of linguistic processing, including allomorphy and morphotactics, syntax, semantics, and logical form simplification.
%U https://aclanthology.org/1993.eamt-1.7
%P 101-119

Markdown (Informal)

[Typed feature formalisms as a common basis for linguistic specification](https://aclanthology.org/1993.eamt-1.7) (Krieger, EAMT 1993)

• Typed feature formalisms as a common basis for linguistic specification (Krieger, EAMT 1993)

ACL

• Hans-Ulrich Krieger. 1993. Typed feature formalisms as a common basis for linguistic specification. In Third International EAMT Workshop: Machine Translation and the Lexicon, pages 101–119, Heidelberg, Germany. Springer Berlin Heidelberg.