| { | |
| "paper_id": "W83-0117", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T06:07:53.439295Z" | |
| }, | |
| "title": "", | |
| "authors": [ | |
| { | |
| "first": "N\u20ac", | |
| "middle": [], | |
| "last": "Limarlcka", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Melainki Univer;-i ty of Technology p.spoC'", | |
| "location": { | |
| "country": "Finland" | |
| } | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Harri", | |
| "middle": [], | |
| "last": "Jappinen", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Melainki Univer;-i ty of Technology p.spoC'", | |
| "location": { | |
| "country": "Finland" | |
| } | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "' /\\arno Lehtola", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Melainki Univer;-i ty of Technology p.spoC'", | |
| "location": { | |
| "country": "Finland" | |
| } | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "", | |
| "pdf_parse": { | |
| "paper_id": "W83-0117", | |
| "_pdf_hash": "", | |
| "abstract": [], | |
| "body_text": [ | |
| { | |
| "text": "The sentence \"Nuorena poika heitti kiekkoa\" (\"As young, the boy (used to) throw the discus\"), for example, will be given the structure", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "( 1) The above feature explains why no registers are needed in our approach.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We have outlined a model of Finnish which is based on 2-way structure building transition networks. We have, as the above illustration exhi bits, specified our model with a kind of production-rule formalism.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusions", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A compiler which compiles such descriptions into LISP is under construction. This LISP-code is further compiled into a directly execu table code so that no interpretation of the productions or production packets of the grammar is necessary. That is, most of the linguistic knowledge is put into active form. We hope to get Implementational results in early spring 1984.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusions", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "176 Proceedings of NODALIDA 1983", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "176", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Proceedings of NODALIDA 1983", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Proceedings of NODALIDA 1983", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [ | |
| { | |
| "text": "RELATION", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "^8)", | |
| "sec_num": null | |
| } | |
| ], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "The Grammar of Case; Towards a LocalIstic Theory", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Anderson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1971, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Anderson, J.: The Grammar of Case; Towards a LocalIstic Theory. Cambridge University Press, London 4 New York, 1971.", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "On Case Grammar", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Anderson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1977, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Anderson, J.: On Case Grammar. Croom Helm, London 1977.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "The case for a case", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "Fillmore", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1968, | |
| "venue": "Universals in Linguistic Theory", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "1--88", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Fillmore, C.; The case for a case. In Universals in Linguistic Theory (eds. Bach, E., and Harms, T.), Holt, Rinehart 4 Winston, New York 1968, 1-88.", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "Types of lexical information", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [], | |
| "last": "\u00a343 Fillmore", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1971, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "109--137", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "\u00a343 Fillmore, C.: Types of lexical information. In Semantics: An Interdisciplinary Reader (eds. Steinberg, D., and Jacobovitz, L.), Cambridge University Press, 1971, 109-137.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Dependency theory; A formalism and some observations", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [], | |
| "last": "Hays", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1964, | |
| "venue": "Language", | |
| "volume": "40", | |
| "issue": "", | |
| "pages": "511--525", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "\u00a353 Hays, D.; Dependency theory; A formalism and some observations. Language 40, 1964, 511-525.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Introduction to Automata Theory, Languages and Computation", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Hopcroft", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Ullman", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1979, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "\u00a363 Hopcroft, J., and Ullman, J; Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "Arguments for a Non-transformational Grammar", | |
| "authors": [ | |
| { | |
| "first": "R", | |
| "middle": [], | |
| "last": "Hudson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1976, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hudson, R.: Arguments for a Non-transformational Grammar. The University of Chicago Press, 1976.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "Suomen kielen verbien leksikaalinen kuvaus. Lisensiaattityo. Turun yliopiston suomalaisen ,ja yleisen kielitieteen laitos", | |
| "authors": [ | |
| { | |
| "first": "A", | |
| "middle": [], | |
| "last": "\u00a393 Pajunen", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1982, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "\u00a393 Pajunen, A.; Suomen kielen verbien leksikaalinen kuvaus. Lisensiaattityo. Turun yliopiston suomalaisen ,ja yleisen kie- litieteen laitos, 1982.", | |
| "links": null | |
| }, | |
| "BIBREF11": { | |
| "ref_id": "b11", | |
| "title": "Transition network grammar for natural language analysis", | |
| "authors": [ | |
| { | |
| "first": "W", | |
| "middle": [], | |
| "last": "Woods", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1970, | |
| "venue": "Communications of the ACM", | |
| "volume": "13", | |
| "issue": "", | |
| "pages": "591--606", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Woods, W.; Transition network grammar for natural language analysis. Communications of the ACM 13, 1970, 591-606.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "uris": null, | |
| "text": "propounds an outline of a computational model of Finnish sentence structures. Although we focus on Finnish we feel that the ideas behind the model might be applicable to other languages as well, in particular to other inflectional free word order languages. A parser based on this model is being implemented as a component of a larger system, namely a natural language data base interface. There it will follow a component of morphological analysis (see JSppinen et al C83); hence, throughout the present paper it is assumed that all relevant morpho logical and lexical information is computationally available for all words in a sentence. Even though we have a data base application in mind, sen tence analysis will be based on general linguistic knowledge. All applicatio-. dependent inferences are left to subsequent modules which are of Finnish Sentence Structure Esa Nelimarkka, Harri J\u00e4 ppinen, Aarno Lehtola Proceedings of NODALIDA 1983, pages 169-177", | |
| "type_str": "figure", | |
| "num": null | |
| }, | |
| "FIGREF1": { | |
| "uris": null, | |
| "text": "a dependency-constituency hybrid structure induced by a dependency grammar meets the requirements. This structure consists of partof-whole relations of constituents and labelled binary dependency relations within a constituent.", | |
| "type_str": "figure", | |
| "num": null | |
| }, | |
| "FIGREF2": { | |
| "uris": null, | |
| "text": "such structures lies in the fact that many word order varying transformations can now be localized to a permutation of the head and its dependants in a constituent. As an example we have the permutations )obj (poika)gijbj heitti (nuorena)a(jvi) Having reduced the depth of stuructures (by having a verb and its sub-,ie<.-L, ob.iect, adverbials etc. on the same level) we bypass many discontinuities that would have appeared in a deeper structure as a result of rising transformations. The second argument *^or our choices is the well acknowledged prominent role of a finite verb in regard to the form and meaning of a sentence. The meaning of a verb (or a word of other categories as well) includes knowledge of its deep cases, and the choice of a particular verb to express this meaning determines to a great extent what deep cases are nresent on the surface level and in what functions. Moreover, due to the free word order of Finnish, the main means to indicate the function of a word in a sentence is the use of surface case suffixes, and very often the actual case depends not only on tV)e Intended function or role but on the verb as well. Both of these arguments speak well for a combination of dependency and case gram ma rs. We claim that such a combination can be put into a computational form, and that the resulting model is one which effi ciently takes advantage of the central role of the constituent head in the actual parsing process. We shall outline below how this can be , in case of an inflectional language, the defini tion of dependants with restrictions on mere categories would not suf fice. Morphological conditions on the head and its dependants are needed, too. This would lead to another kind of frame multiplication: , we wish to know the syntactic function of a depen dant, not only its place, category, number, case etc. We shall now show how to overcome these difficulties. A 2-way finite tree automaton -model We begin with a unification of the frames (5) by abstracting the laws that govern the restrictions on the head and its dependants in such a sequence. These abstractions, which we call fu nctions, are defined as formal binary relations on the set of inflected words (which are con sidered as complexies of all their relevant properties). It is no surprise that these abstract functions will correspond to -and are named after -the traditional parsing categories like subject, object, adverbial, genetive attribute etc. After the adoption of these abstract functions the sequence (5) reduces to a single \"relation frame\" step is to combine these relation frames with a structure building 2-way finite tree automaton. At this point we also give a computational -^crm to the idea of the dominance of the head of the constituent v/ith respect to its form and meaning. Recall that a standard 2-way finite automaton consists of a set of states, one of which is a starting state and some of which are final states, and of a set of transition arcs between the states. Each arc recognir.es a word, changes the staie of the automaton and moves the reading head either to the left or right. (Cf. Hopcroft-Ullman 16].) We modify this standard notion to recognize left and right side depen dants of a word -obligatory, facultative valencial dependants and free ones -starting from the most immediate neighbour. Instead of recognizing words (or a word categories) we make these auto mata recognize functions, l.e. occurances of abstract relations between the postulated head and its left or right neighbour. we have shown, consists of a collection of finite tran sition networks which activate each other with pop-and push-like control operations. How does our approach then differ from, say. Woods' ATN-formalism, which seems to have similar characteristics? One difference is the use of 2-way automata Instead of 1-way automata. There are also other major differences. ATN-parsers seem to use pure constituent structures containing non-terminal auxiliary categories (VP, NP, AP...) without explicit use of dependency relations within a constituent. In our dependency oriented model non-terminal categories are not needed, and a constituent is not postulated until its head is found. In fact, each word collects actively its dependants to make up a consitutent where it is the head. A further characteristic of our model is the late postulation of ^ function or a semantic role. Trees are built blindly without any prede cided purpose. The function or semantic role of a constituent is not postulated until some earlier or forthcoming neighbour is activated to recognize dependants of its own. Thus, a constituent just waits to be chosen into some function.", | |
| "type_str": "figure", | |
| "num": null | |
| } | |
| } | |
| } | |
| } |