<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="black-1989-finite">
    <titleInfo>
        <title>Finite State Machines from Feature Grammars</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Alan</namePart>
        <namePart type="given">W</namePart>
        <namePart type="family">Black</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1989-08</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the First International Workshop on Parsing Technologies</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Masaru</namePart>
            <namePart type="family">Tomita</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Carnegy Mellon University</publisher>
            <place>
                <placeTerm type="text">Pittsburgh, Pennsylvania, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>This paper describes the conversion of a set of feature grammar rules into a deterministic finite state machine that accepts the same language (or at least a well-defined related language). First the reasoning behind why this is an interesting thing to do within the Edinburgh speech recogniser project, is discussed. Then details about the compilation algorithm are given. Finally, there is some discussion of the advantages and disadvantages of this method of implementing feature based grammar formalisms.</abstract>
    <identifier type="citekey">black-1989-finite</identifier>
    <location>
        <url>https://aclanthology.org/W89-0229</url>
    </location>
    <part>
        <date>1989-08</date>
        <extent unit="page">
            <start>277</start>
            <end>285</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Finite State Machines from Feature Grammars
%A Black, Alan W.
%Y Tomita, Masaru
%S Proceedings of the First International Workshop on Parsing Technologies
%D 1989
%8 August
%I Carnegy Mellon University
%C Pittsburgh, Pennsylvania, USA
%F black-1989-finite
%X This paper describes the conversion of a set of feature grammar rules into a deterministic finite state machine that accepts the same language (or at least a well-defined related language). First the reasoning behind why this is an interesting thing to do within the Edinburgh speech recogniser project, is discussed. Then details about the compilation algorithm are given. Finally, there is some discussion of the advantages and disadvantages of this method of implementing feature based grammar formalisms.
%U https://aclanthology.org/W89-0229
%P 277-285

Markdown (Informal)

[Finite State Machines from Feature Grammars](https://aclanthology.org/W89-0229) (Black, IWPT 1989)

• Finite State Machines from Feature Grammars (Black, IWPT 1989)

ACL

• Alan W Black. 1989. Finite State Machines from Feature Grammars. In Proceedings of the First International Workshop on Parsing Technologies, pages 277–285, Pittsburgh, Pennsylvania, USA. Carnegy Mellon University.