<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="betz-hoffman-1963-use">
    <titleInfo>
        <title>The use of a random access device for dictionary lookup</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Robert</namePart>
        <namePart type="given">S</namePart>
        <namePart type="family">Betz</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Walter</namePart>
        <namePart type="family">Hoffman</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1963-25-26 aug</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">Denver, Colorado</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>The purpose of this paper will be to present a scheme to locate for single textual items and idioms in textual order their corresponding dictionary entries stored in an IBM 1301 random access mechanism. Textual items are considered to be 24 characters in length (left justified with following blanks). A dictionary entry consists of a 24 character Russian form, grammar information for the form and a set of translations for that form. Dictionary entries are packed into sequential tracks of the 1301. This paper will cover the method used for dictionary storage. The lookup for a textual item I first consists of a search for the first track that the dictionary entry E (if one exists) for I could be stored in. Once a track has been determined its contents are searched in core by a bisection convergence technique to find E. If E cannot be found, a “no entry” indication is made. If E is found a further search is made of the dictionary to find the longest sequence of text, starting with the first item I, that has a dictionary entry. The last such entry found is picked up. Included in the presentation will be examples of the dictionary lookup output for actual text.</abstract>
    <identifier type="citekey">betz-hoffman-1963-use</identifier>
    <location>
        <url>https://aclanthology.org/1963.earlymt-1.2</url>
    </location>
    <part>
        <date>1963-25-26 aug</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T The use of a random access device for dictionary lookup
%A Betz, Robert S.
%A Hoffman, Walter
%S Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics
%D 1963
%8 25 26 aug
%C Denver, Colorado
%F betz-hoffman-1963-use
%X The purpose of this paper will be to present a scheme to locate for single textual items and idioms in textual order their corresponding dictionary entries stored in an IBM 1301 random access mechanism. Textual items are considered to be 24 characters in length (left justified with following blanks). A dictionary entry consists of a 24 character Russian form, grammar information for the form and a set of translations for that form. Dictionary entries are packed into sequential tracks of the 1301. This paper will cover the method used for dictionary storage. The lookup for a textual item I first consists of a search for the first track that the dictionary entry E (if one exists) for I could be stored in. Once a track has been determined its contents are searched in core by a bisection convergence technique to find E. If E cannot be found, a “no entry” indication is made. If E is found a further search is made of the dictionary to find the longest sequence of text, starting with the first item I, that has a dictionary entry. The last such entry found is picked up. Included in the presentation will be examples of the dictionary lookup output for actual text.
%U https://aclanthology.org/1963.earlymt-1.2

Markdown (Informal)

[The use of a random access device for dictionary lookup](https://aclanthology.org/1963.earlymt-1.2) (Betz & Hoffman, EarlyMT 1963)

• The use of a random access device for dictionary lookup (Betz & Hoffman, EarlyMT 1963)

ACL

• Robert S. Betz and Walter Hoffman. 1963. The use of a random access device for dictionary lookup. In Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics, Denver, Colorado.