| { | |
| "paper_id": "W85-0110", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T06:13:27.765796Z" | |
| }, | |
| "title": "", | |
| "authors": [], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "Much work in dependency analysis seems to have been done in Slavonic and German languages and Japanese, which are all (highly) inflectional. Quite recently researchers of non-inflectional languages have also become interested in dependency-oriented models. It is probable that dependency analysis is suitable for both kinds of languages. Currently there is active work going on in some sort of automatic dependency analysis or formal modelling of dependency analysis at least in Czechoslovakia (e.g. Sgall,", | |
| "pdf_parse": { | |
| "paper_id": "W85-0110", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "Much work in dependency analysis seems to have been done in Slavonic and German languages and Japanese, which are all (highly) inflectional. Quite recently researchers of non-inflectional languages have also become interested in dependency-oriented models. It is probable that dependency analysis is suitable for both kinds of languages. Currently there is active work going on in some sort of automatic dependency analysis or formal modelling of dependency analysis at least in Czechoslovakia (e.g. Sgall,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "This paper describes some basic linguistical characteristics of the parser, DADA, that has been implemented as a part of a database interface system for written Finnish queries (Nelimarkka et al 1983 , Lehtola et al 1985 * The parser is general and it is by now capable of analyzing a nontrivial subset of Finnish clauses. The basic idea of the parser is to provide analyzed sentences with syntactico-semantic structure. The structure that is given to an input clause is a functional case-labeled dependency structure. Dependency is stated and interpreted in functional labels which are then further interpreted using semantic roles.", | |
| "cite_spans": [ | |
| { | |
| "start": 177, | |
| "end": 199, | |
| "text": "(Nelimarkka et al 1983", | |
| "ref_id": "BIBREF6" | |
| }, | |
| { | |
| "start": 200, | |
| "end": 220, | |
| "text": ", Lehtola et al 1985", | |
| "ref_id": "BIBREF9" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Therefore a superficial semantic representation is given to the analyzed sentence.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The following set lists salient features of our parser;", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-113-On modelling dependency-oriented parsing Kimmo Kettunen Proceedings of NODALIDA 1985, pages 113-120 1 ) strength in grasping word-order variations of an inflectional language. This is due to the dependency grammar and to the implementation that employs two-way automata (cf. Levelt I974).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "2 ) Multidimensional analysis: full advantage of the rich inflectional morphology of Finnish is obtained. Rules of grammar are stated so that morphological knowledge as well as knowledge from higher strata may appear in them.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "3 ) Parallel syntactic and case-semantic analysis or only syntactic analysis may be obtained as one wishes.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Semi-strict separation of linguistic knowledge and parsing mechanism. This is due to the high-level grammar description language, DPL, in which the grammar is written. The grammar and the parser in their present version have some 30 pages of DPL-description. That makes about 5500 lines of compiled elementary LISP-code.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "4)", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The parser is strongly data-driven. Parsing proceeds bottom-up and is lexicon-based. Structures are built from words to larger constituents (cf. Winograd 1983)\u00bb 6) All the time the parser has only a few rules that must be checked. The only hypothesis made are those, which come with expectations of the current stack.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5)", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "When rules are activated like this, the size of grammar will not affect the efficiency of the parser.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5)", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Firstly we shall briefly sketch the overall parsing process.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "A morphological analysis precedes the parser. We have a morphological processor that analyzes the inflected words and gives the basic word forms and inflectional categories (cf. Jappinen et al 1983)* This is, of course, a prerequisite for parsing a highly inflected language, such as Finnish. The parser gets morphologically analyzed words with their lexical information. Lexical descriptions come from the parser's own lexicon.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "A disambiguator for ambiguous morphological output should also exist somewhere. One place for it could be after morphological analysis (cf. Karlsson 1985b) or the disambiguation could be done during the parse. So far we have none. For each morphologically ambiguous token of a word form the parser tries to find dependents.", | |
| "cite_spans": [ | |
| { | |
| "start": 140, | |
| "end": 155, | |
| "text": "Karlsson 1985b)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "This leads to multiple work and possible misparses.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "-i i a - 114 Proceedings of NODALIDA 1985", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "The DADA parser proceeds word-by-word in the input clause. The basic method of the parser is that it tries to recognize possible dependents for each token of a word category moving out from the nearest neighbour. As the parser is modelled with two-way automata, it can recognize subordinates both from the left and right context of the current input word. For each word category possible dependents are described in automaton networks.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "We may generalize that during the parse local dependencies are sought first: each word category gathers dependents of its own type. When each non-verbal category has finished gathering its dependents and it is labeled as +Phrase (i.e. it governs > 0 dependents), it may be matched to the global structure of the clause. In non-elliptic sentences (sentences containing a finite verb) the parsing is always finished when some global dependent (dependent of the main verb) is attached and the working stack is empty. Features and categories can be written in disjunctive and conjunctive statements to form rules of grammar. When a match between C and D succeeds D is attached to C and labeled with the proper syntactic function label and (possibly) with semantic case role label.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "Word (Cati) 4- J Rn R n ( ( START -> ?X (WCati) -> X?(Wcati) \u25a0 L > XFin (Wcati) -> New", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "Our kind of description is rather far from the Haysian classical dependency notation. Whereas Hays describes order and restrictions in the same formula (Hays 1964) , we have different descriptions for each. Especially the word order restrictions are currently described rather clumsily. Possible word orders are blurred into paths of the automaton network. As a linguistic description this is not satisfying and a new way for describing the word order should be found. The second major problem is that lexical knowledge is stated in two places. At present automaton descriptions work as a kind of valency lexicons which give the possible dependents of each word-category. But it is obvious that this information should be given separately in the lexicon.", | |
| "cite_spans": [ | |
| { | |
| "start": 152, | |
| "end": 163, | |
| "text": "(Hays 1964)", | |
| "ref_id": "BIBREF1" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "A sketch of the parsing process", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "The parser builds labeled dependency trees which have the following characteristics:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Assigned structures", | |
| "sec_num": "3" | |
| }, | |
| { | |
| "text": "-the linear order of the surface clause is preserved in the trees -heads and their modifiers are attached directly without any non-terminal symbols ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Assigned structures", | |
| "sec_num": "3" | |
| }, | |
| { | |
| "text": "As we know two elements of a sentence are directly related in a dependency characterization if one DEPENDS on (conversely, is GOVERNED by) the other. The relationship is transitive, irreflexive and antisymmetric. A dependency relation is said to hold between two elements in certain circumstances. One member of this relation is called the GOVERNOR (or head or regent), the other the DEPENDENT (or modifier) (cf. e.g. Hudson 1930a , Mel'cuk 1979 , Kunze 1975 \u2022 Two intuitive ideas determine the existence of a dependency relation between the governor and the dependent:", | |
| "cite_spans": [ | |
| { | |
| "start": 418, | |
| "end": 430, | |
| "text": "Hudson 1930a", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 431, | |
| "end": 445, | |
| "text": ", Mel'cuk 1979", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 446, | |
| "end": 458, | |
| "text": ", Kunze 1975", | |
| "ref_id": "BIBREF8" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Dependency", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "i) The governor expects to find certain types of dependents in its neighbourhood. This expectation is inherent to the element that constitutes the governor, and may be a piece of dictionary kncfwledge.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Dependency", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "ii) The governor is felt to be modified by the dependent (not vice versa). Johnson & King & des Tombe (1985) have discussed some basic problems concerning the dependency construction. It is useful to briefly state their points and consider our formalism in those respects.", | |
| "cite_spans": [ | |
| { | |
| "start": 75, | |
| "end": 108, | |
| "text": "Johnson & King & des Tombe (1985)", | |
| "ref_id": "BIBREF5" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Dependency", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "The basic representational principles may be stated followingly (cf. also Robinson 1970): i) There is one-to-one correspondence between leaves of the tree and primitive elements of the construction represented by the tree.", | |
| "cite_spans": [ | |
| { | |
| "start": 74, | |
| "end": 89, | |
| "text": "Robinson 1970):", | |
| "ref_id": "BIBREF17" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Dependency", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "ii) There is one-to-one correspondence between nonterminal nodes of the tree and constructions of the text.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Dependency", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "iii) Labellings on the nodes express the categories of primitive elements, constructions, and dependency relations.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Dependency", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "-117-", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": ". Dependency", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "As Johnson & King & des Tombe point out, this is elegant but empirically wrong and must be augmented. There are two classes of problems to the basic representational theory. Firstly it implies that no unit can be a member of more than one construction.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Proceedings of NODALIDA 1985", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Secondly it implies that every unit must be a member of at least one construction (except the text itself). But this is not the case. In a sentence like \"John tried to swim\" \"John\" is member of two constructions (Hudson calls this modifier-sharing) and this cannot be represented in a tree form. Accordingly in the sentence \"Tom went to Paris and Hanna to London\" \"went\" is a governor for two constructions (head-sharing). The Eurotra formalism has introduced a speacial notion of EMPTY ELEMENTS to handle these phenomena. These are shadow elements of their antecedents, i.e. the elements that participate in more than one construction. The empty elements in trees are leaves that do not correspond to anything at all in the text (the one-to-one correspondence is no longer valid).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Proceedings of NODALIDA 1985", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "There are some further problems. In some constructions there exist elements that are not dependent on anything in the clause.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Proceedings of NODALIDA 1985", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In \"Frankly, I do not care a bit\" \"frankly\" does not seem to be dependent on any word in the clause. For these situations a notion of TRANSCONSTRUCTIONALS is introduced in the Eurotra formalism. These are handled in a way that makes them as if they were dependents in the construction they are related to intuitively. A special label, pseudodependency, is attached to them.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Proceedings of NODALIDA 1985", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Such problems are of course existent also in Finnish. Especially the problem of modifier-sharing is common in rather simple clauses already. Different kinds of infinitive constructions are typical examples of the phenomenon. Clauses such as \"Poika haluaa analysoida kivia\" (\"The boy wants to analyze stones\") cannot be properly handled in our parser at present. Some new methods for handling these phenomena should be added either to the parser or at least in post parser analysis of sentences. At present the constructions of the parser are based only on the naively elegant one-to-one correspondence principle.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Proceedings of NODALIDA 1985", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-118-", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Proceedings of NODALIDA 1985", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Proceedings of NODALIDA 1985", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "118", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Proceedings of NODALIDA 1985", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "* Dependency Theory: a Formalism and Some Observations", | |
| "authors": [ | |
| { | |
| "first": "David", | |
| "middle": [ | |
| "G" | |
| ], | |
| "last": "Hays", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1964, | |
| "venue": "Readings in Automatic Language Processing", | |
| "volume": "40", | |
| "issue": "", | |
| "pages": "73--82", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hays, David G. 1964* Dependency Theory: a Formalism and Some Observations. Language 40: 511 -525* ------------------1966. Parsing. In Hays, D.G. (ed.). Readings in Automatic Language Processing. American Elsevier Publishing Company, New York: 73 -82.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Programs for Language Analysis and Inference. Examples of Application", | |
| "authors": [ | |
| { | |
| "first": "Peter", | |
| "middle": [], | |
| "last": "Hellwig", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hellwig, Peter 1985* Program System PLAIN. \"Programs for Language Analysis and Inference. Examples of Application.\" Computing Unit and Linguistics and International Studies Department. University of Surrey, Guildford.", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "Syntax. Fragen -L\u00f6sungen -Alternativen", | |
| "authors": [ | |
| { | |
| "first": "Hans", | |
| "middle": [], | |
| "last": "Heringer", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "&", | |
| "middle": [], | |
| "last": "Jttrgen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Strecker", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "&", | |
| "middle": [], | |
| "last": "Bruno", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Rainer", | |
| "middle": [], | |
| "last": "Wimmer", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1980, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Heringer, Hans Jttrgen & Strecker, Bruno & Wimmer, Rainer 1980. Syntax. Fragen -L\u00f6sungen -Alternativen. Wilhelm Fink Verlag, Munchen.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Oberfl\u00e4chensyntax und Semantik. Linguistische Arbeiten 93\u00ab Max Niemeyer Verlag", | |
| "authors": [ | |
| { | |
| "first": "Richard", | |
| "middle": [], | |
| "last": "Hudson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1976, | |
| "venue": "Proceedings of the Xlllth International Congress of Linguists", | |
| "volume": "1980", | |
| "issue": "", | |
| "pages": "89--101", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hudson, Richard 1976. Arguments for a Non-transformational Grammar. The University of Chicago Press, Chicago. -------------------1980a. Constituency and Dependency. Linguistics 13: 179 -198. -------------------1980b. Daughter-dependency Grammar. In Hans-Heinrich Lieb (ed.). Oberfl\u00e4chensyntax und Semantik. Linguistische Arbeiten 93\u00ab Max Niemeyer Verlag, Tubingen. -------------------1983* Word Grammar. In Hattori, Shiro & Inoue, Kazuko 1983 (ed.). Proceedings of the Xlllth International Congress of Linguists, Tokyo: 89 -101. -------------------1984\u00ab Word Grammar. Basil Blackwell, Oxford. -------------------1985* A Prolog Implementation of Word Grammar. Mimeo, October 85\u00bb University College, London.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "A Multilingual System under Development", | |
| "authors": [ | |
| { | |
| "first": "Rod", | |
| "middle": [ | |
| "&" | |
| ], | |
| "last": "Johnson", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "King", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Louis", | |
| "middle": [], | |
| "last": "Tombe", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "Computational Linguistics", | |
| "volume": "11", | |
| "issue": "", | |
| "pages": "155--169", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Johnson, Rod & King, Maghi & des Tombe, Louis 1985. A Multilingual System under Development. Computational Linguistics 11 : 155 -169.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "^Morphological Analysis of Finnish: a Heuristic Approach", | |
| "authors": [ | |
| { | |
| "first": "Harri", | |
| "middle": [ | |
| "&" | |
| ], | |
| "last": "Jappinen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Lehtola", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "&", | |
| "middle": [], | |
| "last": "Aarno", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Nelimarkka", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "&", | |
| "middle": [], | |
| "last": "Esa", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Matti", | |
| "middle": [], | |
| "last": "Ylilammi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1983, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Jappinen, Harri & Lehtola, Aarno & Nelimarkka, Esa & Ylilammi, Matti 1983\u00ab ^Morphological Analysis of Finnish: a Heuristic Approach. Helsinki University of Technology, Digital Systems Laboratory, report B26.", | |
| "links": null | |
| }, | |
| "BIBREF7": { | |
| "ref_id": "b7", | |
| "title": "Report on Research 1981 -1984* Publications of the Department of General Linguistics. No. 13\u00ab University of Helsinki", | |
| "authors": [ | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Karlsson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "", | |
| "volume": ". ----------------", | |
| "issue": "", | |
| "pages": "137--176", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Karlsson, Fred 1985a (ed.) Computational Morphosyntax. Report on Research 1981 -1984* Publications of the Department of General Linguistics. No. 13\u00ab University of Helsinki. -------------------1985b. Parsing Finnish in Terms of Process Grammar. In Karlsson 1985a (ed.): 137 -176.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "Automatische Analyse des Deutschen", | |
| "authors": [ | |
| { | |
| "first": "Jurgen ; \u00ab", | |
| "middle": [], | |
| "last": "Kunze", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Abh\u00e4ngigkeitsgrammatik", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1975, | |
| "venue": "Studia Grammatics XII", | |
| "volume": "1982", | |
| "issue": "", | |
| "pages": "17--34", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Kunze, Jurgen 1975\u00ab Abh\u00e4ngigkeitsgrammatik. Studia Grammatics XII. Akademie-Verlag, Berlin. -----------------1982a (Hrg.). Automatische Analyse des Deutschen. Akademie-Verlag, Berlin. -----------------1982b. Einfuhrung. In Kunze 1982a: 17 -34.", | |
| "links": null | |
| }, | |
| "BIBREF9": { | |
| "ref_id": "b9", | |
| "title": "Languagebased Environment for Natural Language Parsing", | |
| "authors": [ | |
| { | |
| "first": "Aarno", | |
| "middle": [ | |
| "&" | |
| ], | |
| "last": "Lehtola", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Harri", | |
| "middle": [ | |
| "&" | |
| ], | |
| "last": "Jappinen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Esa", | |
| "middle": [], | |
| "last": "Nelimarkka", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "Proceedings of the Second Conference of the European Chapter of the Association for Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "98--106", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Lehtola, Aarno & Jappinen, Harri & Nelimarkka, Esa 1985. Language- based Environment for Natural Language Parsing. Proceedings of the Second Conference of the European Chapter of the Association for Computational Linguistics, USA: 98 -106.", | |
| "links": null | |
| }, | |
| "BIBREF10": { | |
| "ref_id": "b10", | |
| "title": "Formal Grammars in Linguistics and Psycholinguistics", | |
| "authors": [ | |
| { | |
| "first": "W", | |
| "middle": [ | |
| "J M" | |
| ], | |
| "last": "Levelt", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1974, | |
| "venue": "Applications in Linguistic Theory. Mouton", | |
| "volume": "II", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Levelt, W.J.M. 1974. Formal Grammars in Linguistics and Psycholinguistics. Volume II: Applications in Linguistic Theory. Mouton, The Hague.", | |
| "links": null | |
| }, | |
| "BIBREF11": { | |
| "ref_id": "b11", | |
| "title": "Semantics 2", | |
| "authors": [ | |
| { | |
| "first": "John", | |
| "middle": [], | |
| "last": "Lyons", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1977, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Lyons, John 1977. Semantics 2. Cambridge University Press, Cambridge.", | |
| "links": null | |
| }, | |
| "BIBREF12": { | |
| "ref_id": "b12", | |
| "title": "Syntax", | |
| "authors": [ | |
| { | |
| "first": "P", | |
| "middle": [ | |
| "M" | |
| ], | |
| "last": "Matthews", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1981, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Matthews, P.M. 1981. Syntax. Cambridge University Press, Cambridge. -119- 119 Proceedings of NODALIDA 1985", | |
| "links": null | |
| }, | |
| "BIBREF13": { | |
| "ref_id": "b13", | |
| "title": "Igor 1979-Studies in Dependency Syntax", | |
| "authors": [ | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Mel'cuk", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "Linguistics Exxranea, Studia", | |
| "volume": "2", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Mel'cuk, Igor 1979-Studies in Dependency Syntax. Linguistics Exxranea, Studia 2. Karoma Publishers, Ann Arbor.", | |
| "links": null | |
| }, | |
| "BIBREF14": { | |
| "ref_id": "b14", | |
| "title": "* Semantics and Syntax; Parallels and Connections", | |
| "authors": [ | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Miller", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Miller, J. 1985* Semantics and Syntax; Parallels and Connections. Cambridge University Press, Cambridge.", | |
| "links": null | |
| }, | |
| "BIBREF15": { | |
| "ref_id": "b15", | |
| "title": "USA: 198 -204\u00ab Nelimarkka, Esa & Lehtola, Aarno & Jappinen, Karri 1984a. A Computational Model of Finnish Sentence Structure", | |
| "authors": [ | |
| { | |
| "first": "Kazunori", | |
| "middle": [ | |
| "&" | |
| ], | |
| "last": "Muraki", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Ichiyama", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "&", | |
| "middle": [], | |
| "last": "Shunji", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Yasumoto", | |
| "middle": [], | |
| "last": "Fukumochi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1983, | |
| "venue": "Proceedings of the Second Conference of the European Chapter of the Association for Computational Linguistics", | |
| "volume": "177", | |
| "issue": "", | |
| "pages": "167--176", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Muraki, Kazunori & Ichiyama, Shunji & Fukumochi, Yasumoto 1985* Augmented Dependency Grammar: a Simple Interface between the Grammar Rule and the Knowledge. Proceedings of the Second Conference of the European Chapter of the Association for Computational Linguistics, USA: 198 -204\u00ab Nelimarkka, Esa & Lehtola, Aarno & Jappinen, Karri 1984a. A Computational Model of Finnish Sentence Structure. In Anna S\u00e5gvall Hein (ed.). F\u00f6redrag vid De Nordiska D a talingvistik dagarna 1983, Uppsala: 169 -177\u00ab -------------------------------------------------------------------1984 b . Parsing an Inflectional Free Word Order Language with Two-way Finite Automata. In Shea, Tim 0. (ed.). ECAI-84: Advances in Artificial Intelligence. Elsevier Science Publishers: 167 - 176.", | |
| "links": null | |
| }, | |
| "BIBREF16": { | |
| "ref_id": "b16", | |
| "title": "* A Dependency Base for Linguistic Description", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Platek", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "J", | |
| "middle": [], | |
| "last": "Sgall", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1984, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "63--98", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Platek, M. & Sgall, J. 1984* A Dependency Base for Linguistic Description. In Sgall 1984 (ed.): 63 -98.", | |
| "links": null | |
| }, | |
| "BIBREF17": { | |
| "ref_id": "b17", | |
| "title": "Dependency Structures and Transformational Rules", | |
| "authors": [ | |
| { | |
| "first": "Jane", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Robinson", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1970, | |
| "venue": "Language", | |
| "volume": "46", | |
| "issue": "", | |
| "pages": "259--285", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Robinson, Jane J. 1970. Dependency Structures and Transformational Rules. Language 46: 259 -285-", | |
| "links": null | |
| }, | |
| "BIBREF18": { | |
| "ref_id": "b18", | |
| "title": "Contributions to Functional Syntax, Semantics and Language Comprehension. Linguistic & Literary Studies in Eastern Europe", | |
| "authors": [ | |
| { | |
| "first": "Petr", | |
| "middle": [], | |
| "last": "Sgall", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1984, | |
| "venue": "", | |
| "volume": "16", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Sgall, Petr 1984 (ed.). Contributions to Functional Syntax, Semantics and Language Comprehension. Linguistic & Literary Studies in Eastern Europe vol. 16. John Benjamins, Amsterdam.", | |
| "links": null | |
| }, | |
| "BIBREF19": { | |
| "ref_id": "b19", | |
| "title": "On the Validity of the Complement-adjunct Distinction in Valency Grammar", | |
| "authors": [ | |
| { | |
| "first": "Harald", | |
| "middle": [], | |
| "last": "Somers", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1984, | |
| "venue": "Linguistics", | |
| "volume": "22", | |
| "issue": "", | |
| "pages": "507--530", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Somers, Harald 1984\u00bb On the Validity of the Complement-adjunct Distinction in Valency Grammar. Linguistics 22: 507 -530.", | |
| "links": null | |
| }, | |
| "BIBREF20": { | |
| "ref_id": "b20", | |
| "title": "The End of Phrase Structure as", | |
| "authors": [ | |
| { | |
| "first": "Stanley", | |
| "middle": [], | |
| "last": "Starosta", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "We Know It. Series A, Paper", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Starosta, Stanley 1985-The End of Phrase Structure as We Know It. Series A, Paper no. 147-L.A.U.D.T., Linguistic Agency of Duisburg.", | |
| "links": null | |
| }, | |
| "BIBREF21": { | |
| "ref_id": "b21", | |
| "title": "Symposium on Grammars of Analysis and Synthesis and Their Representation in Computational Structures", | |
| "authors": [ | |
| { | |
| "first": "R", | |
| "middle": [ | |
| "L" | |
| ], | |
| "last": "Urutyan", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "S", | |
| "middle": [ | |
| "L" | |
| ], | |
| "last": "Simonyan", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1983, | |
| "venue": "Tallinn; 108 -109\u00ab Winograd, Terry 1983* Language as a Cognitive Process", | |
| "volume": "I", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Urutyan, R.L. & Simonyan, S.L. 1983* Analysis of Equivalence in Language by Means of D-grammars. In Tiits, M. (ed.). Symposium on Grammars of Analysis and Synthesis and Their Representation in Computational Structures. Academy of Sciences of the Estonian S.S.R., Tallinn; 108 -109\u00ab Winograd, Terry 1983* Language as a Cognitive Process. Volume I, Syntax. Addison Wesley, Massachusetts.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "text": "have labels of two kinds: syntactic function labels and case role labels. Syntactic functions are the main objects that are created by the dependency relations. Case role labels are further interpretations of these functional relations.", | |
| "type_str": "figure", | |
| "uris": null, | |
| "num": null | |
| }, | |
| "TABREF0": { | |
| "type_str": "table", | |
| "text": "Dependency is stated in two steps: for each word-class a set of possible dependents is determined by function names in states. Possible orderings of dependent and regent are stated in left and right-side automaton descripti ons.Dependency relations are the only rules that are used. A dependency relation concerns a pair of words (C, D) which have to fullfill the requirements stated in the rule. Rules are written as conditions or constraints that have to hold between C and D. Schematically rules are stated as follows:", | |
| "html": null, | |
| "num": null, | |
| "content": "<table><tr><td colspan=\"2\">((C = FrameCat FrameFeat ></td></tr><tr><td>-></td><td/></tr><tr><td>((D = < MorphC</td><td>SyntCat ConstFeat SyntFeat SemCat SemFeat</td></tr><tr><td/><td>FrameCat FrameFeat >)))</td></tr><tr><td>where</td><td/></tr><tr><td colspan=\"2\">MorphC = inflectional knowledge</td></tr><tr><td colspan=\"2\">SyntCat = syntactic category</td></tr><tr><td colspan=\"2\">SyntFeat = a bundle of syntactic features</td></tr><tr><td colspan=\"2\">SemCat = name of the semantic class</td></tr><tr><td colspan=\"2\">SemFeat = a bundle of distinctive semantic features</td></tr><tr><td colspan=\"2\">ConstFeat = knowledge that is figured out during the parse and</td></tr><tr><td colspan=\"2\">is stated in binary features</td></tr><tr><td colspan=\"2\">FrameCat = frame category of the verb</td></tr><tr><td colspan=\"2\">FraraeFeatc= frame features of the verb</td></tr><tr><td colspan=\"2\">C = regent candidate</td></tr><tr><td colspan=\"2\">D = dependent candidate</td></tr><tr><td/><td>input word is read</td></tr><tr><td colspan=\"2\">F i g.1: a simplified description of the flow of parsing</td></tr><tr><td colspan=\"2\">Here ?X and X? refer to left and right-hand states,</td></tr><tr><td>respectively.</td><td>START is the initial state that sends the</td></tr><tr><td colspan=\"2\">analysis to the proper automaton network. Rn's are</td></tr><tr><td colspan=\"2\">dependency relations.</td></tr><tr><td/><td>-115-</td></tr><tr><td colspan=\"2\">Proceedings of NODALIDA 1985</td><td>115</td></tr></table>" | |
| } | |
| } | |
| } | |
| } |