diff options
| author | aarne <aarne@chalmers.se> | 2009-06-22 15:39:08 +0000 |
|---|---|---|
| committer | aarne <aarne@chalmers.se> | 2009-06-22 15:39:08 +0000 |
| commit | e89fdae2fa1626348d8025824a7469252fa85e42 (patch) | |
| tree | c7d46bbd0494043b4bd6f917a25a7687517d0547 /old-lib/resource/catalan/ParadigmsCat.gf | |
| parent | 3049b59b35b25381a7c6787444165c200d66e08b (diff) | |
next-lib renamed to lib, lib to old-lib
Diffstat (limited to 'old-lib/resource/catalan/ParadigmsCat.gf')
| -rw-r--r-- | old-lib/resource/catalan/ParadigmsCat.gf | 459 |
1 files changed, 459 insertions, 0 deletions
diff --git a/old-lib/resource/catalan/ParadigmsCat.gf b/old-lib/resource/catalan/ParadigmsCat.gf new file mode 100644 index 000000000..4032d94d7 --- /dev/null +++ b/old-lib/resource/catalan/ParadigmsCat.gf @@ -0,0 +1,459 @@ +--# -path=.:../romance:../common:../abstract:../../prelude + +--1 Catalan Lexical Paradigms +-- +-- Aarne Ranta 2004 - 2006 +-- Jordi Saludes 2008: Modified from ParadigmsSpa +-- +-- This is an API for the user of the resource grammar +-- for adding lexical items. It gives functions for forming +-- expressions of open categories: nouns, adjectives, verbs. +-- +-- Closed categories (determiners, pronouns, conjunctions) are +-- accessed through the resource syntax API, $Structural.gf$. +-- +-- The main difference with $MorphoCat.gf$ is that the types +-- referred to are compiled resource grammar types. We have moreover +-- had the design principle of always having existing forms, rather +-- than stems, as string arguments of the paradigms. +-- +-- The structure of functions for each word class $C$ is the following: +-- first we give a handful of patterns that aim to cover all +-- regular cases. Then we give a worst-case function $mkC$, which serves as an +-- escape to construct the most irregular words of type $C$. For +-- verbs, there is a fairly complete list of irregular verbs in +-- [``IrregCat`` ../../catalan/IrregCat.gf]. + +resource ParadigmsCat = + open + (Predef=Predef), + Prelude, + CommonRomance, + ResCat, + MorphoCat, + BeschCat, + CatCat in { + + flags optimize=all ; + +--2 Parameters +-- +-- To abstract over gender names, we define the following identifiers. + +oper + Gender : Type ; + + masculine : Gender ; + feminine : Gender ; + +-- To abstract over number names, we define the following. + + Number : Type ; + + singular : Number ; + plural : Number ; + +-- Prepositions used in many-argument functions are either strings +-- (including the 'accusative' empty string) or strings that +-- amalgamate with the following word (the 'genitive' "de" and the +-- 'dative' "a"). + + accusative : Prep ; + genitive : Prep ; + dative : Prep ; + + mkPrep : Str -> Prep ; + + +--2 Nouns + + mkN : overload { + +-- The regular function takes the singular form and the gender, +-- and computes the plural and the gender by a heuristic. +-- The heuristic says that the gender is feminine for nouns +-- ending with "a" or "z", and masculine for all other words. +-- Nouns ending with "a", "o", "e" have the plural with "s", +-- those ending with "z" have "ces" in plural; all other nouns +-- have "es" as plural ending. The accent is not dealt with. TODO + + mkN : (llum : Str) -> N ; + +-- A different gender can be forced. + + mkN : Str -> Gender -> N ; + +-- The worst case has two forms (singular + plural) and the gender. + + mkN : (disc,discos : Str) -> Gender -> N + } ; + + +--3 Compound nouns +-- +-- Some nouns are ones where the first part is inflected as a noun but +-- the second part is not inflected. e.g. "número de telèfon". +-- They could be formed in syntax, but we give a shortcut here since +-- they are frequent in lexica. + + compN : N -> Str -> N ; + + +--3 Relational nouns +-- +-- Relational nouns ("filla de x") need a case and a preposition. + + mkN2 : N -> Prep -> N2 ; + +-- The most common cases are the genitive "de" and the dative "a", +-- with the empty preposition. + + deN2 : N -> N2 ; + aN2 : N -> N2 ; + +-- Three-place relational nouns ("la connexió de x a y") need two prepositions. + + mkN3 : N -> Prep -> Prep -> N3 ; + + +--3 Relational common noun phrases +-- +-- In some cases, you may want to make a complex $CN$ into a +-- relational noun (e.g. "the old town hall of"). However, $N2$ and +-- $N3$ are purely lexical categories. But you can use the $AdvCN$ +-- and $PrepNP$ constructions to build phrases like this. + +-- +--3 Proper names and noun phrases +-- +-- Proper names need a string and a gender. +-- The default gender is feminine for names ending with "a", otherwise masculine. TODO + + mkPN : overload { + mkPN : (Anna : Str) -> PN ; + mkPN : (Pilar : Str) -> Gender -> PN + } ; + + +--2 Adjectives + + mkA : overload { + +-- For regular adjectives, all forms are derived from the +-- masculine singular. The types of adjectives that are recognized are +-- "alto", "fuerte", "util". Comparison is formed by "mas". + + mkA : (sol : Str) -> A ; + +-- One-place adjectives compared with "mas" need five forms in the worst +-- case (masc and fem singular, masc plural, adverbial). + + mkA : (fort,forta,forts,fortes,fortament : Str) -> A ; + +-- In the worst case, two separate adjectives are given: +-- the positive ("bo"), and the comparative ("millor"). + + mkA : (bo : A) -> (millor : A) -> A + } ; + +-- The functions above create postfix adjectives. To switch +-- them to prefix ones (i.e. ones placed before the noun in +-- modification, as in "gran casa"), the following function is +-- provided. +-- JS: What about vi bó -> bon vi ? + + prefixA : A -> A ; + + +--3 Two-place adjectives +-- +-- Two-place adjectives need a preposition for their second argument. + + mkA2 : A -> Prep -> A2 ; + + + +--2 Adverbs + +-- Adverbs are not inflected. Most lexical ones have position +-- after the verb. + + mkAdv : Str -> Adv ; + +-- Some appear next to the verb (e.g. "sempre"). + + mkAdV : Str -> AdV ; + +-- Adverbs modifying adjectives and sentences can also be formed. + + mkAdA : Str -> AdA ; + + +--2 Verbs + + mkV : overload { + +-- Regular verbs are ones inflected like "cantar", "perdre", "témer", "perdre", "servir", "dormir" +-- The regular verb function works for models I, IIa, IIb and IIa +-- The module $BeschCat$ gives the complete set of "Bescherelle" conjugations. + + mkV : (cantar : Str) -> V ; + +-- Verbs with vowel alternatition in the stem - easiest to give with +-- two forms, e.g. "mostrar"/"muestro". TODO + +--JS: Needed? mkV : (mostrar,muestro : Str) -> V ; + +-- Most irregular verbs are found in $IrregCat$. If this is not enough, +-- the module $BeschCat$ gives all the patterns of the "Bescherelle" +-- book. To use them in the category $V$, wrap them with the function + + mkV : Verbum -> V + } ; + +-- To form reflexive verbs: + + reflV : V -> V ; + +-- Verbs with a deviant passive participle: just give the participle +-- in masculine singular form as second argument. + + special_ppV : V -> Str -> V ; + + + +--3 Two-place verbs +-- +-- Two-place verbs need a preposition, except the special case with direct object. +-- (transitive verbs). + + mkV2 : overload { + mkV2 : Str -> V2 ; + mkV2 : V -> V2 ; + mkV2 : V -> Prep -> V2 + } ; + + +-- You can reuse a $V2$ verb in $V$. + + v2V : V2 -> V ; + +--3 Three-place verbs +-- +-- Three-place (ditransitive) verbs need two prepositions, of which +-- the first one or both can be absent. + + mkV3 : V -> Prep -> Prep -> V3 ; -- parlar, a, de + dirV3 : V -> Prep -> V3 ; -- donar,(accusative),a + dirdirV3 : V -> V3 ; -- donar,(dative),(accusative) + +--3 Other complement patterns +-- +-- Verbs and adjectives can take complements such as sentences, +-- questions, verb phrases, and adjectives. + + mkV0 : V -> V0 ; + mkVS : V -> VS ; + mkV2S : V -> Prep -> V2S ; + mkVV : V -> VV ; -- plain infinitive: "vull parlar" + deVV : V -> VV ; -- "acabar de parlar" + aVV : V -> VV ; -- "aprendre a parlar" + mkV2V : V -> Prep -> Prep -> V2V ; + mkVA : V -> VA ; + mkV2A : V -> Prep -> Prep -> V2A ; + mkVQ : V -> VQ ; + mkV2Q : V -> Prep -> V2Q ; + + mkAS : A -> AS ; + mkA2S : A -> Prep -> A2S ; + mkAV : A -> Prep -> AV ; + mkA2V : A -> Prep -> Prep -> A2V ; + +-- Notice: categories $AS, A2S, AV, A2V$ are just $A$, +-- and the second argument is given +-- as an adverb. Likewise +-- $V0$ is just $V$. + + V0 : Type ; + AS, A2S, AV, A2V : Type ; + + +--. +--2 The definitions of the paradigms +-- +-- The definitions should not bother the user of the API. So they are +-- hidden from the document. + + Gender = MorphoCat.Gender ; + Number = MorphoCat.Number ; + masculine = Masc ; + feminine = Fem ; + singular = Sg ; + plural = Pl ; + + accusative = complAcc ** {lock_Prep = <>} ; + genitive = complGen ** {lock_Prep = <>} ; + dative = complDat ** {lock_Prep = <>} ; + mkPrep p = {s = p ; c = Acc ; isDir = False ; lock_Prep = <>} ; + + + mk2N x y g = mkNounIrreg x y g ** {lock_N = <>} ; + regN x = mkNomReg x ** {lock_N = <>} ; + compN x y = {s = \\n => x.s ! n ++ y ; g = x.g ; lock_N = <>} ; + femN x = {s = x.s ; g = feminine ; lock_N = <>} ; + mascN x = {s = x.s ; g = masculine ; lock_N = <>} ; + + mkN2 = \n,p -> n ** {lock_N2 = <> ; c2 = p} ; + deN2 n = mkN2 n genitive ; + aN2 n = mkN2 n dative ; + mkN3 = \n,p,q -> n ** {lock_N3 = <> ; c2 = p ; c3 = q} ; + + mk2PN x g = {s = x ; g = g} ** {lock_PN = <>} ; + regPN x = mk2PN x g where { + g = case last x of { + "a" => feminine ; + _ => masculine + } + } ; + + makeNP x g n = {s = (pn2np (mk2PN x g)).s; a = agrP3 g n ; hasClit = False} ** {lock_NP = <>} ; + + mk5A a b c d e = + compADeg {s = \\_ => (mkAdj a b c d e).s ; isPre = False ; lock_A = <>} ; + regA a = compADeg {s = \\_ => (mkAdjReg a).s ; isPre = False ; lock_A = <>} ; + prefA a = {s = a.s ; isPre = True ; lock_A = <>} ; + + mkA2 a p = a ** {c2 = p ; lock_A2 = <>} ; + + mkADeg a b = + {s = table {Posit => a.s ! Posit ; _ => b.s ! Posit} ; + isPre = a.isPre ; lock_A = <>} ; + compADeg a = + {s = table {Posit => a.s ! Posit ; _ => \\f => "més" ++ a.s ! Posit ! f} ; + isPre = a.isPre ; + lock_A = <>} ; + regADeg a = compADeg (regA a) ; + + mkAdv x = ss x ** {lock_Adv = <>} ; + mkAdV x = ss x ** {lock_AdV = <>} ; + mkAdA x = ss x ** {lock_AdA = <>} ; + + regIIIV : (Str -> Verbum) -> Str -> V = \v,x -> -- I, IIa, IIb, III model given by v + let + verb = case (Predef.dp 2 x) of { + "re" => perdre_83 x ; -- IIa + "er" => témer_107 x ; -- IIb + "ir" => v x ; -- III? + _ => cantar_15 x -- Ia + } + in verbBesch verb ** {vtyp = VHabere ; lock_V = <>} ; + + regVa = regIIIV dormir_44 ; -- IIIa + regV = regIIIV servir_101 ; -- IIIb + + reflV v = {s = v.s ; vtyp = VRefl ; lock_V = <>} ; + + verbV ve = verbBesch ve ** {vtyp = VHabere ; lock_V = <>} ; + + reflVerbV : Verbum -> V = \ve -> reflV (verbV ve) ; + + special_ppV ve pa = { + s = table { + VPart g n => (adjPrim pa).s ! AF g n ; + p => ve.s ! p + } ; + lock_V = <> ; + vtyp = VHabere + } ; + +-- regAltV x y = verbV (regAlternV x y) ; + + mk2V2 v p = {s = v.s ; vtyp = v.vtyp ; c2 = p ; lock_V2 = <>} ; + dirV2 v = mk2V2 v accusative ; + v2V v = v ** {lock_V = <>} ; + + mkV3 v p q = {s = v.s ; vtyp = v.vtyp ; + c2 = p ; c3 = q ; lock_V3 = <>} ; + dirV3 v p = mkV3 v accusative p ; + dirdirV3 v = dirV3 v dative ; + + V0 : Type = V ; + AS, AV : Type = A ; + A2S, A2V : Type = A2 ; + + mkV0 v = v ** {lock_V0 = <>} ; + mkVS v = v ** {m = \\_ => Indic ; lock_VS = <>} ; ---- more moods + mkV2S v p = mk2V2 v p ** {mn,mp = Indic ; lock_V2S = <>} ; + mkVV v = v ** {c2 = complAcc ; lock_VV = <>} ; + deVV v = v ** {c2 = complGen ; lock_VV = <>} ; + aVV v = v ** {c2 = complDat ; lock_VV = <>} ; + mkV2V v p t = mkV3 v p t ** {lock_V2V = <>} ; + mkVA v = v ** {lock_VA = <>} ; + mkV2A v p q = mkV3 v p q ** {lock_V2A = <>} ; + mkVQ v = v ** {lock_VQ = <>} ; + mkV2Q v p = mk2V2 v p ** {lock_V2Q = <>} ; + + mkAS v = v ** {lock_AS = <>} ; ---- more moods + mkA2S v p = mkA2 v p ** {lock_A2S = <>} ; + mkAV v p = v ** {c = p.p1 ; s2 = p.p2 ; lock_AV = <>} ; + mkA2V v p q = mkA2 v p ** {s3 = q.p2 ; c3 = q.p1 ; lock_A2V = <>} ; + +--- + + mkN = overload { + mkN : (llum : Str) -> N = regN ; + mkN : Str -> Gender -> N = \s,g -> {s = (regN s).s ; g = g ; lock_N = <>}; + mkN : (disc,discos : Str) -> Gender -> N = mk2N + } ; + regN : Str -> N ; + mk2N : (disc,discos : Str) -> Gender -> N ; + mascN : N -> N ; + femN : N -> N ; + + + mkPN = overload { + mkPN : (Anna : Str) -> PN = regPN ; + mkPN : (Pilar : Str) -> Gender -> PN = mk2PN + } ; + mk2PN : Str -> Gender -> PN ; -- Joan + regPN : Str -> PN ; -- feminine for "-a", otherwise masculine + +-- To form a noun phrase that can also be plural, +-- you can use the worst-case function. + + makeNP : Str -> Gender -> Number -> NP ; + + mkA = overload { + mkA : (util : Str) -> A = regA ; + mkA : (fort,forta,forts,fortes,fortament : Str) -> A = mk5A ; + mkA : (bo : A) -> (millor : A) -> A = mkADeg ; + } ; + + mk5A : (fort,forta,forts,fortes,fortament : Str) -> A ; + regA : Str -> A ; + mkADeg : A -> A -> A ; + compADeg : A -> A ; + regADeg : Str -> A ; + prefA : A -> A ; + prefixA = prefA ; + + mkV = overload { + mkV : (cantar : Str) -> V = regV ; +--JS mkV : (mostrar,muestro : Str) -> V = regAltV ; + mkV : Verbum -> V = verbV + } ; + regV, regVa : Str -> V ; +--JS regAltV : (mostrar,muestro : Str) -> V ; + verbV : Verbum -> V ; + + mkV2 = overload { + mkV2 : Str -> V2 = \s -> dirV2 (regV s) ; + mkV2 : V -> V2 = dirV2 ; + mkV2 : V -> Prep -> V2 = mk2V2 + } ; + mk2V2 : V -> Prep -> V2 ; + dirV2 : V -> V2 ; + + + +} ; |
