started nor paradigms - does not work yet

lib/resource/danish/SyntaxDan.gf

@@ -10,7 +10,6 @@ instance SyntaxDan of SyntaxScand = TypesDan **
 
 -- When common nouns are extracted from lexicon, the composite noun form is ignored.
 
-  npMan : NounPhrase = nameNounPhrase (mkProperName "man" NUtr) ;
   npDet : NounPhrase = nameNounPhrase (mkProperName "det" NNeutr) ;
 
   mkAdjForm : Species -> Number -> NounGender -> AdjFormPos = \b,n,g -> 

lib/resource/norwegian/ParadigmsNor.gf

@@ -0,0 +1,345 @@
+--# -path=.:../scandinavian:../abstract:../../prelude
+
+--1 Norwegian Lexical Paradigms
+--
+-- Aarne Ranta 2003
+--
+-- This is an API to 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 $MorphoNor.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$.
+-- However, this function should only seldom be needed: we have a
+-- separate module $IrregularEng$, which covers all irregularly inflected
+-- words.
+-- 
+-- The following modules are presupposed:
+
+resource ParadigmsNor = 
+  open (Predef=Predef), Prelude, TypesNor, MorphoNor, SyntaxNor, CategoriesNor in {
+
+--2 Parameters 
+--
+-- To abstract over gender names, we define the following identifiers.
+
+oper
+  Gender : Type ; 
+
+  masculine : Gender ;
+  feminine  : Gender ;
+  neutrum   : Gender ;
+
+-- To abstract over number names, we define the following.
+
+  Number : Type ; 
+
+  singular : Number ;
+  plural   : Number ;
+
+-- To abstract over case names, we define the following.
+
+  Case : Type ;
+
+  nominative : Case ;
+  genitive   : Case ;
+
+-- Prepositions used in many-argument functions are just strings.
+
+  Preposition : Type = Str ;
+
+--2 Nouns
+
+-- Worst case: give all four forms. The gender is computed from the
+-- last letter of the second form (if "n", then $utrum$, otherwise $neutrum$).
+
+  mkN  : (dreng,drengen,drenger,drengene : Str) -> N ;
+
+-- The regular function takes the singular indefinite form and the gender,
+-- and computes the other forms by a heuristic. 
+-- If in doubt, use the $cc$ command to test!
+
+  regN : Str -> Gender -> N ;
+
+-- In practice the worst case is often just: give singular and plural indefinite.
+
+  mk2N : (dreng,drenger : Str) -> N ;
+
+--3 Compound nouns 
+--
+-- All the functions above work quite as well to form compound nouns,
+-- such as "fotboll". 
+
+
+--3 Relational nouns 
+-- 
+-- Relational nouns ("daughter of x") need a preposition. 
+
+  mkN2 : N -> Preposition -> N2 ;
+
+-- The most common preposition is "av", and the following is a
+-- shortcut for regular, $nonhuman$ relational nouns with "av".
+
+  regN2 : Str -> Gender -> N2 ;
+
+-- Use the function $mkPreposition$ or see the section on prepositions below to  
+-- form other prepositions.
+--
+-- Three-place relational nouns ("the connection from x to 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, with a regular genitive, are formed as follows
+
+  regPN : Str -> Gender -> PN ;          -- John, John's
+
+-- Sometimes you can reuse a common noun as a proper name, e.g. "Bank".
+
+  nounPN : N -> PN ;
+
+-- To form a noun phrase that can also be plural and have an irregular
+-- genitive, you can use the worst-case function.
+
+  mkNP : Str -> Str -> Number -> Gender -> NP ; 
+
+--2 Adjectives
+
+-- Non-comparison one-place adjectives need three forms: 
+
+  mkA : (galen,galet,galne : Str) -> A ;
+
+-- For regular adjectives, the other forms are derived. 
+
+  regA : Str -> A ;
+
+-- In most cases, two forms are enough.
+
+  mk2A : (stor,stort : Str) -> A ;
+ 
+--3 Two-place adjectives
+--
+-- Two-place adjectives need a preposition for their second argument.
+
+  mkA2 : A -> Preposition -> A2 ;
+
+-- Comparison adjectives may need as many as five forms. 
+
+  mkADeg : (stor,stort,store,storre,storst : Str) -> ADeg ;
+
+-- The regular pattern works for many adjectives, e.g. those ending
+-- with "ig".
+
+  regADeg : Str -> ADeg ;
+
+-- Just the comparison forms can be irregular.
+
+  irregADeg : (tung,tyngre,tyngst : Str) -> ADeg ;
+
+-- Sometimes just the positive forms are irregular.
+
+  mk3ADeg : (galen,galet,galna : Str) -> ADeg ;
+  mk2ADeg : (bred,bredt        : Str) -> ADeg ;
+
+-- If comparison is formed by "mer, "mest", as in general for
+-- long adjective, the following pattern is used:
+
+  compoundADeg : A -> ADeg ; -- -/mer/mest norsk
+
+-- From a given $ADeg$, it is possible to get back to $A$.
+
+  adegA : ADeg -> A ;
+
+
+--2 Adverbs
+
+-- Adverbs are not inflected. Most lexical ones have position
+-- after the verb. Some can be preverbal (e.g. "always").
+
+  mkAdv : Str -> Adv ;
+  mkAdV : Str -> AdV ;
+
+-- Adverbs modifying adjectives and sentences can also be formed.
+
+  mkAdA : Str -> AdA ;
+
+--2 Prepositions
+--
+-- A preposition is just a string.
+
+  mkPreposition : Str -> Preposition ;
+
+--2 Verbs
+--
+-- The worst case needs six forms.
+
+  mkV : (spise,spiser,spises,spiste,spist,spis : Str) -> V ;
+
+-- The 'regular verb' function is the first conjugation.
+
+  regV : (snakke : Str) -> V ;
+
+-- The almost regular verb function needs the infinitive and the present.
+
+  mk2V : (leve,levde : Str) -> V ;
+
+-- There is an extensive list of irregular verbs in the module $IrregularSwe$.
+-- In practice, it is enough to give three forms, as in school books.
+
+  irregV     : (drikke, drakk, drukket  : Str) -> V ;
+
+
+--3 Verbs with a particle.
+--
+-- The particle, such as in "switch on", is given as a string.
+
+  partV  : V -> Str -> V ;
+
+--3 Deponent verbs.
+--
+-- Some words are used in passive forms only, e.g. "hoppas".
+
+  depV  : V -> 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 ;
+
+--3 Three-place verbs
+--
+-- Three-place (ditransitive) verbs need two prepositions, of which
+-- the first one or both can be absent.
+
+  mkV3     : V -> Str -> Str -> V3 ;    -- speak, with, about
+  dirV3    : V -> Str -> V3 ;           -- give,_,to
+  dirdirV3 : V -> V3 ;                  -- give,_,_
+
+--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 -> Str -> V2S ;
+  mkVV  : V -> VV ;
+  mkV2V : V -> Str -> Str -> V2V ;
+  mkVA  : V -> VA ;
+  mkV2A : V -> Str -> V2A ;
+  mkVQ  : V -> VQ ;
+  mkV2Q : V -> Str -> V2Q ;
+
+  mkAS  : A -> AS ;
+  mkA2S : A -> Str -> A2S ;
+  mkAV  : A -> AV ;
+  mkA2V : A -> Str -> A2V ;
+
+
+--2 Definitions of the paradigms
+--
+-- The definitions should not bother the user of the API. So they are
+-- hidden from the document.
+--.
+
+  Gender = SyntaxSwe.NounGender ; 
+  Number = TypesSwe.Number ;
+  Case = TypesSwe.Case ;
+  utrum = NUtr NoMasc ; 
+  neutrum = NNeutr ;
+  singular = Sg ;
+  plural = Pl ;
+  nominative = Nom ;
+  genitive = Gen ;
+
+  mkN x y z u = extCommNoun (mkNoun x y z u) ** {lock_N = <>} ;
+  regN x g = extCommNoun (regNoun x (genNoun g)) ** {lock_N = <>} ;
+  mk2N x g = extCommNoun (reg2Noun x g) ** {lock_N = <>} ;
+  mascN n = {s = n.s ; g = NUtr Masc ; lock_N = <>} ;
+
+  mkN2 = \n,p -> n ** {lock_N2 = <> ; s2 = p} ;
+  regN2 n g = mkN2 (regN n g) (mkPreposition "av") ;
+  mkN3 = \n,p,q -> n ** {lock_N3 = <> ; s2 = p ; s3 = q} ;
+
+  regPN n g = {s = \\c => mkCase c n ; g = g} ** {lock_PN = <>} ;
+  nounPN n = {s = n.s ! singular ! Indef ; g = n.g ; lock_PN = <>} ;
+  mkNP x y n g = 
+    {s = table {PGen _ => x ; _ => y} ; g = genNoun g ; n = n ; p = P3 ;
+     lock_NP = <>} ;
+
+  mkA a b c = extractPositive (adjAlmostReg a b c) ** {lock_A = <>} ;
+  mk2A a b = extractPositive (adj2Reg a b) ** {lock_A = <>} ;
+  regA a = extractPositive (adjReg a) ** {lock_A = <>} ;
+
+  mkA2 a p = a ** {s2 = p ; lock_A2 = <>} ;
+
+  mkADeg a b c d e f g = mkAdjective a b c d e f g ** {lock_ADeg = <>} ;
+  regADeg a = adjReg a ** {lock_ADeg = <>} ;
+  irregADeg a b c = adjIrreg3 a b c ** {lock_ADeg = <>} ;
+  mk3ADeg a b c = adjAlmostReg a b c ** {lock_ADeg = <>} ;
+  mk2ADeg a b = adj2Reg a b ** {lock_ADeg = <>} ;
+
+  mkAdv x = ss x ** {lock_Adv = <>} ;
+  mkAdV x = ss x ** {lock_AdV = <>} ;
+  mkAdA x = ss x ** {lock_AdA = <>} ;
+
+  mkPreposition p = p ;
+
+  mkV a b c d e f = mkVerb a b c d e f ** {s1 = [] ; lock_V = <>} ;
+
+  regV a = mk2V a (a + "r") ;
+  mk2V a b = regVerb a b ** {s1 = [] ; lock_V = <>} ;
+
+  irregV x y z =  vSälja x y z
+     ** {s1 = [] ; lock_V = <>} ;
+
+  partV v p = {s = v.s ; s1 = p ; lock_V = <>} ;
+  depV v = deponentVerb v ** {lock_V = <>} ;
+
+  mkV2 v p = v ** {s = v.s ; s1 = v.s1 ; s2 = p ; lock_V2 = <>} ;
+  dirV2 v = mkV2 v [] ;
+
+  mkV3 v p q = v ** {s = v.s ; s1 = v.s1 ; s2 = p ; s3 = q ; lock_V3 = <>} ;
+  dirV3 v p = mkV3 v [] p ;
+  dirdirV3 v = dirV3 v [] ;
+
+  mkV0  v = v ** {lock_V0 = <>} ;
+  mkVS  v = v ** {lock_VS = <>} ;
+  mkV2S v p = mkV2 v p ** {lock_V2S = <>} ;
+  mkVV  v = v ** {isAux = False ; lock_VV = <>} ;
+  mkV2V v p t = mkV2 v p ** {s3 = t ; 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 ** {lock_AS = <>} ;
+  mkA2S v p = mkA2 v p ** {lock_A2S = <>} ;
+  mkAV  v = v ** {lock_AV = <>} ;
+  mkA2V v p = mkA2 v p ** {lock_A2V = <>} ;
+
+} ;

lib/resource/norwegian/SyntaxNor.gf

@@ -11,10 +11,8 @@ instance SyntaxNor of SyntaxScand = TypesNor **
 
 -- When common nouns are extracted from lexicon, the composite noun form is ignored.
 
-  npMan : NounPhrase = nameNounPhrase (mkProperName "man" (NUtr Masc)) ;
   npDet : NounPhrase = nameNounPhrase (mkProperName "det" NNeutr) ;
 
-
   mkAdjForm : Species -> Number -> NounGender -> AdjFormPos = \b,n,g -> 
     case <b,n> of {
       <Indef,Sg> => Strong (ASg (genNoun g)) ;
@@ -23,7 +21,7 @@ instance SyntaxNor of SyntaxScand = TypesNor **
       } ;
 
   verbFinnas : Verb = 
-    deponentVerb (mkVerb "finne" "finner" "finnes" "fant" "funnet" "finn" ** {s1 = []}) ;
+    mkVerb "finnes" "finner" "finnes" "fantes" "funnets" "fins" ** {s1 = []} ;
   verbVara = mkVerb "være" "er" nonExist "var" "vært" "vær" ** {s1 = []} ;
   verbHava = mkVerb "ha" "ha" "has" "hadde" "hatt" "ha" ** {s1 = []} ;
 

lib/resource/scandinavian/SyntaxScand.gf

@@ -111,7 +111,15 @@ oper
 
 -- Formal subjects
 
-  npMan : NounPhrase ;
+  npMan : NounPhrase = {
+    s = table {
+      PNom => "man" ;
+      PAcc => "en" ;
+      PGen _ => "ens"
+      } ;
+    g = utrum ; n = Sg ; p = P3
+    } ;
+
   npDet : NounPhrase ;
 
 --2 Determiners

lib/resource/swedish/SyntaxSwe.gf

@@ -11,15 +11,6 @@ instance SyntaxSwe of SyntaxScand = TypesSwe **
 
   oper 
 
-  npMan : NounPhrase = {
-    s = table {
-      PNom => "man" ;
-      PAcc => "en" ;
-      PGen _ => "ens"
-      } ;
-    g = Utr ; n = Sg ; p = P3
-    } ;
-
   npDet : NounPhrase = nameNounPhrase (mkProperName "det" NNeutr) ;
 
   mkAdjForm : Species -> Number -> NounGender -> AdjFormPos = \b,n,g ->