PROBLEM OF REALIZING MORPHOLOGICAL ANALYSIS DURING MACHINE TRANSLATION (PROBLEMY OSUSHCHESTVLENIYA MORFOLOGICHESKOGO ANALIZA PRI MASHINNOM PEREVODE),

Abstract

The paper proposes a method of cutting off endings (successive limitation) for morphological analysis of Russian. The strings in the branching algorithm are replaced by a sequence of constants; as many categories are investigated simultaneously as there are digits in the machine word. This makes possible a substantial reduction of the size of the program and of the analysis time. The main feature of the method is that in investigating the base set (the set of categories under consideration) whose elements are the separate categories (number, case, verb form, etc.) it is necessary to determine the narrowest subset: e.g., the number and case of a noun. The various categories are represented by the digits in the machine word, and the various features are represented by Boolean vectors, which are, in essence, subsets. The letters in the ending of the word being analyzed are considered to be elementary features. The method of analysis is described in detail; other applications are discussed. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 21, 1967
Accession Number
AD0670114

Entities

People

  • O. Varga

Organizations

  • National Air and Space Intelligence Center

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Computer Science
  • Computational Linguistics
  • Computational Science
  • Machine Translation
  • Mathematics
  • Natural Language Processing
  • Sequences
  • Translations

Readers

  • Computational Linguistics
  • Information Retrieval
  • Regression Analysis.

Technology Areas

  • AI & ML
  • AI & ML - Machine Translation