Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "C00-1008",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:30:58.018682Z"
},
"title": "Incremental Identification of Inflectional Types",
"authors": [
{
"first": "Petra",
"middle": [],
"last": "Barg",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Seminar f\u00fcr Allgemeine Sprachwissenschaft",
"location": {
"addrLine": "Universit\u00e4tsstr. 1",
"postCode": "D-40225",
"settlement": "D\u00fcsseldorf",
"country": "Germany"
}
},
"email": "[email protected]"
},
{
"first": "James",
"middle": [],
"last": "Kilbury",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Seminar f\u00fcr Allgemeine Sprachwissenschaft",
"location": {
"addrLine": "Universit\u00e4tsstr. 1",
"postCode": "D-40225",
"settlement": "D\u00fcsseldorf",
"country": "Germany"
}
},
"email": "[email protected]"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We present an approach to the incremental accrual of lexical information for unknown words that is constraint-based and compatible with standard unification-based grammars. Although the techniques are language-independent and can be applied to all kinds of information, in this paper we concentrate on the domain of German noun inflection. We show how morphological information, especially inflectional class, is successfully acquired using a typebased HPSG-like analysis. Furthermore, we sketch an alternative strategy which makes use of finitestate transducers.",
"pdf_parse": {
"paper_id": "C00-1008",
"_pdf_hash": "",
"abstract": [
{
"text": "We present an approach to the incremental accrual of lexical information for unknown words that is constraint-based and compatible with standard unification-based grammars. Although the techniques are language-independent and can be applied to all kinds of information, in this paper we concentrate on the domain of German noun inflection. We show how morphological information, especially inflectional class, is successfully acquired using a typebased HPSG-like analysis. Furthermore, we sketch an alternative strategy which makes use of finitestate transducers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Systems for natural language processing must deal adequately with \"unknown\" words, i.e. lexemes that either have been newly coined or else have not been included in a particular lexicon (cf. Kilbury et al. (1994) ). Rather than simply regarding unknown words as noise, our system instead uses their context as a source for the systematic accrual of lexical information that can then be utilized.",
"cite_spans": [
{
"start": 191,
"end": 212,
"text": "Kilbury et al. (1994)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our approach differs in significant respects from those of other investigators. It is designed for unification-based grammar formalisms with typed feature stuctures as in HPSG and is not restricted to simple morphosyntactic features. In contrast to statistical approaches like that of (Brent, 1991) , which often do not work incrementally and are intended for the application to large corpora, ours instead aims at a detailed grammatical analysis of individual sentences with a maximal use of their information. While systems like that of (Hahn et al., 1996) deal with the general acquisition of concepts, we are concerned exclusively with the acquisition of structural linguistic information.",
"cite_spans": [
{
"start": 285,
"end": 298,
"text": "(Brent, 1991)",
"ref_id": "BIBREF2"
},
{
"start": 539,
"end": 558,
"text": "(Hahn et al., 1996)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Although we deal here with German noun inflection, in a framework close to that of (Riehemann, 1998) and (Koenig, 1999) , the techniques are language-independent and apply to other kinds of lexical information as well, as is shown in with respect to valency information. Thus, in contrast to (Ehrlich and Rapaport, 1997) , who employ tailored algorithms for the acquisition of information about nouns and verbs, we introduce an approach that is completely general with respect to the kind of structural linguistic information acquired.",
"cite_spans": [
{
"start": 83,
"end": 100,
"text": "(Riehemann, 1998)",
"ref_id": "BIBREF17"
},
{
"start": 105,
"end": 119,
"text": "(Koenig, 1999)",
"ref_id": "BIBREF12"
},
{
"start": 292,
"end": 320,
"text": "(Ehrlich and Rapaport, 1997)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "There is a vast literature on German noun inflection represented in recent studies by (Cahill and Gazdar, 1999) , (Clahsen, 1999) , and (Neef, 1998) . Here we summarize only essential points and ignore highly irregular and archaic inflections (cf. figure 4 below).",
"cite_spans": [
{
"start": 86,
"end": 111,
"text": "(Cahill and Gazdar, 1999)",
"ref_id": "BIBREF3"
},
{
"start": 114,
"end": 129,
"text": "(Clahsen, 1999)",
"ref_id": "BIBREF5"
},
{
"start": 136,
"end": 148,
"text": "(Neef, 1998)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "German noun-inflection classes",
"sec_num": "2"
},
{
"text": "German nouns bear gender (masculine, feminine, neuter) and are inflected for number (singular, plural) and case (nominative, accusative, dative, genitive). With the exception of class NWN (e.g. masc Bauer 'farmer', with gen sg Bauern), all nonfeminine nouns build genitive singular with -s.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "German noun-inflection classes",
"sec_num": "2"
},
{
"text": "The \"regular\" (cf. Clahsen (1999) ) but \"atypical\" (cf. Wunderlich (1999) ) nouns of class NA (e.g. Auto 'car') build their plural forms in -s. The plural forms of all other (i.e. \"typical\") classes must end in a so-called schwa syllable -e, -el, -er, or -en (i.e. phonetically an unstressed [ ] followed by a sonorant from [l r n]).",
"cite_spans": [
{
"start": 19,
"end": 33,
"text": "Clahsen (1999)",
"ref_id": "BIBREF5"
},
{
"start": 56,
"end": 73,
"text": "Wunderlich (1999)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "German noun-inflection classes",
"sec_num": "2"
},
{
"text": "Strong nouns add -e for plural in class NS (e.g. Arm 'arm', pl Arme) and class NU (e.g. Arzt 'physician', pl\u00c4rzte) if the stem itself does not already end in a schwa syllable (e.g. Kabel 'cable', pl Kabel). Class NU furthermore umlauts the stem (i.e. replaces a, o, u, au with\u00e4,\u00f6,\u00fc,\u00e4u, respectively), as does class NR (e.g. Mann 'man', pl M\u00e4nner), which adds -er.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "German noun-inflection classes",
"sec_num": "2"
},
{
"text": "The remaining classes (NM, NWN, and NWS) form their plural in -n (e.g. Schraube 'screw', pl Schrauben). The nonnominative singular stem in class NWN (e.g. Hase 'hare', gen sg Hasen) and class NWS (e.g. Glaube 'belief', gen sg Glaubens) is identical with the plural form, while NWN exceptionally adds no -s in genitive singular.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "German noun-inflection classes",
"sec_num": "2"
},
{
"text": "All classes except NA build dative plural by adding -n to the plural form if it is not already present (e.g. M\u00e4nner 'men', dat pl M\u00e4nnern but Hasen 'hares', dat pl Hasen). ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "German noun-inflection classes",
"sec_num": "2"
},
{
"text": "Various proposals have been made for the representation of inflectional morphology within constraintbased frameworks like HPSG (cf. Pollard (1994) ).",
"cite_spans": [
{
"start": 132,
"end": 146,
"text": "Pollard (1994)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Representation of inflectional morphology",
"sec_num": "3"
},
{
"text": "We neither adopt a word-syntax approach like that of (Krieger and Nerbonne, 1993) assuming lexical entries for inflectional affixes as well as roots, nor do we make use of lexical rules, as (Meurers and Minnen, 1997) do. Instead, we follow (Riehemann, 1998) in formulating hierarchically structured schemata of the kind she has developed for derivational morphology but apply them here to inflection and thus carry out a kind of inflectional analysis without lexical rules as projected by (Erjavec, 1996) . Our schemata capture inflectional paradigms and can be regarded as relational constraints that relate stems, affixes, and inflected lexical forms. Figure 1 shows our hierarchy of inflectional schemata, while figure 2 illustrates a concrete schema, namely that for the schwa plural of inflectional class NS. In figure 2 the attribute ftype stands for the inflectional class. The attributes flex, surf, and base represent strings, namely the inflectional ending, surface (i.e. inflected) form, and base form respectively. The symbol @ denotes the reduced vowel [ ] (schwa), and\u02dcdesignates negated values.",
"cite_spans": [
{
"start": 190,
"end": 216,
"text": "(Meurers and Minnen, 1997)",
"ref_id": "BIBREF14"
},
{
"start": 240,
"end": 257,
"text": "(Riehemann, 1998)",
"ref_id": "BIBREF17"
},
{
"start": 489,
"end": 504,
"text": "(Erjavec, 1996)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 654,
"end": 662,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Representation of inflectional morphology",
"sec_num": "3"
},
{
"text": "Lexical entries are assumed only for basic lexical signs (i.e. uninflected but possibly derived or compounded). Inflected lexical signs result from the interaction of these lexical entries and the inflectional schemata. Figure 3 gives the basic lexical sign (with the omission of feature specifications that are irrelevant for this discussion) for Hund 'dog', which is of class NS, followed by the inflected lexical sign for Hunde 'dogs', in which the value of the attribute moph (i.e. morphophonology) is an extension of the schema for schwa plural given in figure 2.",
"cite_spans": [],
"ref_spans": [
{
"start": 220,
"end": 228,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Representation of inflectional morphology",
"sec_num": "3"
},
{
"text": "The inflectional classes assigned to basic lexical signs are modelled as formal types in the hierarchical structure specified in figure 4. Note that the leaves of this tree correspond exactly to the inflectional classes of German nouns as described above in \u00a72.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Representation of inflectional morphology",
"sec_num": "3"
},
{
"text": "Morphophonemic and morphographemic alterna-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Representation of inflectional morphology",
"sec_num": "3"
},
{
"text": "Figure 2: schema for schwa-plural (schwa pl sort) \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 schwa pl ftype ns flex @ surf atom base atom stem basic ls moph basic agr \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 agr case \uf8ee \uf8f0 case avm ctxt\u02dcdat gen top \uf8f9 \uf8fb num plu gend\u02dcfem pers pers \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Representation of inflectional morphology",
"sec_num": "3"
},
{
"text": "tions as shown in nominative plural Zeit-en 'times' but Gabel-n 'forks' are also covered in our description. Here the realisation of the plural ending -n depends on the shape of the noun stem (namely, whether or not it ends in a schwa syllable). In agreement with (Bird and Klein, 1994) and (Erjavec, 1996) , we capture such alternations declaratively in a one-level model without recourse to transducers. Our treatment of umlaut adopts part of the techniques of (Trost, 1993) .",
"cite_spans": [
{
"start": 264,
"end": 286,
"text": "(Bird and Klein, 1994)",
"ref_id": "BIBREF1"
},
{
"start": 291,
"end": 306,
"text": "(Erjavec, 1996)",
"ref_id": "BIBREF9"
},
{
"start": 463,
"end": 476,
"text": "(Trost, 1993)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Representation of inflectional morphology",
"sec_num": "3"
},
{
"text": "In our approach linguistic properties of unknown words are inferred from their sentential context as a byproduct of parsing. After parsing, which requires only a slight modification of standard lexical lookup, lexical entries are appropriately updated. One of our key ideas is a gradual, information-based concept of \"unknownness\", where lexical entries are not unknown as a whole, but may contain unknown, i.e. potentially revisable, pieces of information (cf. ). This allows a uniform treatment for the full range of lexical entries from completely known to maximally unknown. As discussed in , our system has been implemented in MicroCUF, a derivative of the formalism CUF of (D\u00f6rre and Dorna, 1993) . ",
"cite_spans": [
{
"start": 679,
"end": 702,
"text": "(D\u00f6rre and Dorna, 1993)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Processing unknown words",
"sec_num": "4"
},
{
"text": "\uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb synsem ... \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 inflected ls moph \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 schwa pl ftype 1 ns flex @ surf hunde base 2 hund agr \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 agr case \uf8ee \uf8f0 case avm ctxt\u02dcdat gen case \uf8f9 \uf8fb num plu gend 3 masc pers 4 third \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb stem \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ls moph \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ftype 1 surf 2 base 2 agr \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 agr case \uf8ee \uf8f0 case avm ctxt\u02dcgen gen case \uf8f9 \uf8fb num sing gend 3 pers 4 \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb synsem 5 \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb synsem 5 ... \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Processing unknown words",
"sec_num": "4"
},
{
"text": "Revisable information is further classified as specializable or generalizable, where the former can only become more special, and the latter only more general, with further contexts. Specializable kinds of information include semantic type of nouns, gender, and inflectional class. Among the generalizable kinds of information are the selectional restrictions of verbs and adjectives as well as the case of nouns. Both kinds of information together with nonrevis-able (i.e. strict) information can cooccur in a single entry.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Processing unknown words",
"sec_num": "4"
},
{
"text": "The overall approach is compatible with standard constraint-based analyses and makes only a few extra demands on the grammar. Here the revisable information must be explicitly marked as such. Since our model is situated within the framework of typed feature-based formalisms (cf. Carpenter (1992) ), revisable information is expressed in terms of formal types. The initial values for revisable information are specified with two distinguished types u s and u g for specializable and generalizable information, respectively. Type unification can be employed for the combination of specializable information, whereas generalizable information requires type union.",
"cite_spans": [
{
"start": 280,
"end": 296,
"text": "Carpenter (1992)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Processing unknown words",
"sec_num": "4"
},
{
"text": "The direct combination of revisable information during parsing is unfeasible for various reasons discussed in . It consequently is carried out in a separate step after the current sentence has been parsed. The grammatical analysis itself thus remains completely declarative and only makes use of unification. In order to achieve this separation of analysis and revision we introduce two attributes for generalizable information, namely gen and ctxt, where ctxt receives the information inferred from the sentential context, and gen the potentially revisable information with the initial value u g.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Processing unknown words",
"sec_num": "4"
},
{
"text": "Parsing thus proceeds in an entirely conventional manner, except that lexical look-up for a word with unknown orthography or phonology does not fail but instead yields an underspecified canonical lexical entry. The updating after parsing compares the feature structure of the original lexical entry with that inferred contextually. The specializable information of the former is replaced with the corresponding values of the latter. Moreover, using the attributes gen and ctxt introduced above, the new gen value for generalizable information is computed by the type union of the gen value from the old lexical entry (initialy u g) with the ctxt value resulting from the parse. Actual revision naturally is only carried out when a context in fact provides new information.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Processing unknown words",
"sec_num": "4"
},
{
"text": "In order to process unknown word forms, we postulate canonical lexical entries which are returned by lexical lookup if a word is not recorded in the lexicon. For nouns, this entry corresponds to an underspecified basic lexical sign in which the inflectional class, case, number, and gender are specified with revisable types, i.e. the information can be acquired and updated. Figure 5 shows the basic lexical sign for German nouns (with the omission of feature specifications that are irrelevant for this discussion). Whereas inflectional class (ftype), number (num), and gender (gend) are specializable, case is generalizable and hence contains the features gen and ctxt.",
"cite_spans": [],
"ref_spans": [
{
"start": 376,
"end": 384,
"text": "Figure 5",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "Note that the initial values for specializable information consist of a disjunction (;) of the value u s and the most general appropriate value for the corresponding feature. This ensures the identification of specializable information (via u s) on the one hand, and the correct specializations on the other. When a sentence containing an unknown noun is parsed, information about the noun comes from different sources: while the surrounding context may supply agreement information, the word form itself together with morphophonological constraints may restrict the possible inflectional class.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "As an example we can suppose that the rather infrequent noun Sund 'sound', 'strait', which like Hund 'dog' belongs to class NS but is unfamiliar to many German speakers, is not recorded in a given lexicon. The class NS contains both masculine and neuter nouns, and these differ in none of their inflected forms. Thus, only agreement information from a context, such as der enge Sund 'the narrow strait' (nominative), can establish the gender of Sund as being masculine. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "\uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ls moph \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ftype (noun flex;u s) surf 1 atom base 1 agr \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 agr case \uf8ee \uf8f0 case avm ctxt case gen u g \uf8f9 \uf8fb num (num;u s) gend (gend;u s) pers third \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb synsem ... \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "Even in isolation, the form Sund must be singu-lar since its final shape is not compatible with any plural inflection (i.e. it ends neither in -s nor in a schwa syllable). Moreover, the morphophonological constraints on stems allow only three possibilities: Sund is",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "\u2022 feminine (and then the class is NA, NU, or NM and the case is underspecified) \u2022 nonfeminine and weak (i.e. class NWN or NWS) (and then the case must be nominative) \u2022 nonfeminine and nonweak (and then the case is not genitive)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "These hypotheses are captured in the three feature structures depicted in figure 6. As we have seen, when a word is parsed in context, this provides additional information. If we know, for example, that Sund is masculine, the first hypothesis is excluded, and the gender specification of the remaining two hypotheses can be specialized to masc. If we additionally encounter Sund in dative singular, which is impossible for weak nouns (which must have a final -n), then only the third hypothesis remains. Finally, if the plural form Sunde occurs the system can specialize the inflectional class exactly to the type NS. The other morphological information cannot be further generalized or specialized, and we have the final lexical entry for Sund.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "Things are not always this easy. In particular, there may be a number of alternatives both for the segmentation of a form into a stem and an inflectional ending and for the assignment of a stem to a lexeme. Moreover, these alternatives may depend on each other. Thus, the form Leinen may be assigned to any of the lexemes Lein 'flax' (masc, NS), Leine 'rope' (fem, NM), or Leinen 'linen' (neut, NS); even in a context, e.g. Fritz verkauft Leinen 'Fritz sells ropes/linen', it may be impossible to disambiguate the form. While the nouns Band 'book volume' (masc, NU), Band 'strip' (neut, NR), Band 'bond' (neut, NS, archaic and rare in singular), Band 'music band' (fem, NA), and Bande 'gang' (fem, NM) may be unlikely to occur all in the same context, they illustrate the dimension of the problems of segmentation and lexical assignment, which in turn con- ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "\uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb synsem ... \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ls moph \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ftype (nw;u s) surf 1 sund base 1 agr \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 agr case \uf8ee \uf8f0 case avm ctxt case gen (nom;u g) \uf8f9 \uf8fb num (sing;u s) gend (\u02dcfem;u s) pers third \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb synsem ... \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ls moph \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 basic ftype (\u02dcnw;u s) surf 1 sund base 1 agr \uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 agr case \uf8ee \uf8f0 case avm ctxt case gen (\u02dcgen;u g) \uf8f9 \uf8fb num (sing;u s) gend (\u02dcfem;u s) pers third \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb synsem ... \uf8f9 \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fa \uf8fb",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "stitute part of the more general problem of disambiguation in natural language processing. We have no magic solution for the latter, but in our approach such examples must be handled with disjunctive representations until the context provides the necessary disambiguating information. 6 An alternative model using finite-state techniques Alternatively, the incremental identification of inflectional types can be modelled within the framework of finite-state automata (cf. Sproat (1992) ) without recourse to unification-based grammar formalisms. A FSA can be defined that has an alphabet consisting of vectors specifying the stem shape and ending (and thus the segmentation) as well as the agreement information of possible word forms. Starting in an initial state corresponding to the constraints that apply to all unknown words, the FSA is moved by successive forms of an unknown lexeme together with their agreement information into successor states that capture the incrementally accrued inflectional information. The FSA may reach a final state, in which case the inflectional class has been uniquely identified, or it may remain in a nonfinal state. A lexicon would simply record the latest state reached for each noun. Implementation of this model is greatly complicated by the problems of disambiguation just discussed in \u00a75. In general, the states of the FSA must capture disjunctions not only of inflectional classes, but also of segmentation and gender alternatives. The application of automatic induction techniques to corpora appears to be essential, and we are currently pursuing possibilities for this.",
"cite_spans": [
{
"start": 473,
"end": 486,
"text": "Sproat (1992)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Incremental inference of inflectional information",
"sec_num": "5"
},
{
"text": "We have taken the inflection of German nouns to illustrate a general type-based approach to handling unknown words and the incremental accrual of their lexical information. The techniques can be applied not only to other classes of inflected words and to other languages, but also to other aspects of lexical information such as the valency of verbs. This may allow practical systems for natural language processing to be enhanced so as to utilize input information that otherwise is discarded as noise.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Processing unknown words in HPSG",
"authors": [
{
"first": "Petra",
"middle": [],
"last": "Barg",
"suffix": ""
},
{
"first": "Markus",
"middle": [],
"last": "Walther",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of COLING-ACL'98",
"volume": "",
"issue": "",
"pages": "91--95",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Petra Barg and Markus Walther. 1998. Process- ing unknown words in HPSG. In Proceedings of COLING-ACL'98, pages 91-95, Montreal.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Phonological analysis in typed feature systems",
"authors": [
{
"first": "Steven",
"middle": [],
"last": "Bird",
"suffix": ""
},
{
"first": "Ewan",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 1994,
"venue": "Computational Linguistics",
"volume": "20",
"issue": "",
"pages": "455--491",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steven Bird and Ewan Klein. 1994. Phonological analysis in typed feature systems. Computational Linguistics, 20:455-491.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Automatic acquisition of subcategorization frames from untagged text",
"authors": [
{
"first": "R",
"middle": [],
"last": "Michael",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Brent",
"suffix": ""
}
],
"year": 1991,
"venue": "Proceedings of 29th ACL",
"volume": "",
"issue": "",
"pages": "209--214",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael R. Brent. 1991. Automatic acquisition of subcategorization frames from untagged text. In Proceedings of 29th ACL, pages 209-214, Berkeley.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "German noun inflection",
"authors": [
{
"first": "Lynne",
"middle": [],
"last": "Cahill",
"suffix": ""
},
{
"first": "Gerald",
"middle": [],
"last": "Gazdar",
"suffix": ""
}
],
"year": 1999,
"venue": "Journal of Linguistics",
"volume": "35",
"issue": "",
"pages": "1--42",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lynne Cahill and Gerald Gazdar. 1999. German noun inflection. Journal of Linguistics, 35:1-42.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "The Logic of Typed Feature Structures",
"authors": [
{
"first": "Robert",
"middle": [],
"last": "Carpenter",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert Carpenter. 1992. The Logic of Typed Feature Structures. Cambridge University Press.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Lexical entries and rules of language: A multidisciplinary study of German inflection",
"authors": [
{
"first": "Harald",
"middle": [],
"last": "Clahsen",
"suffix": ""
}
],
"year": 1999,
"venue": "Behavioral and Brain Sciences",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harald Clahsen. 1999. Lexical entries and rules of language: A multidisciplinary study of German inflection. Behavioral and Brain Sciences.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Computational Aspects of Constraint-Based Linguistic Description",
"authors": [
{
"first": "Jochen",
"middle": [],
"last": "D\u00f6rre",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Dorna",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jochen D\u00f6rre and Michael Dorna. 1993. CUF - a formalism for linguistic knowledge representa- tion. In Jochen D\u00f6rre, editor, Computational As- pects of Constraint-Based Linguistic Description.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Deliverable R1.2.A, DYANA-2 -ESPRIT Project 6852",
"authors": [
{
"first": "Universit\u00e4t",
"middle": [],
"last": "Ims",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Stuttgart",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "IMS, Universit\u00e4t Stuttgart. Deliverable R1.2.A, DYANA-2 -ESPRIT Project 6852.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "A computational theory of vocabulary extension",
"authors": [
{
"first": "Karen",
"middle": [],
"last": "Ehrlich",
"suffix": ""
},
{
"first": "William",
"middle": [
"J"
],
"last": "Rapaport",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of the 19th Annual Conference of the Cognitive Science Society",
"volume": "",
"issue": "",
"pages": "205--210",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karen Ehrlich and William J. Rapaport. 1997. A computational theory of vocabulary extension. In Proceedings of the 19th Annual Conference of the Cognitive Science Society, pages 205-210.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Unification, Inheritance and Paradigms in the Morphology of Natural Languages. Unpublished doctoral dissertation",
"authors": [
{
"first": "Toma\u017e",
"middle": [],
"last": "Erjavec",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Toma\u017e Erjavec. 1996. Unification, Inheritance and Paradigms in the Morphology of Natural Lan- guages. Unpublished doctoral dissertation, Uni- versity of Ljubljana.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Learning from texts -a terminological meta-reasoning perspective",
"authors": [
{
"first": "Udo",
"middle": [],
"last": "Hahn",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Klenner",
"suffix": ""
},
{
"first": "Klemens",
"middle": [],
"last": "Schnattinger",
"suffix": ""
}
],
"year": 1996,
"venue": "Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing",
"volume": "",
"issue": "",
"pages": "453--468",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Udo Hahn, Manfred Klenner, and Klemens Schnat- tinger. 1996. Learning from texts -a terminolog- ical meta-reasoning perspective. In S. Wermter, E. Riloff, and G. Scheler, editors, Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing, pages 453-468. Springer, Berlin.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Simulation lexikalischen Erwerbs",
"authors": [
{
"first": "James",
"middle": [],
"last": "Kilbury",
"suffix": ""
},
{
"first": "Petra",
"middle": [],
"last": "Barg",
"suffix": ""
},
{
"first": "Ingrid",
"middle": [],
"last": "Renz",
"suffix": ""
}
],
"year": 1994,
"venue": "Kognitive Linguistik: Repr\u00e4sentation und Prozesse",
"volume": "",
"issue": "",
"pages": "251--271",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "James Kilbury, Petra Barg, and Ingrid Renz. 1994. Simulation lexikalischen Erwerbs. In Sascha Fe- lix, Christopher Habel, and Gerd Rickheit, ed- itors, Kognitive Linguistik: Repr\u00e4sentation und Prozesse, pages 251-271. Westdeutscher Verlag, Opladen.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Lexical Relations",
"authors": [
{
"first": "Jean-Pierre",
"middle": [],
"last": "Koenig",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jean-Pierre Koenig. 1999. Lexical Relations. CSLI Publications.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Feature-based inheritance networks for computational lexicons",
"authors": [
{
"first": "Ulrich",
"middle": [],
"last": "Hans",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Krieger",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Nerbonne",
"suffix": ""
}
],
"year": 1993,
"venue": "editor, Inheritance, Defaults, and the Lexicon",
"volume": "",
"issue": "",
"pages": "90--136",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hans-Ulrich Krieger and John Nerbonne. 1993. Feature-based inheritance networks for computa- tional lexicons. In Ted Briscoe et al., editor, In- heritance, Defaults, and the Lexicon, pages 90- 136. Cambridge University Press, Cambridge.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "A computational treatment of lexical rules in HPSG as covariation in lexical entries",
"authors": [
{
"first": "Detmar",
"middle": [],
"last": "Meurers",
"suffix": ""
},
{
"first": "Guido",
"middle": [],
"last": "Minnen",
"suffix": ""
}
],
"year": 1997,
"venue": "Computational Linguistics",
"volume": "23",
"issue": "",
"pages": "543--568",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Detmar Meurers and Guido Minnen. 1997. A com- putational treatment of lexical rules in HPSG as covariation in lexical entries. Computational Lin- guistics, 23:543-568.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "A case study in declarative morphology: German case inflection",
"authors": [
{
"first": "Martin",
"middle": [],
"last": "Neef",
"suffix": ""
}
],
"year": 1998,
"venue": "Phonology and Morphology of the Germanic Languages",
"volume": "",
"issue": "",
"pages": "219--240",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Martin Neef. 1998. A case study in declarative morphology: German case inflection. In Wolf- gang Kehrein and Richard Wiese, editors, Phonol- ogy and Morphology of the Germanic Languages, pages 219-240. Max Niemeyer Verlag, T\u00fcbingen.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Head-Driven Phrase Structure Grammar",
"authors": [
{
"first": "Carl",
"middle": [],
"last": "Pollard",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Sag",
"suffix": ""
}
],
"year": 1994,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carl Pollard and Ivan Sag. 1994. Head-Driven Phrase Structure Grammar. Chicago University Press.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Type-based derivational morphology",
"authors": [
{
"first": "Susanne",
"middle": [],
"last": "Riehemann",
"suffix": ""
}
],
"year": 1998,
"venue": "Journal of Comparative Germanic Linguistics",
"volume": "2",
"issue": "",
"pages": "49--77",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Susanne Riehemann. 1998. Type-based derivational morphology. Journal of Comparative Germanic Linguistics, 2:49-77.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Morphology and Computation",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Sproat",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Sproat. 1992. Morphology and Computa- tion. MIT Press, Cambridge, Mass.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Coping with derivation in a morphological component",
"authors": [
{
"first": "Harald",
"middle": [],
"last": "Trost",
"suffix": ""
}
],
"year": 1993,
"venue": "Proceedings of 6th EACL",
"volume": "",
"issue": "",
"pages": "368--376",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Harald Trost. 1993. Coping with derivation in a morphological component. In Proceedings of 6th EACL, pages 368-376.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Towards incremental lexical acquisition in HPSG",
"authors": [
{
"first": "Markus",
"middle": [],
"last": "Walther",
"suffix": ""
},
{
"first": "Petra",
"middle": [],
"last": "Barg",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings Joint Conference on Formal Grammar, Head-Driven Phrase Structure Grammar, and Categorial Grammar",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Markus Walther and Petra Barg. 1998. Towards in- cremental lexical acquisition in HPSG. In Pro- ceedings Joint Conference on Formal Grammar, Head-Driven Phrase Structure Grammar, and Categorial Grammar, Saarbr\u00fccken.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "German noun plural reconsidered",
"authors": [
{
"first": "Dieter",
"middle": [],
"last": "Wunderlich",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dieter Wunderlich. 1999. German noun plural re- considered. Manuscript, University of D\u00fcsseldorf.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"type_str": "figure",
"text": "Figure 1: hierarchy of inflectional schemata infl sort",
"uris": null
},
"FIGREF1": {
"num": null,
"type_str": "figure",
"text": "Figure 3: feature structures for Hund and Hunde",
"uris": null
},
"FIGREF2": {
"num": null,
"type_str": "figure",
"text": "Figure 4: hierarchy of inflectional types",
"uris": null
},
"FIGREF3": {
"num": null,
"type_str": "figure",
"text": "feature structure for the underspecified lexical entry",
"uris": null
},
"TABREF0": {
"html": null,
"type_str": "table",
"content": "<table><tr><td>\uf8ee \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0</td><td>basic ls \uf8ee basic moph \uf8ef ftype ns \uf8ef \uf8ef surf 1 hund \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8ef \uf8f0 base 1 agr \uf8ee \uf8ef \uf8ef agr \uf8ee case avm \uf8ef case \uf8f0 ctxt\u02dcgen \uf8f9 \uf8fb \uf8ef \uf8ef gen case \uf8ef \uf8ef num sing \uf8ef \uf8f0 gend masc pers third</td></tr></table>",
"num": null,
"text": "3: feature structures for Hund and Hunde"
}
}
}
}