From cfc4f66774d33294f1304d2f3b25d38a30125836 Mon Sep 17 00:00:00 2001 From: aarne Date: Tue, 21 Jun 2005 06:27:26 +0000 Subject: [PATCH] Finnish paradigms forthcoming --- lib/resource/finnish/ParadigmsFin.gf | 690 ++++++++++++--------------- 1 file changed, 296 insertions(+), 394 deletions(-) diff --git a/lib/resource/finnish/ParadigmsFin.gf b/lib/resource/finnish/ParadigmsFin.gf index bebcb2c5b..c5b2a4dc8 100644 --- a/lib/resource/finnish/ParadigmsFin.gf +++ b/lib/resource/finnish/ParadigmsFin.gf @@ -1,21 +1,267 @@ --# -path=.:../abstract:../../prelude +--1 Finnish Lexical Paradigms +-- +-- Aarne Ranta 2003-2005 +-- +-- This is an API to the user of the resource grammar +-- for adding lexical items. It give shortcuts for forming +-- expressions of basic categories: nouns, adjectives, verbs. +-- +-- Closed categories (determiners, pronouns, conjunctions) are +-- accessed through the resource syntax API, $Structural.gf$. +-- +-- The main difference with $MorphoFin.gf$ is that the types +-- referred to are compiled resource grammar types. We have moreover +-- had the design principle of always having existing forms, not +-- stems, as string arguments of the paradigms, not stems. +-- + resource ParadigmsFin = open (Predef=Predef), Prelude, SyntaxFin, CategoriesFin in { +--2 Parameters +-- +-- To abstract over gender, number, and (some) case names, +-- we define the following identifiers. + +oper + Gender : Type; + + human : Gender ; + nonhuman : Gender ; + + Number : Type; + + singular : Number ; + plural : Number ; + + Case : Type ; + nominative : Case ; + genitive : Case ; + partitive : Case ; + inessive : Case ; + elative : Case ; + illative : Case ; + adessive : Case ; + ablative : Case ; + allative : Case ; + +--2 Nouns + +-- Worst case: give ten forms and the semantic gender. +-- In practice just a couple of forms are needed, to define the different +-- stems, vowel alternation, and vowel harmony. + +oper + mkN : + (talo,talon,talona,taloa,taloon,taloina,taloissa,talojen,taloja,taloihin + : Str) -> Gender -> N ; + -- The regular noun heuristic takes just one form and analyses its suffixes. - oper + regN : (talo : Str) -> N ; - regNoun : (talo : Str) -> CommonNoun ; +-- Nouns with partitive "a"/"ä" are a large group. +-- To determine for grade and vowel alternation, three forms are usually needed: +-- singular nominative and genitive, and plural partitive. +-- Examples: "talo", "kukko", "huippu", "koira", "kukka", "syylä", "särki"... - regVerb : (soutaa : Str) -> Verb ; + nKukko : (kukko,kukon,kukkoja : Str) -> N ; + +-- For convenience, we define 1-argument paradigms as producing the +-- nonhuman gender; the following function changes this: + + humanN : N -> N ; + +-- A special case are nouns with no alternations: +-- the vowel harmony is inferred from the last letter, +-- which must be one of "o", "u", "ö", "y". + + nTalo : (talo : Str) -> N ; + +-- Another special case are nouns where the last two consonants +-- undergo regular weak-grade alternation: +-- "kukko - kukon", "rutto - ruton", "hyppy - hypyn", "sampo - sammon", +-- "kunto - kunnon", "sisältö - sisällön", . + + nLukko : (lukko : Str) -> N ; + +-- "arpi - arven", "sappi - sapen", "kampi - kammen";"sylki - syljen" + + nArpi : (arpi : Str) -> N ; + nSylki : (sylki : Str) -> N ; + +-- Foreign words ending in consonants are actually similar to words like +-- "malli"/"mallin"/"malleja", with the exception that the "i" is not attached +-- to the singular nominative. Examples: "linux", "savett", "screen". +-- The singular partitive form is used to get the vowel harmony. (N.B. more than +-- 1-syllabic words ending in "n" would have variant plural genitive and +-- partitive forms, like "sultanien"/"sultaneiden", which are not covered.) + + nLinux : (linuxia : Str) -> N ; + +-- Nouns of at least 3 syllables ending with "a" or "ä", like "peruna", "tavara", +-- "rytinä". + + nPeruna : (peruna : Str) -> N ; + +-- The following paradigm covers both nouns ending in an aspirated "e", such as +-- "rae", "perhe", "savuke", and also many ones ending in a consonant +-- ("rengas", "kätkyt"). The singular nominative and essive are given. + + nRae : (rae, rakeena : Str) -> N ; + +-- The following covers nouns with partitive "ta"/"tä", such as +-- "susi", "vesi", "pieni". To get all stems and the vowel harmony, it takes +-- the singular nominative, genitive, and essive. + + nSusi : (susi,suden,sutta : Str) -> N ; + +-- Nouns ending with a long vowel, such as "puu", "pää", "pii", "leikkuu", +-- are inflected according to the following. + + nPuu : (puu : Str) -> N ; + +-- One-syllable diphthong nouns, such as "suo", "tie", "työ", are inflected by +-- the following. + + nSuo : (suo : Str) -> N ; + +-- Many adjectives but also nouns have the nominative ending "nen" which in other +-- cases becomes "s": "nainen", "ihminen", "keltainen". +-- To capture the vowel harmony, we use the partitive form as the argument. + + nNainen : (naista : Str) -> N ; + +-- The following covers some nouns ending with a consonant, e.g. +-- "tilaus", "kaulin", "paimen", "laidun". + + nTilaus : (tilaus,tilauksena : Str) -> N ; + +-- Special case: + + nKulaus : (kulaus : Str) -> N ; + +-- The following covers nouns like "nauris" and adjectives like "kallis", "tyyris". +-- The partitive form is taken to get the vowel harmony. + + nNauris : (naurista : Str) -> N ; + +-- Separately-written compound nouns, like "sambal oelek", "Urho Kekkonen", +-- have only their last part inflected. + + nComp : Str -> N -> N ; + +-- Nouns used as functions need a case, of which by far the commonest is +-- the genitive. + + mkN2 : N -> Case -> N2 ; + fGen : N -> N2 ; + +-- Proper names can be formed by using declensions for nouns. +-- The plural forms are filtered away by the compiler. + + mkPN : N -> PN ; +--2 Adjectives +-- Non-comparison one-place adjectives are just like nouns. + + mkA : N -> A ; + +-- Two-place adjectives need a case for the second argument. + + mkA2 : N -> Case -> A2 ; + +-- Comparison adjectives have three forms. The comparative and the superlative +-- are always inflected in the same way, so the nominative of them is actually +-- enough (except for the superlative "paras" of "hyvä"). + + mkADeg : (kiva : N) -> (kivempaa,kivinta : Str) -> ADeg ; + + +--2 Verbs +-- +-- The fragment only has present tense so far, but in all persons. +-- The worst case needs five forms, as shown in the following. + + mkV : (tulla,tulee,tulen,tulevat,tulkaa,tullaan, + tuli,tulin,tulisi,tullut,tultu,tullun : Str) -> V ; + regV : (soutaa : Str) -> V ; + + +-- A simple special case is the one with just one stem and no grade alternation. +-- It covers e.g. "sanoa", "valua", "kysyä". + + vValua : (valua : Str) -> V ; + +-- With two forms, the following function covers a variety of verbs, such as +-- "ottaa", "käyttää", "löytää", "huoltaa", "hiihtää", "siirtää". + + vKattaa : (kattaa, katan : Str) -> V ; + +-- When grade alternation is not present, just a one-form special case is needed +-- ("poistaa", "ryystää"). + + vOstaa : (ostaa : Str) -> V ; + +-- The following covers +-- "juosta", "piestä", "nousta", "rangaista", "kävellä", "surra", "panna". + + vNousta : (nousta, nousen : Str) -> V ; + +-- This is for one-syllable diphthong verbs like "juoda", "syödä". + + vTuoda : (tuoda : Str) -> V ; + +-- The verbs "be" and the negative auxiliary are special. + + vOlla : V ; + vEi : V ; + +-- Two-place verbs need a case, and can have a pre- or postposition. +-- At least one of the latter is empty, $[]$. + + mkV2 : V -> Case -> (prep,postp : Str) -> V2 ; + +-- If both are empty, the following special function can be used. + + tvCase : V -> Case -> V2 ; + +-- Verbs with a direct (accusative) object +-- are special, since their complement case is finally decided in syntax. + + tvDir : V -> V2 ; + +-- The definitions should not bother the user of the API. So they are +-- hidden from the document. --. + Gender = SyntaxFin.Gender ; + Case = SyntaxFin.Case ; + Number = SyntaxFin.Number ; -regNoun = \vesi -> + singular = Sg ; + plural = Pl ; + + human = Human ; + nonhuman = NonHuman ; + + nominative = Nom ; + genitive = Gen ; + partitive = Part ; + inessive = Iness ; + elative = Elat ; + illative = Illat ; + adessive = Adess ; + ablative = Ablat ; + allative = Allat ; + + mkN = \a,b,c,d,e,f,g,h,i,j,k -> + mkNoun a b c d e f g h i j ** {g = k ; lock_N = <>} ; + +regN = \vesi -> let esi = Predef.dp 3 vesi ; -- analysis: suffixes si = Predef.dp 2 esi ; @@ -44,10 +290,43 @@ regNoun = \vesi -> _ => sLinux (vesi + "i" + a) } } - } ; + } ** {g = NonHuman ; lock_N = <>} ; -regVerb soutaa = + + nKukko = \a,b,c -> sKukko a b c ** {g = nonhuman ; lock_N = <>} ; + + humanN = \n -> {s = n.s ; lock_N = n.lock_N ; g = human} ; + + nLukko = \a -> sLukko a ** {g = nonhuman ; lock_N = <>} ; + nTalo = \a -> sTalo a ** {g = nonhuman ; lock_N = <>} ; + nArpi = \a -> sArpi a ** {g = nonhuman ; lock_N = <>} ; + nSylki = \a -> sSylki a ** {g = nonhuman ; lock_N = <>} ; + nLinux = \a -> sLinux a ** {g = nonhuman ; lock_N = <>} ; + nPeruna = \a -> sPeruna a ** {g = nonhuman ; lock_N = <>} ; + nRae = \a,b -> sRae a b ** {g = nonhuman ; lock_N = <>} ; + nSusi = \a,b,c -> sSusi a b c ** {g = nonhuman ; lock_N = <>} ; + nPuu = \a -> sPuu a ** {g = nonhuman ; lock_N = <>} ; + nSuo = \a -> sSuo a ** {g = nonhuman ; lock_N = <>} ; + nNainen = \a -> sNainen a ** {g = nonhuman ; lock_N = <>} ; + nTilaus = \a,b -> sTilaus a b ** {g = nonhuman ; lock_N = <>} ; + nKulaus = \a -> nTilaus a (init a + "ksen" + getHarmony (last + (init a))) ; + nNauris = \a -> sNauris a ** {g = nonhuman ; lock_N = <>} ; + + + nComp = \s,n -> {s = \\c => s ++ n.s ! c ; g = n.g ; lock_N = <>} ; + mkN2 = \n,c -> n2n n ** {c = NPCase c ; lock_N2 = <>} ; + fGen = \n -> mkN2 n genitive ; + mkPN n = mkProperName n ** {lock_PN = <>} ; + + mkA = \x -> noun2adj x ** {lock_A = <>} ; + mkA2 = \x,c -> mkA x ** {c = NPCase c ; lock_A2 = <>} ; + mkADeg x y z = regAdjDegr x y z ** {lock_ADeg = <>} ; + + mkV a b c d e f g h i j k l = mkVerb a b c d e f g h i j k l ** {lock_V = <>} ; + +regV soutaa = let taa = Predef.dp 3 soutaa ; aa = Predef.dp 2 taa ; @@ -65,395 +344,18 @@ regVerb soutaa = "ta" | "tä" => vOsata soutaa ; _ => vSanoa soutaa --- _ => vHukkua soutaa souda - }} ; + }} ** {lock_V = <>} ; + vValua v = vSanoa v ** {lock_V = <>} ; + vKattaa v u = vOttaa v u ** {lock_V = <>} ; + vOstaa v = vPoistaa v ** {lock_V = <>} ; + vNousta v u = vJuosta v u [] [] ** {lock_V = <>} ; ----- + vTuoda v = vJuoda v [] ** {lock_V = <>} ; ----- + vOlla = verbOlla ** {lock_V = <>} ; + vEi = verbEi ** {lock_V = <>} ; - +---- mkV2 = \v,c,p,o -> v ** {s3 = p ; s4 = o ; c = c ; lock_V2 = <>} ; + tvCase = \v,c -> mkV2 v c [] [] ; + tvDir v = mkTransVerbDir v ** {lock_V2 = <>} ; } ; - - - -{- ---1 Finnish Lexical Paradigms --- --- Aarne Ranta 2005 --- --- This is an API to the user of the resource grammar --- for adding lexical items. It give shortcuts for forming --- expressions of basic categories: nouns, adjectives, verbs. --- --- Closed categories (determiners, pronouns, conjunctions) are --- accessed through the resource syntax API, $resource.Abs.gf$. --- --- The main difference with $MorphoIta.gf$ is that the types --- referred to are compiled resource grammar types. We have moreover --- had the design principle of always having existing forms, not stems, as string --- arguments of the paradigms. --- --- The following modules are presupposed: - -resource ParadigmsSpa = - open Prelude, (Types = TypesSpa), SyntaxSpa, MorphoSpa, BeschSpa, - RulesSpa in { - ---2 Parameters --- --- To abstract over gender names, we define the following identifiers. - -oper - Bool : Type ; - 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' "à"). - - Preposition : Type ; - - accusative : Preposition ; - dative : Preposition ; - genitive : Preposition ; - - mkPreposition : Str -> Preposition ; - ---2 Nouns - --- Worst case: ten forms. - - mkN : (talo,talon,talona,taloa,taloon,taloina, - taloissa,talojen,taloja,taloihin : Str) -> N ; - --- The regular heuristic analyses the singular nominative form. It works for the --- following types of nouns: "maa/tee/pii/tienoo/puu/pyy/pää/köö", --- "tie/suo/työ", "nauris", "rae/perhe/hake/...", "ihanuus/itsekkyys", --- "tilaus/lisäys","baari", "nauris", "talo/hyppy/..." and takes care --- of grade and vowel alternations. - - regN : (talo : Str) -> N ; - --- The almost-regular heuristic analyses three forms. It works for the --- following classes: ... - - reg3N : (vesi,veden,vesiä : Str) -> N ; - - - --- 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. - - regN : Str -> N ; - --- To force a different gender, use one of the following functions. - - mascN : N -> N ; - femN : N -> 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. "numéro de téléphone". --- 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 ("fille de x") need a case and a preposition. - - mkN2 : N -> Preposition -> 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 connessione di x a y") need two prepositions. - - mkN3 : N -> Preposition -> Preposition -> 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. - - mkPN : Str -> Gender -> PN ; -- Jean - --- To form a noun phrase that can also be plural, --- you can use the worst-case function. - - mkNP : Str -> Gender -> Number -> NP ; - ---2 Adjectives - --- Non-comparison one-place adjectives need five forms in the worst --- case (masc and fem singular, masc plural, adverbial). - - mkA : (solo,sola,soli,sole, solamente : Str) -> A ; - --- For regular adjectives, all other forms are derived from the --- masculine singular. The types of adjectives that are recognized are --- "alto", "fuerte", "util". - - regA : Str -> A ; - --- These functions create postfix adjectives. To switch --- them to prefix ones (i.e. ones placed before the noun in --- modification, as in "petite maison"), the following function is --- provided. - - prefA : A -> A ; - ---3 Two-place adjectives --- --- Two-place adjectives need a preposition for their second argument. - - mkA2 : A -> Preposition -> A2 ; - ---3 Comparison adjectives - --- Comparison adjectives are in the worst case put up from two --- adjectives: the positive ("bueno"), and the comparative ("mejor"). - - mkADeg : A -> A -> ADeg ; - --- If comparison is formed by "mas", as usual in Spanish, --- the following pattern is used: - - compADeg : A -> ADeg ; - --- The regular pattern is the same as $regA$ for plain adjectives, --- with comparison by "mas". - - regADeg : Str -> ADeg ; - --- From a given $ADeg$, it is possible to get back to $A$. - - adegA : ADeg -> A ; - --- For prefixed adjectives, the following function is --- provided. - - prefADeg : ADeg -> ADeg ; - ---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. "siempre"). - - mkAdV : Str -> AdV ; - --- Adverbs modifying adjectives and sentences can also be formed. - - mkAdA : Str -> AdA ; - - ---2 Verbs --- --- Regular verbs are ones inflected like "cortar", "deber", or "vivir". --- The regular verb function is the first conjugation ("ar") recognizes --- the variations corresponding to the patterns --- "actuar, cazar, guiar, pagar, sacar". The module $BeschSpa$ gives --- the complete set of "Bescherelle" conjugations. - - regV : Str -> V ; - --- The module $BeschSpa$ gives all the patterns of the "Bescherelle" --- book. To use them in the category $V$, wrap them with the function - - verboV : Verbum -> 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). Notice that a particle comes from the $V$. - - mkV2 : V -> Preposition -> V2 ; - - dirV2 : V -> 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 -> Preposition -> Preposition -> V3 ; -- parler, à, de - dirV3 : V -> Preposition -> V3 ; -- donner,_,à - dirdirV3 : V -> V3 ; -- donner,_,_ - ---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 -> Preposition -> V2S ; - mkVV : V -> VV ; -- plain infinitive: "je veux parler" - deVV : V -> VV ; -- "j'essaie de parler" - aVV : V -> VV ; -- "j'arrive à parler" - mkV2V : V -> Preposition -> Preposition -> V2V ; - mkVA : V -> VA ; - mkV2A : V -> Preposition -> V2A ; - mkVQ : V -> VQ ; - mkV2Q : V -> Preposition -> V2Q ; - - mkAS : A -> AS ; - subjAS : A -> AS ; - mkA2S : A -> Preposition -> A2S ; - mkAV : A -> Preposition -> AV ; - mkA2V : A -> Preposition -> Preposition -> A2V ; - - ---2 Definitions of the paradigms --- --- The definitions should not bother the user of the API. So they are --- hidden from the document. ---. - - Bool = Prelude.Bool ; - Gender = SyntaxSpa.Gender ; - Preposition = SyntaxSpa.Case * Str ; - Number = SyntaxSpa.Number ; - - masculine = Masc ; - feminine = Fem ; - - accusative = ; - genitive = ; - dative = ; - mkPreposition p = ; - - singular = Types.singular ; - plural = Types.plural ; - - mkN x y g = mkCNomIrreg 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 = <> ; c = p.p1 ; s2 = p.p2} ; - deN2 n = mkN2 n genitive ; - aN2 n = mkN2 n dative ; - mkN3 = \n,p,q -> n ** {lock_N3 = <> ; c = p.p1 ; s2 = p.p2 ; c3 = q.p1 ; s3 = q.p2} ; - - mkPN x g = {s = x ; g = g} ** {lock_PN = <>} ; - mkNP x g n = let np = mkNameNounPhrase x g in - {s = np.s ; g = np.g ; p = np.p ; c = np.c ; n = n ; lock_NP = <>} ; - - mkA a b c d e = mkAdj a b c d e ** {p = False ; lock_A = <>} ; - regA a = mkAdjReg a ** {p = False ; lock_A = <>} ; - prefA a = {s = a.s ; p = True ; lock_A = <>} ; - - mkA2 a p = a ** {c = p.p1 ; s2 = p.p2 ; lock_A2 = <>} ; - - mkADeg a b = {s = table {Pos => a.s ; _ => b.s} ; p = a.p ; lock_ADeg = <>} ; - compADeg a = {s = table {Pos => a.s ; _ => \\f => "mas" ++ a.s ! f} ; p = a.p ; - lock_ADeg = <>} ; - regADeg a = compADeg (regA a) ; - prefADeg a = {s = a.s ; p = True ; lock_ADeg = <>} ; - - adegA a = {s = a.s ! Pos ; p = a.p ; lock_A = <>} ; - - mkAdv x = ss x ** {lock_Adv = <>} ; - mkAdV x = ss x ** {lock_AdV = <>} ; - mkAdA x = ss x ** {lock_AdA = <>} ; - - regV x = -- cortar actuar cazar guiar pagar sacar - let - ar = Predef.dp 2 x ; - z = Predef.dp 1 (Predef.tk 2 x) ; - verb = case ar of { - "ir" => vivir_7 x ; - "er" => deber_6 x ; - _ => case z of { - "u" => actuar_9 x ; - "z" => cazar_21 x ; - "i" => guiar_43 x ; - "g" => pagar_53 x ; - "c" => sacar_72 x ; - _ => cortar_5 x - } - } - in verbPres verb AHabere ** {lock_V = <>} ; - - verboV ve = verbPres ve AHabere ** {lock_V = <>} ; - - special_ppV ve pa = { - s = table { - VPart g n => (adjSolo pa).s ! AF g n ; - p => ve.s ! p - } ; - lock_V = <> ; - aux = AHabere - } ; - - mkV2 v p = {s = v.s ; aux = v.aux ; s2 = p.p2 ; c = p.p1 ; lock_V2 = <>} ; - dirV2 v = mkV2 v accusative ; - v2V v = v ** {lock_V = <>} ; - - mkV3 v p q = {s = v.s ; aux = v.aux ; - s2 = p.p2 ; s3 = q.p2 ; c = p.p1 ; c3 = q.p1 ; lock_V3 = <>} ; - dirV3 v p = mkV3 v accusative p ; - dirdirV3 v = dirV3 v dative ; - - mkV0 v = v ** {lock_V0 = <>} ; - mkVS v = v ** {mn,mp = Ind ; lock_VS = <>} ; ---- more moods - mkV2S v p = mkV2 v p ** {mn,mp = Ind ; lock_V2S = <>} ; - mkVV v = v ** {c = accusative.p1 ; lock_VV = <>} ; - deVV v = v ** {c = genitive.p1 ; lock_VV = <>} ; - aVV v = v ** {c = dative.p1 ; lock_VV = <>} ; - mkV2V v p t = mkV2 v p ** {c3 = t.p1 ; s3 = p.p2 ; lock_V2V = <>} ; - mkVA v = v ** {lock_VA = <>} ; - mkV2A v p = mkV2 v p ** {lock_V2A = <>} ; - mkVQ v = v ** {lock_VQ = <>} ; - mkV2Q v p = mkV2 v p ** {lock_V2Q = <>} ; - - mkAS v = v ** {mn,mp = Ind ; lock_AS = <>} ; ---- more moods - mkA2S v p = mkA2 v p ** {mn,mp = Ind ; 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 = <>} ; - -} ; --}