| { | |
| "paper_id": "E87-1047", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T10:54:00.169509Z" | |
| }, | |
| "title": "REPRESENTATION OF FEATURE SYSTEMS IN A NON-CONNECTIONIST MOLECULAR MACHINE", | |
| "authors": [ | |
| { | |
| "first": "L~zi6", | |
| "middle": [], | |
| "last": "K6im~n", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Hungarian Academy of Sciences Budapest I", | |
| "location": { | |
| "postBox": "P.O.Box 19. H-1250", | |
| "country": "HUNGARY" | |
| } | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "This paper is part of an enterprise whose aim is to represent linguistic knowledge in the form of a molecular machine (a dynamic network). That is, the molecules of the network not only store, but also send, receive, and process information. It is claimed that such a network can be conceived of as a model of the coalition structure of a connectionist network. The paper describes how the class of feature systems called unary feature hierarchies (whose importance is supported by phonological theory but will not be argued for in the paper) can be represented in the molecular machine.", | |
| "pdf_parse": { | |
| "paper_id": "E87-1047", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "This paper is part of an enterprise whose aim is to represent linguistic knowledge in the form of a molecular machine (a dynamic network). That is, the molecules of the network not only store, but also send, receive, and process information. It is claimed that such a network can be conceived of as a model of the coalition structure of a connectionist network. The paper describes how the class of feature systems called unary feature hierarchies (whose importance is supported by phonological theory but will not be argued for in the paper) can be represented in the molecular machine.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "Of the various branches of modern linguistic theory, phonology, as usual, was the first one to come up with really restrictive theories of features and feature systems, largely supported by empirical evidence coming from the study of a legion of linguistic phenomena. Phonology will most probably remain main source of evidence as far as the functioning of feature-based cognitive processes is concerned.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTRODUCTION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The present paper sets out to outline how a particular kind of feature system, close to several recent theories of phonological features, can be represented in connectionist networks. However, since some of the mechanisms involved, seriality and synchronization in particular, fall outside the scope of the existing connectionist networks, a nonconnectionist model simulating would-be serial connectionist networks will be used instead. The automaton described in the paper is able to unify feature structures as programs to be run on the machine itself.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTRODUCTION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The feature systems under scrutiny can be termed unary feature hierarchies. The underlying concept is close to the 'feature geometry' approach to autosegmental phonology (Clements 1985) in that a feature specification consists of features appearing on tiers, and features on adjacent tiers can be linked by association ~ines. Tiers are ordered in a multi-dimensional space, and the set of features that may appear on a particular tier is predefined.", | |
| "cite_spans": [ | |
| { | |
| "start": 170, | |
| "end": 185, | |
| "text": "(Clements 1985)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "UNARY FEATURE HIERARCHIES", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Unarity, on the other hand, means that a feature either appears within a given 'span' (of time) or it does not (instead of having different values); the absence of a feature simply means lack of information or undersDecification.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "UNARY FEATURE HIERARCHIES", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Features can only be linked to specified slots; on the other hand, tiers are adjacent to features rather than to tiers (hence the use of hierarchv instead of qeometry); that is, the following configuration may be ruled out if the H tier is adjacent to F but not to G: is that they may contain missing steps, i.e. distinguished nodes encoding lack of information concerning the way between two nodes. Missing steps can be eliminated by unification, provided that the required path is specified in the map of a processing molecule.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "UNARY FEATURE HIERARCHIES", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "F/G", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "UNARY FEATURE HIERARCHIES", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This mechanism corresponds to the function of 'super-coalitions', i.e. the synchronization and sequencing of the activation of otherwise distinct coalitions.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "UNARY FEATURE HIERARCHIES", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The basic operation performed by the molecular machine is a kind of unification, differing from the corresponding operation used in unification-based grammars by virtue of the differences in the feature structures and their representations. Since the map graphs of the molecular machine contain no node variables, unification essentially means the elimination of missing steps. Missing steps encode both alternative and conjunctive relations: Figure 6 . Sample directed graph with missing step.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 443, | |
| "end": 451, | |
| "text": "Figure 6", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "INFORMATION PROCESSING WITH THE MOLECULAR MACHINE", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A B V C D", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INFORMATION PROCESSING WITH THE MOLECULAR MACHINE", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The missing step (the asterisk) in Figure 6 can only be eliminated by supplying a path from A and B to either C or D, e.g. by unifying the graph in Figure 6 with the following:", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 35, | |
| "end": 44, | |
| "text": "Figure 6", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 149, | |
| "end": 157, | |
| "text": "Figure 6", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "INFORMATION PROCESSING WITH THE MOLECULAR MACHINE", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A B C Figure 7 . Sample directed graph without missing step. Figure 7 is also the resulting graph. Any other unification will pr, vide a partial solution at best.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 6, | |
| "end": 14, | |
| "text": "Figure 7", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 61, | |
| "end": 69, | |
| "text": "Figure 7", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "INFORMATION PROCESSING WITH THE MOLECULAR MACHINE", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The control function of the directed graphs in question is due to the fact that the addressed molecules are able to reduce the messages they receive. For example, in the case of the graph on Figure 7 , both molecules A and B will remove their addresses from the top level before forwarding the graph. The graph on Figure 6 , on the other hand, will be unable to activate any of the addressees because of the missing step it contains.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 191, | |
| "end": 199, | |
| "text": "Figure 7", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 314, | |
| "end": 322, | |
| "text": "Figure 6", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "INFORMATION PROCESSING WITH THE MOLECULAR MACHINE", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The unification and control functions of the molecular machine together define a particular conception of phonological rule systems, which can be argued for on independent grounds as well. Under this approach, the function of a phonological rule system is essentially to resolve problems arising from morphological processes, i.e. to fix ill-formed representations resulting from affixation by supplying missing features (e.g. in vowel harmony), linking or delinking features according to the derived context (e.g. in voice assimilation).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INFORMATION PROCESSING WITH THE MOLECULAR MACHINE", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Note that delinking in the present form of the machine consists of adding an inhibitory link leading to the feature to be delinked. Kalman and Kornai (1985) and Kalman (1986) .", | |
| "cite_spans": [ | |
| { | |
| "start": 132, | |
| "end": 156, | |
| "text": "Kalman and Kornai (1985)", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 161, | |
| "end": 174, | |
| "text": "Kalman (1986)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INFORMATION PROCESSING WITH THE MOLECULAR MACHINE", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": {}, | |
| "ref_entries": { | |
| "TABREF0": { | |
| "text": "Category tier ---N .... N .... N .... N .... ...... NSg ....... Molecules are able to send messages to each other; a message has the same form as the pieces of information stored in the molecules, i.e. it is a directed", | |
| "html": null, | |
| "content": "<table><tr><td/><td/><td colspan=\"4\">Features</td><td/><td/><td colspan=\"3\">Segments</td><td>1</td><td>2</td><td>3</td><td>4</td><td>5</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td colspan=\"2\">e~i</td><td colspan=\"2\">A o D u</td><td>N---</td></tr><tr><td colspan=\"2\">graph</td><td colspan=\"5\">Low High representing</td><td>a</td><td colspan=\"4\">-+ ---+ ---+ ---+ substructure</td><td>of</td><td>Number tier</td><td>I</td><td>x</td><td>I NSg--NSg--I</td></tr><tr><td colspan=\"12\">Back Round molecules with their dependencies. When a ---+ + + + + + + molecule receives a message, it unifies</td><td>Dual tier</td><td>I -D</td><td>x</td></tr><tr><td colspan=\"11\">the message with its own map,</td><td>and it</td></tr><tr><td colspan=\"12\">Figure 2. English lax vowels as feature forwards the resulting information. The</td><td>i: singular noun</td></tr><tr><td colspan=\"3\">ultimate</td><td colspan=\"6\">bundles. addressees are</td><td colspan=\"2\">the</td><td>'output</td><td>2: plural noun</td></tr><tr><td colspan=\"4\">molecules',</td><td colspan=\"3\">which</td><td>can</td><td colspan=\"4\">perform</td><td>extra</td><td>3: sinaulare tantum</td></tr><tr><td colspan=\"2\">actions</td><td/><td colspan=\"2\">when</td><td/><td colspan=\"3\">receiving</td><td colspan=\"2\">a</td><td>properly</td><td>4: dual noun and duale tantum</td></tr><tr><td colspan=\"12\">Tiers addressed message. That is, the message Segments</td><td>5: plurale tantum</td></tr><tr><td colspan=\"12\">e~ziAo9 acts as a program that will, after some u Root tier x x x x x x x modifications it undergoes, activate a</td><td>Figure 5. Sample feature system.</td></tr><tr><td colspan=\"12\">set of output molecules in a well-defined I I I I I I H/L/B tier L H B B B B order\u00b0 Modifications correspond to the</td></tr><tr><td colspan=\"12\">effects molecules on the path of the message. of the rules stored in I I I R tier R R R</td><td>the</td><td>In terms of the above, plural nouns and Dluralia the features of tantum are</td></tr><tr><td/><td>One</td><td colspan=\"4\">H/L tier of</td><td>the</td><td/><td colspan=\"2\">most</td><td colspan=\"2\">I I L H important</td><td>identical, prohibition concerning the 'Non-Singular' in spite of the link</td></tr><tr><td colspan=\"12\">characteristics of the messages sent (and</td><td>feature of the latter.</td></tr><tr><td colspan=\"12\">Figure 3. Unary feature hierarchy for other maps)</td></tr><tr><td/><td/><td/><td colspan=\"7\">English lax vowels.</td><td/></tr><tr><td/><td colspan=\"2\">That</td><td>is,</td><td colspan=\"4\">in this</td><td colspan=\"3\">approach,</td><td>feature</td><td>CONNECTIONIST MODEL OF FEATURE SYSTEMS</td></tr><tr><td colspan=\"4\">hierarchies</td><td colspan=\"2\">not</td><td colspan=\"2\">only</td><td colspan=\"3\">express</td><td>universal</td></tr><tr><td colspan=\"4\">restrictions</td><td colspan=\"2\">on</td><td colspan=\"3\">feature</td><td colspan=\"3\">structures</td><td>(as</td><td>Obviously,</td><td>the presence of a feature</td></tr><tr><td colspan=\"2\">feature</td><td/><td colspan=\"4\">geometries</td><td colspan=\"2\">do,</td><td colspan=\"2\">cf.</td><td>Clements</td><td>in a segment corresponds to a relatively</td></tr><tr><td colspan=\"2\">1985),</td><td colspan=\"2\">but</td><td colspan=\"3\">language</td><td colspan=\"3\">specific</td><td colspan=\"2\">redundancy</td><td>high</td><td>activation</td><td>level</td><td>of</td><td>a node</td><td>or a</td></tr><tr><td colspan=\"2\">rules</td><td/><td>and</td><td/><td/><td colspan=\"2\">feature</td><td/><td colspan=\"3\">co-occurrence</td><td>coalition</td><td>of</td><td>nodes</td><td>in</td><td>a connectionist</td></tr><tr><td colspan=\"12\">restrictions as well. In addition to the</td><td>network.</td><td>The vertical</td><td>geometry</td><td>of tiers</td></tr><tr><td colspan=\"12\">above, we shall assume the possibility of</td><td>determines the possibilities</td><td>of linking;</td></tr><tr><td colspan=\"3\">forbidding</td><td colspan=\"2\">that</td><td/><td colspan=\"3\">a feature</td><td colspan=\"2\">(or,</td><td>rather,</td><td>the essential</td><td>function</td><td>of links</td><td>is to</td></tr><tr><td colspan=\"12\">any feature of a given tier) be linked to</td><td>synchronize</td><td>the activation</td><td>of features,</td></tr><tr><td colspan=\"3\">another.</td><td colspan=\"2\">Link</td><td/><td colspan=\"4\">prohibitions</td><td/><td>are</td><td>not</td><td>but they</td><td>also</td><td>express</td><td>their</td><td>dependency</td></tr><tr><td colspan=\"12\">intended to be a feature value, hence the</td><td>relations.</td><td>Thus</td><td>association</td><td>lines</td></tr><tr><td colspan=\"7\">below representations</td><td/><td/><td/><td/><td>corespond to the fact that the activation</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>of</td><td>a</td><td>node</td><td>or</td><td>coalition</td><td>controls</td><td>the</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>activation of another node or coalition.</td></tr><tr><td/><td/><td/><td/><td>a.</td><td/><td/><td/><td/><td colspan=\"2\">b.</td><td>Finally,</td><td>link</td><td>prohibitions</td><td>can</td><td>be</td></tr><tr><td/><td colspan=\"2\">Tier 1</td><td/><td colspan=\"7\">.... F ........</td><td>F ....</td><td>represented</td><td>as</td><td>the</td><td>inhibition</td><td>of</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>X</td><td>tier particular tiers. The adjacency of tiers .... F .... G ....</td></tr><tr><td/><td colspan=\"2\">Tier 2</td><td/><td/><td/><td/><td/><td/><td/><td/><td>l will correspond to super-coalitions, I</td><td>i.e.</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>H tier features on adjacent tiers are features .... H .... H ....</td></tr><tr><td colspan=\"12\">Figure 4. Configurations with and without</td><td>whose activation</td><td>can be synchronized</td><td>at</td></tr><tr><td/><td/><td/><td/><td colspan=\"6\">link prohibition.</td><td/><td>Figure I. This configuration may be ruled all.</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>out.</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>In our present knowledge, none of the</td></tr><tr><td colspan=\"6\">specify identical</td><td colspan=\"4\">elements,</td><td colspan=\"2\">in spite of</td><td>existing connectionist networks can learn</td></tr><tr><td colspan=\"12\">the fact that no feature can be linked to</td><td>Unarity and encode the sequential is opposed</td><td>to activation traditional of</td></tr><tr><td>F</td><td>in</td><td colspan=\"3\">Figure</td><td colspan=\"2\">4a.</td><td>(X</td><td colspan=\"3\">stands</td><td>for</td><td>link</td><td>binary feature systems (with a marked '+' nodes or coalitions of nodes, albeit the</td></tr><tr><td colspan=\"4\">prohibition.)</td><td colspan=\"5\">For example,</td><td colspan=\"3\">consider</td><td>the</td><td>and organization an unmarked of</td><td>'-' human</td><td>value memory</td><td>for is</td><td>each most</td></tr><tr><td colspan=\"3\">following</td><td/><td/><td/><td colspan=\"2\">feature</td><td/><td/><td colspan=\"2\">hierarchy,</td><td>feature) and to ternary systems (with a probably highly serialized. To overcome</td></tr><tr><td colspan=\"5\">characterizing</td><td>a</td><td colspan=\"3\">language</td><td colspan=\"3\">where</td><td>plural</td><td>marked this deficiency (and for other reasons as '+', an unmarked '-', and an</td></tr><tr><td colspan=\"12\">and dual nouns usually behave in the same</td><td>unspecified well) we</td><td>'0' designed</td><td>value), a molecular while</td><td>feature machine</td></tr><tr><td colspan=\"7\">way (e.g. Hebrew):</td><td/><td/><td/><td/><td>geometries (and hierarchies) (cf. Kalm~n and Kornai 1985) to model the replace the</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>old-fashioned functioning of a sequential connectionist 'feature bundle'</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>conception, network.</td><td>in</td><td>which</td><td>each</td><td>segment</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>consisted of an unordered set of feature-</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>-value In</td><td>pairs. this</td><td>Compare machine,</td><td>the each</td><td>following molecule</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>(sketchy) contains a more or less stable piece of representations of lax vowels</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>in English: knowledge</td><td>encoding</td><td>the</td><td>coalition</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>structure it participates in, in the form</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>of a layout of the surrounding network.</td></tr></table>", | |
| "type_str": "table", | |
| "num": null | |
| } | |
| } | |
| } | |
| } |