| { |
| "paper_id": "C86-1020", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T13:14:15.545025Z" |
| }, |
| "title": "Towards a Dedicated Database Management System for I)ictionaries", |
| "authors": [ |
| { |
| "first": "Marc", |
| "middle": [], |
| "last": "Domenig", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "lnstitut Dalle Molle pour les Etudes Semantiques et Cognitives (ISSCO)", |
| "institution": "", |
| "location": { |
| "addrLine": "Route des Acacias 54 1227", |
| "settlement": "GENEVA", |
| "country": "Switzerland" |
| } |
| }, |
| "email": "" |
| }, |
| { |
| "first": "Patrick", |
| "middle": [], |
| "last": "Shann", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "lnstitut Dalle Molle pour les Etudes Semantiques et Cognitives (ISSCO)", |
| "institution": "", |
| "location": { |
| "addrLine": "Route des Acacias 54 1227", |
| "settlement": "GENEVA", |
| "country": "Switzerland" |
| } |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "This paper argues that a lexical database should be implemented with a special kind of database management system (DBMS) and outlines the design of such a system. The major difference between this proposal and a general purpose DBMS is that its data definition language (DDL) allows the specification of the entire morphology, which turns the lexical database from a mere collection of 'static' data into a real-time word-analyser. Moreover, the dedication of the system conduces to the feasibility of user interfaces with very comfortable monitor-and manipulation functions.", |
| "pdf_parse": { |
| "paper_id": "C86-1020", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "This paper argues that a lexical database should be implemented with a special kind of database management system (DBMS) and outlines the design of such a system. The major difference between this proposal and a general purpose DBMS is that its data definition language (DDL) allows the specification of the entire morphology, which turns the lexical database from a mere collection of 'static' data into a real-time word-analyser. Moreover, the dedication of the system conduces to the feasibility of user interfaces with very comfortable monitor-and manipulation functions.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "As the means of natural language processing axe gradually reaching a stage where the realisation of large-scale projects like EUROTRA becomes more and more feasible, the demand for lexical databases increases. Unfortunately, this is not a demand which is easy to meet, because lexical databases are exceedingly expensive. ~[he two main reasons for this are the following:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "\u2022 The mmmal labour involved with the coding of entries is time-consuming.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "\u2022 The possibilities to take over or to cumulate existing machine-readable dictionaries are rather limited because existing dictionaries usually contain only a part of the information needed fox\" a certain project. Severe consistency problems and the need for manual post-editing are the result of this (-> [Hess, et. al. 1983] ).", |
| "cite_spans": [ |
| { |
| "start": 306, |
| "end": 326, |
| "text": "[Hess, et. al. 1983]", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "As long as there is no general agreement on the kind of information which should be stored in a dictionary and therefore no universally applicable lexical database, we will have to live with these problems. The important question for the time being is, whether we can alleviate them. This paper ,argues that the best way to do that is to construct a dedicated database management system (DBMS). It presents a prototype proposal which has been conceived in a doctoral thesis [Domenig 1986 ] and which is the basis for a project that ISSCO 1 has recently started in conjunction with the Swiss National Fnnd. Because of the limited space at disposal we will mainly explain the most uncommon feature of the system, its morphological capabilities. We will not go into all of the monitor-and manipulation flmctions which alleviate the task of lexicography. The reader may infer the potential for them, however, if he remembers the following fact: as both the 'static' and 'dynamic' informations about entries (features and morphological processes, respectively) are coded within the system, they can both be accessed and controlled quite easily.", |
| "cite_spans": [ |
| { |
| "start": 474, |
| "end": 487, |
| "text": "[Domenig 1986", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "According to our opinion, a lexical database should not be a mere collection of 'static' data, i.e. a set of morphemes with associated features. It should comprise morphological processes which enable it to serve as a real-time word-analyser used in a message-switching environment (e..g. a local area network). Moreover, the DBMS should control the consistency of the data as far as possible so that only plausible combinations of features and morphological processes can be associated with entries. This differs very much from tile 'traditional' concept of lexical databases, where the entries consist of strings with associated features and the morphological interpretation is done outside of the database in a program. Naturally, the control over consistency is much more efficient and also easier to maintain if both 'static' and 'dynamic' information are coded within the database. General purpose DBMS -be they relational or whatever -do not live up to the formulated requirements for a real-time dictionary database. On the one hand, they are in many areas much too powerful for the task at hand, i.e. they can be adapted to a wealth of problems which have nothing to do with dictionaries. This flexibility ensues both a relatively low level of abstraction and a massive overhead. On the other hand, general purpose DBMS are not powerful enough; for example, a relational data definition language (DDL) provides no transparent means to express morphological processes.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Tile requirements for a lexical database", |
| "sec_num": "2." |
| }, |
| { |
| "text": "The design of the dedicated DBMS put forward in [Domenig 1986 ] follows the ANSI/SPARC 3-Schema-Model. As shown in Fig. 1 , it assumes that three different interfaces are needed:", |
| "cite_spans": [ |
| { |
| "start": 48, |
| "end": 61, |
| "text": "[Domenig 1986", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 115, |
| "end": 121, |
| "text": "Fig. 1", |
| "ref_id": "FIGREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "The design of the dedicated DBMS", |
| "sec_num": "4." |
| }, |
| { |
| "text": "\u2022 A linguist interface with which the conceptual schema is defined, i.e. the structure and the consistency rules of the database.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The design of the dedicated DBMS", |
| "sec_num": "4." |
| }, |
| { |
| "text": "\u2022 A lexicographer interface for the editing of entries.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 A process interface for the real-time questionanswering service in the message-switching environment.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "From the point of view of the software-design, the most complex part of this conception is the linguist interface with the DDL and its compiler. All the other parts of the system depend very much on it because of its farreaching dedication. We will therefore concentrate on the linguist interface and the DDL in this paper. The principal guidelines for their definition have been the following:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "\u00b0 The syntax of the DDL should be intelligible for linguists.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 The linguist interface should be interactive and give some leeway for experiments in order to test different morphological strategies. If the linguist wants to define the conceptual schema of the Danish dictionary he selects -with a mouse -the according string on the screen, whereupon a second window is pasted on top of the existing one: Identically to the top-level window, this window is unalterable, i.e. all the dictionary schemas consist of four different definition parts, an alphabet-, a type-, a grammar-and a structure-definition (the structuredefinition is represented by the keyword root). If the linguist wants to edit one of the definition parts, he again selects the according string: In contrast to the two top-levels, this window can be edited. We will not go into the function or the syntax of the alphabet-definition as both are quite trivial. As might be inferred from the name, this is the place where character sets and the like are defined (because the system discerns a lexical and a surface level, some metacharacters denoting morphological classes etc., the character set is not quite as trivial as might be imagined at first glance). If something is entered into this window, the according string in the window above appears henceforth with an icon (1:3) behind it: In a similar fashion the other three definition parts of the conceptual schema can be defined: The type definition comprises name-and domain-specifications of all but the string-typed features allowed in the database. We will not go into its syntax here either.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "The grammar definition contains morphonological rules which mediate between the lexical and the surface level. We have adapted their concept from Koskenniemi ([Koskenniemi 1983 ), whose formalism has been widely acknowledged by now, especially in the US (at SRI [Shieber 1984] , University of Texas [Karttunen 1983 The structure definition is at least syntactically the most complex part of the conceptual schema. It contains an arbitrary number of hierarchical levels which define a collection of so called lexical unit classes (luclasses) on the one hand, irregular entries (luentries) on the other. The fundamental ideas behind it are:", |
| "cite_spans": [ |
| { |
| "start": 146, |
| "end": 176, |
| "text": "Koskenniemi ([Koskenniemi 1983", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 262, |
| "end": 276, |
| "text": "[Shieber 1984]", |
| "ref_id": null |
| }, |
| { |
| "start": 299, |
| "end": 314, |
| "text": "[Karttunen 1983", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 Entries which obey the same morphological rules should be grouped into classes so that those rules have to be specified only once.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "\u2022 Entries which are too irregular to fit into such a class should be defined as irregular. The boundary between regularity/irregularity should be defined by the database manager (linguist) and hence be unalterable by lexicographers. Irregular entries are therefore defined in the conceptual schema (the interactivity of the interface, the powerful editing functions and the incremental compilation provide for the feasibility of this approach).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "The consequence of this approach is that the structure definition consists of a set of luclass-definitions on the one hand, a set of luentry-definitions on the other. In order to facilitate the management of the members of these sets, they are organized in a hierarchical structure, whereas the criteria for the hierarchy are some of the features which qualify the sets. Syntactically, this looks e.g. as follows: Apart from the strings transL7 and gcaseC?, the meaning of it should again be quite obvious. In prose we might summarize it as follows: All entries of this class m'e nouns of a certain subclass -the features Cat:N .... denoting this qualification are specified on the path from the root to this leaf -and within this subclass a zero-morpheme attached to the stem is interpreted as one of the following alternatives of feature sets: An 's'-morpheme attached to the stem is interpreted as {Case:GEN, NUMBER:SG}, an 'n'..morpheme as {Case:AKK, Nl,mber:PL}. The string Fenster acts in tiffs definition mainly as an illustrative example, i.e. it has no conceptual function and may be replaced by all nounstems belonging to this class. Conceptually speaking, the definition therefore specifies all the inflectional fmxns of this noun class. The consequence of this is that lexicographers have to enter only the stems of words, the inflections are defined in the system. Together with some additional language constructs, the regularitics of morphology can thus be quite thoroughly grasped. The additional constructs are: o a fommlism with approximately the power of a context-free grammm' for compounding and deriwltion which allows the combination of different luclasses and luentries.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "root", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "o a formalism for the specification of stem-alterations (e.g. German Umlaut).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "92", |
| "sec_num": null |
| }, |
| { |
| "text": "The impml:ant difference of this approach compared to other systems is the definition of morphological phenomena in the conceptual schema of the DBMS itself. This conceptual schema can be easily compiled into a redundancy-optimized internal schema. This in turn provides for two things: first for an efficient realtime access to the lexical units etc., second for very comfortable monitor-and manipulation-functions for the linguist interface. For example, it is trivial to implement functions which generate all forms which are associated with certain features or combinations thereof. It is equally easy to test the impact of complex rules, be they grammar-rules of the Koskenniemi-style or difficult to handle compounding roles (implemented by the fommlism which is similar to a context4ree grammar), q%e most intriguing quality of the internal schema, however, is probably that it enables the database manager (linguist) to alter the morphological strategies dynamically, i.e. to experiment with them. This is possible, because the system always knows which syntactico-semantic features and which morphological rules have to be associated with the different classes of entries; whenever those associations --you could also call them consistency rules -are altered, the system can determine whether the entries belonging to the according classes lose or gain information, whether the alteration is legal etc.. We do not want to go further into those consistency problems as we haw; not really explained them in this summary. We would like to stress, however, that we consider their integration in the DBMS a major' advantage and necessity as they autonomize the whole system. Apart from the possibilities for experiments they facilitate tim integration of existing machine-readable dictionaries, again, because the system always knows which kind of inRmnation is distinctive and which is mandatory for which class of entries.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Coilclusioh", |
| "sec_num": "50" |
| }, |
| { |
| "text": "Summarising we could say that the kind of morphology supported by the DBMS is rather a traditional one, i.e. the biggest eftort has been spent on truly regular phenomena like inflection. For compounding and derivation the offered choice is either a full implementation (-->redundancy) or the rather dangerous \u2022 -potentially overgenerating -. formalism resembling a context-free grammar. It has to be stressed that we conceive this system as a prototype which will probably be subject to some alterations in tim ft, ture. q he proposed software-design is accordingly tuned, i.e. it relies on the availability of powerful software tools (EMACS, LEX, YACC, LISP etc.) nmning in a UNIXenvironment.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Coilclusioh", |
| "sec_num": "50" |
| }, |
| { |
| "text": ". ISSCO stands for 'Institut dalle Molle pour des Etudes Semantiques et Cognitives'.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Machine-Readable Dictionaries", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [ |
| "A" |
| ], |
| "last": "Amsler", |
| "suffix": "" |
| } |
| ], |
| "year": 1984, |
| "venue": "Annual Review of Information Science and Technology (ARIST)", |
| "volume": "19", |
| "issue": "", |
| "pages": "161--209", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Amsler R.A.: \"Machine-Readable Dictionaries.\" Annual Review of Information Science and Technology (ARIST), Vol. 19, 1984, 161-209.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "ANSI/X3/SPARC Study Group on Data Base Management Systems", |
| "authors": [], |
| "year": 1975, |
| "venue": "", |
| "volume": "7", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "ANSI/X3/SPARC Study Group on Data Base Management Systems: \"Interim Report 75-02- 08.\" FDT (Bull. of the ACM SIGMOD) 7, 1975.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Survey of Lexicographic Projects. Istituto di Linguistica Computazionale", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Cignoni", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Cignoni L., et al. eds: Survey of Lexicographic Projects. Istituto di Linguistica Computazionale, Pisa, Italy, 1983.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Entwurf eines dedizierten Datenbanksystems fiir Lexika. Doctoral thesis at the University of Zfirich", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Domenig", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Domenig M.: Entwurf eines dedizierten Datenbank- systems fiir Lexika. Doctoral thesis at the University of Zfirich. in print.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Maschinenlesbare deutsche W6rterbiicher. Niemeyer, Tfibingen", |
| "authors": [ |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Hess", |
| "suffix": "" |
| }, |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Brustkern", |
| "suffix": "" |
| }, |
| { |
| "first": "W", |
| "middle": [], |
| "last": "Lenders", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Hess K., Brustkern J., Lenders W.: Maschinenlesbare deutsche W6rterbiicher. Niemeyer, Tfibingen, 1983.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Matters of Morphology. EUROTRA Morphology Legislation, Second Draft. Internal EUROTRA paper", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Jaspaert", |
| "suffix": "" |
| } |
| ], |
| "year": 1984, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jaspaert L.: Matters of Morphology. EUROTRA Morphology Legislation, Second Draft. Internal EUROTRA paper, Nov. 1984.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "KIMMO: A Two Level Morphological Analyzer", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Karttunen", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "Texas Linguistic Forum", |
| "volume": "22", |
| "issue": "", |
| "pages": "165--186", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Karttunen L.: \"KIMMO: A Two Level Morphological Analyzer.\" Texas Linguistic Forum 22, 1983, 165-186.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Two-Level Morphology: A General Computational Model for Word-Form Recognition and Production. Doctoral thesis at the University of Helsinki, Department of General Linguistics", |
| "authors": [ |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Koskenniemi", |
| "suffix": "" |
| } |
| ], |
| "year": 1983, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Koskenniemi K.: Two-Level Morphology: A General Computational Model for Word-Form Recognition and Production. Doctoral thesis at the University of Helsinki, Department of General Linguistics, Publications No. 11, 1983.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "A General Model for Word-Form Recognition and Production", |
| "authors": [ |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Koskenniemi", |
| "suffix": "" |
| } |
| ], |
| "year": 1984, |
| "venue": "Proceedings: lOth International Conference on Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Koskenniemi K.: \"A General Model for Word-Form Recognition and Production.\" in Proceedings: lOth International Conference on Computational Linguistics, Stanford Univ., Calif., July 2-6, 1984.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "num": null, |
| "type_str": "figure", |
| "text": "The DBS according to the ANSI/SPARC 3-Schema-Model3. The inadequacy of general purpose DBMS", |
| "uris": null |
| }, |
| "FIGREF3": { |
| "num": null, |
| "type_str": "figure", |
| "text": "{Ca~:NOM, Number:SG}l {Case:NOM, Number:PL} [ {Ca~:DAT, Number:SG} I {Ca~:GEN, Number:PL} [ {Case:AKK, Number:SG} I {Cas~:AKK, Number:]PL} ]", |
| "uris": null |
| }, |
| "TABREF0": { |
| "type_str": "table", |
| "content": "<table><tr><td>schema</td></tr><tr><td>Dani,~h</td></tr><tr><td>Dutch</td></tr><tr><td>English</td></tr><tr><td>French</td></tr><tr><td>German</td></tr><tr><td>Greek</td></tr><tr><td>Italian</td></tr></table>", |
| "text": "The proposed solution foresees the implementation of the system on a high-performance workstation. It includes multiple window technology with pop-up menus for monitor-and manipulation functions as well as incremental compilation. Some brief examples: q-he top-level window of the interface looks as follows (if we assume that we have seven dictionaries):", |
| "html": null, |
| "num": null |
| }, |
| "TABREF3": { |
| "type_str": "table", |
| "content": "<table><tr><td>luc|a,,~;</td><td/><td/><td/></tr><tr><td>trans LI</td><td>dcl []</td><td/><td/></tr><tr><td>geese I~J</td><td colspan=\"2\">gcase []</td><td/></tr><tr><td/><td>dcase</td><td/><td/></tr><tr><td>li~e~ltltea '</td><td>+[ {Case:NON1, Number:SG} I</td><td>[{Cat:N,</td><td>node 13} I</td></tr><tr><td/><td>{Cnse:NOM, Number:PL} I</td><td>{Cat:V,</td><td>node 13} I</td></tr><tr><td/><td>{Ca.~e:DAT, Number:SG} [</td><td>{Cat:ADJ,</td><td>node 13}</td></tr><tr><td/><td>{Case:GEN, Number:PL} I</td><td>{Cat:ADV,</td><td>node 13}</td></tr><tr><td/><td>{Case:AKK, Number:SG} [</td><td>{Cat:AUX,</td><td>node \u2022}</td></tr><tr><td/><td>{Case:AKK, Nmnber:lq~}</td><td>{Cat:DET,</td><td>node \u2022}</td></tr><tr><td/><td/><td>{Cat:PRO,</td><td>node U}</td></tr><tr><td>+a</td><td>+ {Cuse:GFN, NUMBER:SG}</td><td>{Cat:PRE,</td><td>node []) I</td></tr><tr><td/><td/><td>{Cat:CON,</td><td>node \u2022} I</td></tr><tr><td>+~l</td><td>+ {Case:DAT, NUMBEII:PL}</td><td>{Cat:INT,</td><td>node []}]</td></tr><tr><td>end luclass</td><td colspan=\"2\">end dcase</td><td/></tr><tr><td/><td>end root</td><td/><td/></tr><tr><td/><td>root</td><td/><td/></tr><tr><td/><td>dcl []</td><td/><td/></tr><tr><td/><td colspan=\"2\">gcase []</td><td/></tr><tr><td/><td colspan=\"2\">dcase</td><td/></tr><tr><td/><td/><td>[{Cat:N,</td><td>node t3} I</td></tr><tr><td/><td/><td>{Cat:V,</td><td>node</td></tr><tr><td/><td/><td>{Cat:ADJ,</td><td>dcl []</td></tr><tr><td/><td/><td>{Cat:ADV,</td><td>gcase []</td></tr><tr><td/><td/><td>{Cat:AUX,</td><td>dcase</td></tr><tr><td/><td/><td>{Cat:DET,</td><td>[{VCat:REG, node \u2022} [</td></tr><tr><td/><td/><td>{Cat:PRO,</td><td>{VCat:IRREG, node []}]</td></tr><tr><td/><td/><td>{Cat:PRE,</td><td>end dcase</td></tr><tr><td/><td/><td>{Cat:CON,</td><td>end node</td></tr><tr><td/><td/><td colspan=\"2\">{Cat:INT, node D}]</td></tr><tr><td/><td colspan=\"2\">end dcase</td><td/></tr><tr><td/><td>end root</td><td/><td/></tr><tr><td/><td colspan=\"3\">In the leaves of this tree the keyword node is</td></tr><tr><td/><td colspan=\"3\">replaced by either luclass or luentry. Their syntax is</td></tr><tr><td/><td colspan=\"3\">almost identical, so let us just give an example of an</td></tr><tr><td/><td colspan=\"2\">luelass-definition:</td><td/></tr></table>", |
| "text": "This window defines one hierarchical level (the top) of the organization of the luclasses and luentries respectively. The meaning of it should be quite obvious if we leave out del [] and gease [] and concentrate on the case-distinction enclosed in the square brackets: The features Cat:N, Cat:V,.. are defined to be distinctive for certain subsets out of the collection of luclasses and luentries. Note that the names of the attributes and values are entirely arbitrary (they must be defined in the type-definition, of course). Subordinate levels of the definition are again abstracted by icons (node U), i.e. they are defined and viewed in separate windows:", |
| "html": null, |
| "num": null |
| } |
| } |
| } |
| } |
