| { |
| "paper_id": "W77-0112", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T06:06:50.862107Z" |
| }, |
| "title": "Ulf Teleman, Manual f8r grammatisk beskrivning av talad och skriven svenska, Lund 1974", |
| "authors": [ |
| { |
| "first": "Jussi", |
| "middle": [], |
| "last": "Salmela", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "" |
| }, |
| { |
| "first": "Viljo", |
| "middle": [], |
| "last": "Kohonen", |
| "suffix": "", |
| "affiliation": {}, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "", |
| "pdf_parse": { |
| "paper_id": "W77-0112", |
| "_pdf_hash": "", |
| "abstract": [], |
| "body_text": [ |
| { |
| "text": "The primary purpose of the computer programme CHIIAB is modest: we hope it to be of use mainly to individual linguists or small projects with limited resources, who want to cope with sizable corpuses involving delicate classifications. In such a case processing the data manually will soon become laborious. To be more adaptable to linguis tic data processing, the present programme introduces some improvements over similar programmes already existing in various programme libraries (e.g., in HYLPS, in the Univac 1108 system of the University of Helsinki, and in the SPSS, for Dec 10). These improvements include the possibility for alpha-numeric coding, the use of up to ten \"filter variables\" to ex tract from the corpus precisely the desired variables for cross-tabulation, and the possibility to pick, out of the classifications of any variable, only the frequencies of any individual classificatory principles {e.g., codes 1,3,8,A,C, out of the total range from 1-F). These improvements mean a more economic use of the card space, and a more versatile use of the com puter.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "The basic idea in the system is that, instead of processing both the text and the coded symbols, only the symbols are fed into the computer. This solution naturally excludes certain kinds of research, such as vocabu lary frequency studies, but it is adequate for frequency counts and cross tabulations of, e.g., various semantic, syntactic and textual features. It is thus adaptable for a variety of research purposes. An important advan tage of the system is that it is remarkably cheap: the punching of the cards is fairly quick and straightforward, one card can accommodate a large num ber of classifications, and the computer processing is also quick.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "For the benefit of the individual researcher, who is frequently un sophisticated in computer technology, we have a l s o attempted to make the actual use of the computer as simple as possible. Thus, in order to have the computer carry out the desired cross-tabulations, the user only needs to punch one or two cards: one card for the specification of the variables to be cross-tabulated (and giving the title of the table if desired), and another card to give the \"filter\" variables (if these are needed; cf. below).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "2. Coding of the data. Mhet. analysing the primary material (text), the researcher transforms the features chosen for the study directly into a series of coding symbols. To do this he must have an idea of what he is looking for from the text, in the form of hypotheses to be tested or ques tions to which he wants to get quantitative answers. The codings are enter ed manually into primary matrices, according to a specific coding plan. The development of such a plan frequently involves pilot studies with experi mental data. For computer processing, the data are punched onto cards.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "In the present programme, one variable can be given a field of max. 5 colimns, and a record can comprise a maximum of 5 cards ( i.e ., 400 onecolumn variables); with the alpha-numeric coding, one column can accommo date some 40 different symbols. In most cases, however, some 15-20 subclassifications will be enough, and one column will thus suffice. The first few columns will be two-or-more column variables, for an exact identifica tion of the data (e.g., text/page/line, or consecutive numbering). M e have not adopted the mnemonic coding symbols used, e.g., in M AM BA, because the one-digit alpha-numeric symbols are more economical. In practice, we have noticed that the researcher can (and does) memorize quite a detailed coding plan with \"decontextualized\" symbols within the first few days (or weeks) of intensive coding work. This relieves him from constant checking of the symbols and thus speeds up the coding process. In the presentation of the results one naturally has to refer to the original text for relevant exam ples.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "3. Checking and correcting of the data. In addition to the veri fying punching, the programme provides four possibilities for the checking of the data. (1) The checking of the min. and max. limits of codings in each variable (e.g., from 1 to F; anything above F must be an error) reveals er rors that are typically due to punching (these can be eliminated by veri fying punching, though this is laborious in a large corpus). (2) The prog ramme also gives the totals of coded and lacking symbols in each variable.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "These are useful in cases in which the researcher knows that certain vari ables should have the same total frequencies (cf. check 3), and in extreme cases in which the researcher is reasonably sure that given variables should contain coding in all or very few records. (3) With interrelated variables, the programme can be used to check simultaneous presence/absence of coding in any combination of variables, for example, if the coding plan has four columns for different properties of the subjects of sentences (such as length, structure, givenness and position), all of these must have some coding or be blank. The computer prints out the records showing lack of agreement. (4) further, \"impossible\" cross-tabulations can also be used to spot errors. Thus, for example, if passive sentences are entered in column X with codings 3,4,6, and their subjects are analysed in a subsequent column Y,l-8, a tabu lation of the identification variables with X-3,4,6 and Y-blank/p ( i.e ., no coding) as the filte r variables will give a lis t of records in which the subject properties had not been entered into the matrix. Errors in (3) and (4) are thus frequently due to the researcher forgetting to enter the rele vant information in all the places; such errors cannot be revealed by veri fying punching. With (4) one can even get inside the total frequencies of the variables, by specifying parts of them to be checked for agreement, f i nally, the actual data cross-tabulations will, of course, serve as further checks in cases of impossible or meaningless contingencies. The programme can be used to print out the dubious records for checking and eventual cor rection. The erroneous records will be replaced on the magnetic tape by the corrected ones. 4. The cross-tabulation programme can be utilized for the following purposes: (1) extraction of data according to the desired specifications or their combinations (\"filters\"), (2) cross-tabulation of any two variables against each other, (3) calculation of the Chi square test and the contin gency coefficient, and (4) calculation of the relative frequencies by the totals of the rows and columns, and the sum total.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "(1) The maximum of the filte r variables is 10. These are given on a separate card (or more than one card), after the card specifying the varia bles to be cross-tabulated. An example of a table request thus looks as fol* lows:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "16, 28 -1 first Table 5 -1^4,5,9,A 6 -3,4 25 * 1-8,f This means that variables 16 and 28 will be cross-tabulated against each other, and the data is extracted from that part of the corpus which is spec ified by the above values of variables 5, 6 and 25. If only portions of 84 the variables are desired for the tabulation, these must be given in the filte r variables (e.g., giving 16 = 1,3,5,A on the second card in the above example). To save computer time, the programme has a \"peeping device i.e ., if precisely the same filters are used in the following table, an auxiliary file is formed of the relevant records. This file is kept until a new combination of the filte r variables is read. To make use of this pos sib ility to save time, the researcher should group his table requests in such a way that the tables to be run from precisely the same sub-part of the corpus are in a consecutive order. This is not necessary, however, if it is more desirable to group the runs in some other way. A consequence of this limitation is that the tables to be run without any filte r variables ( i.e ., from the whole corpus) must be run first.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 16, |
| "end": 24, |
| "text": "Table 5", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "(2) For the cross-tabulations, the printout format provides 25 col umns and 155 rows, if needed. These limitations should be taken into account when grouping the row and column specifications. The variable given first in the table request is always interpreted as the row variable, and the second as the column variable. The frequency table is automatically supple mented by the percentages of the row and column totals out of the sum total, for quick reviews. By way of speeding up the programme, the testing of the filte r variables and the up-dating of the frequency tables are both done as a uniform binary search. The programming language is FO RTRAN 4.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "(3) The calculation of the Chi square test is optional. It is done according to the formulas given in Siegel (1956) .^Before applying the for mulas, the programme checks that the conditions for the calculation of the Chi are satisfied by the contingency table. In the negative case, the prog ramme prints out the reason for the inapplicability of the test. As this module also accepts contingency table data from the cards, it can be used as an independent unit for calculating the test, after possible re-groupings of the tabulated frequency data. When the Chi test is applicable, the prog ramme also calculates the value of the contingency coefficient (C), as a measure of the degree of association between the two variables. These are given immediately below the frequency tables, with the df value, (4) The calculation of the percentages by the totals of the rows, columns and the sum total is also optional, and it is possible to choose any of these. The members of the Text Linguistics Re search Group are working on syntactic data collected from Finnish, Swedish and English, to be processed on the CHIIAB. Kohonen has collected a corpus of some 4,000 clauses from Old and Early Middle English (between ca. 1000 and 1200) for a study of the development of 0E word order. The results will be published in the research reports of the group in 1978. A documentation of the progranme and the coding plans developed for Finnish and Swedish, with some preliminary findings, will appear in Erik Andersson (ed.), Work ing Papers on Computer Processing of Syntactic Data, Abo 1978.", |
| "cite_spans": [ |
| { |
| "start": 102, |
| "end": 115, |
| "text": "Siegel (1956)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "Our future plans for the development of the programme include a module that can be used for matching a dependent clause to its matrix clause and forming a separate file of the matrix clauses, for analyses of desired features in them. This module could also be used in contrastive studies, when comparing translations with the originals. Another Improve ment could be added to the tables, where the decontextualized symbols could be automatically replaced, if desired, by mnemonic 4-character title s, to be fed into the computer separately. This would s till preserve the ease and economy of the input, while making the interpretation of the tables more convenient. A further improvement could also be added to the \"peeping de vice\": instead of taking the full records into the auxiliary file (when pre cisely the same part of the data is going to be used for several consecu tive tables), only the relevant variables, i.e ., those actually needed for the tables requested, would be extracted from the data. This would again speed up the programme.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "The programme is now available in the Dec 10 system of the Univer sity of Turku. W e are planning to get it into the Univac 1108 system of the University of Helsinki, with terminals all over FlnlahdJ 1 The designing of the operations carried out by the programme has been done jointly by the two authors, while all the technical programming work has been done by Jussi Salmela. If somebody is interested in getting a copy of the programme he should contact Jussi Salmela. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background.", |
| "sec_num": "1." |
| }, |
| { |
| "text": "Proceedings of NODALIDA 1977", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": {}, |
| "ref_entries": { |
| "TABREF0": { |
| "content": "<table><tr><td>S. Concluding remarks.</td><td/></tr><tr><td>Proceedings of NODALIDA 1977</td><td>85</td></tr></table>", |
| "num": null, |
| "text": "Sidney Siegel, Nonparametric Statistics, New York 1956.", |
| "type_str": "table", |
| "html": null |
| } |
| } |
| } |
| } |
