| { | |
| "paper_id": "C88-1010", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T12:14:45.866190Z" | |
| }, | |
| "title": "", | |
| "authors": [ | |
| { | |
| "first": "Alevtina", | |
| "middle": [], | |
| "last": "Bemova", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Charles University", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Karel", | |
| "middle": [], | |
| "last": "Ol~va", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Charles University", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Jarmila", | |
| "middle": [], | |
| "last": "Panevova", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Charles University", | |
| "location": {} | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "]~e describe the linguistic background of a Czech-to-Russian ~T system, stressing its features resulting from the closed relatedness of the two languages, above all the possibility of a minimization of the transfer. Related linguistic problems are analyzed within the MT project, as well as in the perspective of contrastive linguistics.", | |
| "pdf_parse": { | |
| "paper_id": "C88-1010", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "]~e describe the linguistic background of a Czech-to-Russian ~T system, stressing its features resulting from the closed relatedness of the two languages, above all the possibility of a minimization of the transfer. Related linguistic problems are analyzed within the MT project, as well as in the perspective of contrastive linguistics.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "The system of Czech-to-Russian MT system called RUSLAN is conceived ruimilarly as all linguistically based MT systems) as a modular system consisting (in brief) of a source language parser, a tranfer and a synthesis of the target language. The task is to translate texts from the domain of computers, in particular manuals of operating systems. Since in RUSLAN the source language is closely genetically related to the target one, some of the modules of the system could have been considerably simplified, not leaving out of consi4eration the theoretical linguistic framework on which t]~e system is based (dependency and stratificatlonal approach).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The simplifications concern, first of all, the transfer phase, so that the system cannot be understood as including a complete transfer.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "2. The effort towards a maximally effective procedure has also resulted in simplifications in the 2arser. This was made possible i.a. by the similarity of cases of syntactic ambiguity in the source and the target language.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "For example, with sequences of the type Verb Noun I Noun 2 ... Nouni, where each Nounj stands for a nominal or a prepositional group serving as a free modifier, the surface order can generally be preserved, which fact makes unnecessary a detailed identification whether any of the Noun~'s modifies the Verb or one of the precedin~ Nouns.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This can be illustrated by the output Russian sentence \"Vo vremja svoej raboty programma mo~et potrebovat' tak~e pomo~6\" sistemy pri obrabotke failer dannych.\" (Lit. \"In course of-lts work program can need also help of-system in processing of-files of-data.\"), where the group \"pri obrabotke ...\" can be analyzed (in both languages) as modifying the verb \"potrebovat \"' or the nouns \"pomo~5\"\" or \"sistemy\".", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "If the order of the nominal groups is preserved, the translation also preserves the structural ambiguity of the original.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Also nominallzations can be translated independently of their underlying structure (e.g. , \"Indeksnoposledovaternyje faJly neobchodimo do obrabotki preobrazovat'.\" -llt. \"Index-sequential files have-to-be before ~rocessi__~ transformed.\", or \"Programmy, napisannye na Jazyke Assembler v ramkach pred[du~6e~ versii, ne-obchodimo snova translirovat'.\" -lit.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "\"Programs written in language Assembler in framework-of ~ version have-to-be again compiled.\").", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Such an approach made it possible, at first, to minimize the transfer phase in the design of the project, and then, in the process of realization, the articu].ation of transfer operations into the pax'ser and the synthesis, which may lead to an impressio~ that RUSLAN works complete].y without transfer, i.e., as a direst binary NT system\u00b0 In principle, it can be said that the minim:[zation of the transfer reflects the empirical fast that the two languages have a lot el ~ common features.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "3. A great role is played in RUSLAN by the lexicon. The lexical entry contains maxi -~ mum of information, which is then projected to the syntactic rules; only the most general behaviour of words is rendered purely by means of syntax.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The rules of choice of lexical equivalents include different types of information\u00b0 Along with the data on parts of speech and morphemics, semantic features are listed, and (esp. with verbs) also the valency (subcategorization) frame; the valency slots are ac.-companled by information on their Czech morphemic form as well as that of the corresponding Russian items (as an example of their discrepancy might serve the pair \"u~ivat n~co(acc.)\" vs. \"po~zovat~Ja ~em(instr\u00b0)\" --\"to use stg.\" ). Where pasivization is possi~ ble,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "it is indicated which of the slots (mostly, but not always expressed by aecusa-~ tire) is selected as the passive surface sub-Ject, expressed then by nominative. With each of the slots, the semantic features required or excluded for the filler of that slot are indicated.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "These features help to identify the fillers, especially in cases of ambigui ~ ty, e.g. in Czech \"V~stupnl za~izenl nastavi ~,dkov&nl na po~adovanou hodnotu.\" (lito \"Output device sets line-spaclng at required value \") the verb \"nastavit\" (\"set\") has the following valency frame: Actor (nom/nom~ +Human ,+Device) , Objective (ace/ace ,~-Concr,+Result-of-process,-}luman),", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "where \"+ de ~ notes semantic features such that at least one of them has to be prescott with the filler of the respective slot, \" \" denotes semantic features excluded with the filler, and boldprint denotes Czech/Russian morphological forms. In this way, the ambiguity of morphemic case with \"~&dkov~ni\" and \"za~Izeni\" (in both cases between non and ace) can be solved on the basis of semantic features of the \"two nouns. highe:e prog,,amm:i, ng language -@ language of--programming of-higher level (]].early, ~'~ome types ~\u00a2re easier \"to implement \"than the el:hers, which depends 011 the eomple-xity of i;he respective Czech and Russian con~. struetions. For simplification of some cases of the type do ~ where %he Hussian equivalent includes a modifying noun in a fixed morphemic form, this is treated as an uninflected word, the syntactic relation of which is established already in the dictionary. 3,2 Due %c the closeness of the languages, useful, tng:redien~ can be seen in the idea of a trans(;ueing dictionary propose@ and. elaborated i~ the English-to-Czech NT system (el\u00b0 Kirschner,82)o The transducing dictions .... ry, based on algorithmic handling of the regular productive international affixes (with exceptions listed in the main dictionary) and of the orthographic and similar differences, can be illustrated by the following :", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "as with the suffixes -gig (mental, ,\"assembly\") --~,.t (agreg/;t ,\"agl<regate\") , pen-~_ (koeficient , \"coefficiest\") , -ura (kubatura ,\"cubic vo-fume\") , an,:l the lexloal components of Greek er Latin opigin, such as -~_%:af, -~ko~o_ ~ (kar-diograf,\"cardiegraph\" ,elektroskop,\"electroscope\") , the Russian equivalents differ at most in details b~ with other suffixes of international use, the Russia[, equivalents correspond in a systematic way to the Czech ones~ as with -_~.~st-2l a/'-iK~. , C!9./.:::J=Ja. , .::J=9~.us/::!z~ m, fo:r an occlusive : krAtkp/korotki j \"short\"); such pairs as \"brad\" (\"castle\") vs. \"gored\" (\"town\") ~ where the lexical semantics differs, have to be ].is'bed in the lexicon. do whenever a word has net been identified in %he main dictionary and cannot he treated by %he procedures of the types as ,be ,Co , at ].east %ra~lsltteratJon and some of the elemenbary correspondences &re carried ou]; ~ so tha'b if cogs \"pPepln~n~\"", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(\"overloading\") or \"dis-keta\" (\"floppy disc\") were not found in the dictionary, they would be transduced as \"pe-repolnenie\" (correctly) an8 \" disketa\" (in-stead of \"glbkij disk\"), respectively\u00b0", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This procedure , and a set of similar f~%il-so ft rules for syntax , should ensure that the output be basically undel's%anda.ble.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "/4. The procedures of synt ac tie ana] ysis and synthesis are based on lexical ini'ormat ~ ion, including the valency frameso Certain difficulties arise when filling the slots of ohliga~ery adverbials (see Panevov [t,80) with which the forms of a given adverbial type are variable ~ e.g. \"vrA%it se kam\" (\"%o return somewhere\"):", | |
| "cite_spans": [ | |
| { | |
| "start": 214, | |
| "end": 220, | |
| "text": "[t,80)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "\"napravo\" (\"%o the rip;hi\" , adverb) ~ \"k problgmu\" (\"to the problem\" ~ prepo-sition \"k\" + ds/tive) , \"do bytu\" (\"into -the flat\" , preposition \"do 'I -l-accusa%J, ve) etc. Snch cases are handled by the parser tog-ether with free adverbials, only it must be ensured that the obligatory modifier is identified (in a case of ellipsis, it is necessary %o take into account the preceding\" sentence although often the Czech deletion goes in parallel with that in the corresponding Rus-sian sentence).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "4.fl One of the relevant differences be . tween Czech and Russian syntax concerns sentences with the Czech Ist person plural co: .... responding to the Russian reflexive form~:~ e .g.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Czech \"Algoritmus re zm is t~ovf)n i b I o]c\u00a2~ popisujeme v ~stJ 6\" vs. }{ussian \"Al\u00a3;orJ.tm razme~enlja blokov opJ. syvaetsjs v razdele 6\" (\"The algorithm of dislocation of blocks Js described in Sects 6\"). Often a modal e~.-pression is present:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "\"NAzvy progz'am~ m~erne mayn't v knihovn~ I' vs. Russian \"}!azvanija pro.-gramm me[no naj%i v biblioteke\" (\"The titles of the programs can be found in the library\") o", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The linguistic rules underlying the practical solution of these problems can have %he following form:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "NeUnacc VerblstP] -~ N\u00b0unnom Verbref] (N\u00b0unacc) Verbmodal ,IstPl Verbinf ~-~ (NOUnno m ) Modal V er bin i:'", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(\"~'Todal\" stands here for sueb express:ions as \"mo~no\" (\"possible\") , \"nado\" (\"nec ~s~arv\"); parentheses \" (\" ,')\" denote the facb that -the Objective is not always obligatory. 4.2 In some cases the ambig'uity of a Czech sentence corresponds to a simJ.].ar ambiguity in Russian. In other cases the ambip;uity in the two languages is not in such accord;.tnce\u00b0 This is illustrated by the fell. owing: The preposition \"o\" with locative in Czech is kept also in Russian or, with nouns having the feature Time, translated as \"vo vremja\" with genitive.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Differences in prepositional constructions are found also with the following pairs: c. Czech: Price n_~a programu pokrabujl i v tomto roce.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Russian: Raboty nad programmoj prodol~ajutsja i v f, tom godu. (The works on the program continue also this year. ) d. Czech: Prhee na fakult~ pokra~uj~ i v %omto rote.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Russian: Raboty na faku~tete prodol~ajutsja i v 6tom godu. (The works at the faculty continue also this year.) These examples cannot be fully accounted for by means of lexieal information, neither can they be included into the general scheme of syntactic rules.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "It is necessary to have a list of such differences.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "1.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In translating Czech subordinate clauses introduced by such conjunctions as \"zda\" ,\"-li\" (\"whether\") , \"jestli~e\"", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "(\"if\") , \"kdy~\" (\"when\"), \"dokud\" (\"till\"), \"dokud he\" (\"until\") , \"pokud\" (\"as long as\") , some of which are ambiguous, the text can be treated as relatively homogenous.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The functioning of a clause introduced by \"zda\" or \"-li\" as a subject can be identified on the basis of the valency of the verb in superordinated clause, where it is marked whether the verb may take a subordinated clause as its Actor or Objective.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In the other cases, suitable or at least acceptable translations of the conjunctions are as follows: Czech \"zda\",\"-li\",\"pokud\" ,\"jestli~e\" as Russian \"esli\"; Czech \"dokud\" ,\"dokud he\" as Russian \"poka\",\"poka ne\" , Czech \"kdy~\" as Russian \"kogda\".", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "It follows that while it is necessary to work \"to a certain degreewith the underlying structure, in'the majority of cases the equivalent can be chosen just in accordance with the conjunctions themselves.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "4.4 The Czech verb \"btt\" (\"to be\") has several Russian equivalents: the copula \"byt TM , verbs \"est TM , \"javljat~Ja\", \"naehodit u sja\", \"imet~ja\". The selection of the equivalent depends on the syntactic context: if the nominal predicate in Czech is in instrumental ease, then a form of the verb \"javljat~ja\" is preferred;", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "if a local adverbial is present, then the translation \"nachodit~ja\" is at place, otherwise the appropriate form of the copula is chosen;", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Of course, another point concerns the translation of \"btt\" within idioms (\"byt'v porjadke\", but \"imet~ja v ras-porja~enii\"). 4.5 The surface behaviour of negation is not the same in Czech and Jn Russian: in Czech, even partial negation is often expressed as a prefix of the verb, which gives rise to an ambiguity absent in Russian, where %hls distinction is always transparent. Some of the examples from our texts are: ao Czech: To ant system p~esn~ nev~.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Russian: ~togo da~e sistema to,no ne znaet. (Th~s even the system does not know exactly\u00b0) b. Czech: Tabulka nen~ ulo~cna na pevn6m m~st~ v pam6ti. Russian: Tahlica pome~aetsja ne na postojannom meste v pamjati. (The matrix is not placed in a fixed position in the stbrage.) 4.6", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 100, | |
| "end": 152, | |
| "text": "Tabulka nen~ ulo~cna na pevn6m m~st~ v pam6ti.", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We assume that the surface order is substantially the same in the two languages; the differences concern only such specific cases as, e.g., the positions of parts of the complex verb forms or those of certain pro~nouns and particles which have the character of elitics in Czech, but usually follow the verb in Russian: a. Czech:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "... vypadal by tak, ~e ~ tabulka obsahovala fldaje ... Russian: ... vygljadel by tak, 5to tablica soder{ala ~Z dannye ... (... he would look as if the matrix con-tained(eond.) data ...) b. Czech: Budeme se v opera~n~ch syst6mech sna~it ... Russian: V operacionnych sistemach budem s~aratsb/a~,' ' ' .. . (In the operating systeme~ we shall try ...)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The differences described in this section do not concern the structural order, and there is no danger that ambiguity might arise. The dislocation of function words and particles can be described by general rules. 4.7 In 4.1 through 4.6 we wanted to show what the problems of parsing are if the cor~ respondences in the underlying structure, in surface syntax and in the surface order of morphemes are to be made use of, while the differences are solved; we also wanted to il~ lustrate the narrowed, but nonetheless neces-sary role of transfer.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4.3", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We wanted to point out that, on the one hand, the closeness of the two languages makes it relatively easy to find a strategy for an MT system, since the most complex problems of ambiguities might be partially avoided, although, on the other hand, comparative empirical research in the domains of lexicon and of syntax is necessary also for such a pair of languages.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Results of such an approach may be useful in MT, and also in the context of a contrastive comparison of cognate languages.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5.", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Kirschner Z.: On a Device in Dictionary Operalions in Machine Translation, in proceedings of Coling \"82, Prague PanevovA J.:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "References:", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Formy a funkce ve stavb~ ~esk8 v~ty, Academia, Prague, 1980 ", | |
| "cite_spans": [ | |
| { | |
| "start": 37, | |
| "end": 59, | |
| "text": "Academia, Prague, 1980", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "References:", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": {}, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "text": "z~Xn:i/.-~rn;[ it '=!\u00a3k\u00a3/-4 ~. e s ki ~/ Co to a certain degree also word~ of Slavonic origin can be handled by a procedure based on correspondences with regular segment pairs such aS h/\u00a3[~ ]'3/~1, TraT/ToroT (where T s'l; and s", | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null | |
| }, | |
| "FIGREF1": { | |
| "text": "a. Czech: V 16t@ prob~.h].o jedngn5 o n ozv~ ! v az'J=aT!'j[ ~ .0~!o Russian : ]:,etom pro~lo sove~,anije .o ~!ovj)jr 2 v\u00a3tr:iante OS~ (In summer~ the negotiations on the new va--. riant of OS took place\u00b0) be Czech: V 16t@ prob~hlo jednAnl o. p-rf-tz__dn=i_nA\u00a3j!o Russian : Letom sove~ganie pre~Io vo vremja k aj!.~Lk]~I o (In summer , the negotiations took place during vaca~ions. )", | |
| "type_str": "figure", | |
| "num": null, | |
| "uris": null | |
| } | |
| } | |
| } | |
| } |