msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity

modified Det structure; integrated scand definites.

Browse Source
This commit is contained in:
aarne
2006-01-12 23:03:25 +00:00
parent ec2cf7c4d4
commit 621ca0c43d
6 changed files with 104 additions and 60 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
lib/resource-1.0/abstract/Noun.gf
View File

@@ -16,20 +16,22 @@ abstract Noun = Cat ** {
UsePN : PN -> NP ; -- John UsePN : PN -> NP ; -- John
UsePron : Pron -> NP ; -- he UsePron : Pron -> NP ; -- he
-- Pronouns are given in the module [Structural Structural.html]. -- Pronouns are defined in the module [Structural Structural.html].
-- A noun phrase already formed can be modified by a Predeterminer.
PredetNP : Predet -> NP -> NP; -- only the man
--2 Determiners --2 Determiners
-- The determiner has a fine-grained structure, in which four -- The determiner has a fine-grained structure, in which a 'nucleus'
-- different optional parts can be discerned. The noun phrase -- quantifier and two optional parts can be discerned.
-- "all my first forty books" shows each of these parts.
-- The cardinal numeral is only available for plural determiners. -- The cardinal numeral is only available for plural determiners.
-- (This is modified from CLE by further dividing their $Num$ into -- (This is modified from CLE by further dividing their $Num$ into
-- cardinal and ordinal.) -- cardinal and ordinal.)
DetSg : Predet -> QuantSg -> Ord -> Det ; DetSg : QuantSg -> Ord -> Det ; -- this best man
DetPl : Predet -> QuantPl -> Num -> Ord -> Det ; DetPl : QuantPl -> Num -> Ord -> Det ; -- these five best men
-- Pronouns have possessive forms. Genitives of other kinds -- Pronouns have possessive forms. Genitives of other kinds
-- of noun phrases are not given here, since they are not possible -- of noun phrases are not given here, since they are not possible
@@ -41,9 +43,8 @@ abstract Noun = Cat ** {
-- All parts of the determiner can be empty, except $Quant$, which is -- All parts of the determiner can be empty, except $Quant$, which is
-- the "kernel" of a determiner. -- the "kernel" of a determiner.
NoPredet : Predet ; NoNum : Num ;
NoNum : Num ; NoOrd : Ord ;
NoOrd : Ord ;
-- $Num$ consists of either digits or numeral words. -- $Num$ consists of either digits or numeral words.

15
lib/resource-1.0/english/NounEng.gf
View File

@@ -10,20 +10,25 @@ concrete NounEng of Noun = CatEng ** open ResEng, Prelude in {
UsePN pn = pn ** {a = agrP3 Sg} ; UsePN pn = pn ** {a = agrP3 Sg} ;
UsePron p = p ; UsePron p = p ;
DetSg pred quant ord = { PredetNP pred np = {
s = pred.s ++ quant.s ++ ord.s ; s = \\c => pred.s ++ np.s ! c ;
a = np.a
} ;
DetSg quant ord = {
s = quant.s ++ ord.s ;
n = Sg n = Sg
} ; } ;
DetPl pred quant num ord = { DetPl quant num ord = {
s = pred.s ++ quant.s ++ num.s ++ ord.s ; s = quant.s ++ num.s ++ ord.s ;
n = Pl n = Pl
} ; } ;
PossSg p = {s = p.s ! Gen} ; PossSg p = {s = p.s ! Gen} ;
PossPl p = {s = p.s ! Gen} ; PossPl p = {s = p.s ! Gen} ;
NoPredet, NoNum, NoOrd = {s = []} ; NoNum, NoOrd = {s = []} ;
NumInt n = n ; NumInt n = n ;
OrdInt n = {s = n.s ++ "th"} ; --- OrdInt n = {s = n.s ++ "th"} ; ---

15
lib/resource-1.0/german/NounGer.gf
View File

@@ -10,27 +10,33 @@ concrete NounGer of Noun = CatGer ** open ResGer, Prelude in {
} ; } ;
UsePN pn = pn ** {a = agrP3 Sg} ; UsePN pn = pn ** {a = agrP3 Sg} ;
UsePron pron = { UsePron pron = {
s = \\c => pron.s ! NPCase c ; s = \\c => pron.s ! NPCase c ;
a = pron.a a = pron.a
} ; } ;
DetSg pred quant ord = PredetNP pred np = {
s = \\c => pred.s ! np.a.n ! Masc ! c ++ np.s ! c ; ---- g
a = np.a
} ;
DetSg quant ord =
let let
n = Sg ; n = Sg ;
a = quant.a a = quant.a
in { in {
s = \\g,c => pred.s ! n ! g ! c ++ quant.s ! g ! c ++ s = \\g,c => quant.s ! g ! c ++
ord.s ! agrAdj g (adjfCase a c) n c ; ord.s ! agrAdj g (adjfCase a c) n c ;
n = n ; n = n ;
a = a a = a
} ; } ;
DetPl pred quant num ord = DetPl quant num ord =
let let
n = Pl ; n = Pl ;
a = quant.a a = quant.a
in { in {
s = \\g,c => pred.s ! n ! g ! c ++ quant.s ! g ! c ++ s = \\g,c => quant.s ! g ! c ++
num.s ! g ! c ++ ord.s ! agrAdj g (adjfCase a c) n c ; num.s ! g ! c ++ ord.s ! agrAdj g (adjfCase a c) n c ;
n = n ; n = n ;
a = a a = a
@@ -48,7 +54,6 @@ concrete NounGer of Noun = CatGer ** open ResGer, Prelude in {
a = Weak a = Weak
} ; } ;
NoPredet = {s = \\_,_,_ => []} ;
NoNum = {s = \\_,_ => []} ; NoNum = {s = \\_,_ => []} ;
NoOrd = {s = \\_ => []} ; NoOrd = {s = \\_ => []} ;

17
lib/resource-1.0/scandinavian/CatScand.gf
View File

@@ -56,14 +56,19 @@ incomplete concrete CatScand of Cat =
-- Noun -- Noun
CN = {s : Number => DetSpecies => Case => Str ; g : Gender} ; -- The fields $isMod$ and $isDet$, and the boolean parameter of
-- determiners, are a hack (the simples possible we found) that
-- permits treating definite articles "huset - de fem husen - det gamla huset"
-- as $Quant$.
CN = {s : Number => DetSpecies => Case => Str ; g : Gender ; isMod : Bool} ;
NP,Pron = {s : NPForm => Str ; a : Agr} ; NP,Pron = {s : NPForm => Str ; a : Agr} ;
Det = {s : Gender => Str ; n : Number ; det : DetSpecies} ; Det = {s : Bool => Gender => Str ; n : Number ; det : DetSpecies} ;
QuantSg = {s : Gender => Str ; det : DetSpecies} ; QuantSg = {s : Bool => Gender => Str ; det : DetSpecies} ;
QuantPl = {s : Gender => Str ; det : DetSpecies} ; QuantPl = {s : Bool => Gender => Str ; det : DetSpecies} ;
Predet = {s : GenNum => Str} ; Predet = {s : GenNum => Str} ;
Num = {s : Gender => Str} ; Num = {s : Gender => Str ; isDet : Bool} ;
Ord = {s : Str} ; Ord = {s : Str ; isDet : Bool} ;
-- Adverb -- Adverb

78
lib/resource-1.0/scandinavian/NounScand.gf
View File

@@ -3,11 +3,18 @@ incomplete concrete NounScand of Noun =
flags optimize=all_subs ; flags optimize=all_subs ;
-- The rule defines $Det Quant Num Ord CN$ where $Det$ is empty if
-- it is the definite article ($DefSg$ or $DefPl$) and both $Num$ and
-- $Ord$ are empty and $CN$ is not adjectivally modified
-- ($AdjCN$). Thus we get $huset$ but $de fem husen$, $det gamla huset$.
lin lin
DetCN det cn = let g = cn.g in { DetCN det cn = let g = cn.g in {
s = \\c => det.s ! g ++ cn.s ! det.n ! det.det ! caseNP c ; s = \\c => det.s ! cn.isMod ! g ++
cn.s ! det.n ! det.det ! caseNP c ;
a = agrP3 g det.n a = agrP3 g det.n
} ; } ;
UsePN pn = { UsePN pn = {
s = \\c => pn.s ! caseNP c ; s = \\c => pn.s ! caseNP c ;
a = agrP3 pn.g Sg a = agrP3 pn.g Sg
@@ -15,80 +22,99 @@ incomplete concrete NounScand of Noun =
UsePron p = p ; UsePron p = p ;
DetSg pred quant ord = { PredetNP pred np = {
s = \\g => pred.s ! gennum g Sg ++ quant.s ! g ++ ord.s ; s = \\c => pred.s ! np.a.gn ++ np.s ! c ;
a = np.a
} ;
DetSg quant ord = {
s = \\b,g => quant.s ! (orB b ord.isDet) ! g ++ ord.s ;
n = Sg ; n = Sg ;
det = quant.det det = quant.det
} ; } ;
DetPl pred quant num ord = { DetPl quant num ord = {
s = \\g => pred.s ! gennum g Pl ++ quant.s ! g ++ num.s ! g ++ ord.s ; s = \\b,g => quant.s ! (orB b (orB num.isDet ord.isDet)) ! g ++ ord.s ;
n = Pl ; n = Pl ;
det = quant.det det = quant.det
} ; } ;
PossSg p = { PossSg p = {
s = \\g => p.s ! NPPoss (gennum g Sg) ; s = \\_,g => p.s ! NPPoss (gennum g Sg) ;
n = Sg ; n = Sg ;
det = DDef Indef det = DDef Indef
} ; } ;
PossPl p = { PossPl p = {
s = \\_ => p.s ! NPPoss Plg ; s = \\_,_ => p.s ! NPPoss Plg ;
n = Pl ; n = Pl ;
det = DDef Indef det = DDef Indef
} ; } ;
NoPredet, NoNum = {s = \\_ => []} ; -- these get different types! NoNum = {s = \\_ => [] ; isDet = False} ;
NoOrd = {s = []} ; NoOrd = {s = [] ; isDet = False} ;
NumInt n = {s = \\_ => n.s} ; NumInt n = {s = \\_ => n.s ; isDet = True} ;
OrdInt n = {s = n.s ++ ":e"} ; --- OrdInt n = {s = n.s ++ ":e" ; isDet = True} ; ---
NumNumeral numeral = {s = \\g => numeral.s ! NCard g} ; NumNumeral numeral = {s = \\g => numeral.s ! NCard g ; isDet = True} ;
OrdNumeral numeral = {s = numeral.s ! NOrd SupWeak} ; OrdNumeral numeral = {s = numeral.s ! NOrd SupWeak ; isDet = True} ;
AdNum adn num = {s = \\g => adn.s ++ num.s ! g} ; AdNum adn num = {s = \\g => adn.s ++ num.s ! g ; isDet = True} ;
OrdSuperl a = {s = a.s ! AF (ASuperl SupWeak) Nom} ; OrdSuperl a = {s = a.s ! AF (ASuperl SupWeak) Nom ; isDet = True} ;
DefSg = {s = \\g => artDef (gennum g Sg) ; n = Sg ; det = DDef detDef} ; DefSg = {
DefPl = {s = \\_ => artDef Plg ; n = Pl ; det = DDef detDef} ; s = \\b,g => if_then_Str b (artDef (gennum g Sg)) [] ;
n = Sg ;
det = DDef detDef
} ;
DefPl = {
s = \\b,_ => if_then_Str b (artDef Plg) [] ;
n = Pl ;
det = DDef detDef
} ;
IndefSg = {s = artIndef ; n = Sg ; det = DIndef} ; IndefSg = {s = \\_ => artIndef ; n = Sg ; det = DIndef} ;
IndefPl = {s = \\_ => [] ; n = Pl ; det = DIndef} ; IndefPl = {s = \\_,_ => [] ; n = Pl ; det = DIndef} ;
MassDet = {s = \\_ => [] ; n = Sg ; det = DIndef} ; MassDet = {s = \\_,_ => [] ; n = Sg ; det = DIndef} ;
UseN, UseN2, UseN3 = \noun -> { UseN, UseN2, UseN3 = \noun -> {
s = \\n,d => noun.s ! n ! specDet d ; s = \\n,d => noun.s ! n ! specDet d ;
g = noun.g g = noun.g ;
isMod = False
} ; } ;
-- The genitive of this $NP$ is not correct: "sonen till mig" (not "migs"). -- The genitive of this $NP$ is not correct: "sonen till mig" (not "migs").
ComplN2 f x = { ComplN2 f x = {
s = \\n,d,c => f.s ! n ! specDet d ! Nom ++ f.c2 ++ x.s ! accusative ; s = \\n,d,c => f.s ! n ! specDet d ! Nom ++ f.c2 ++ x.s ! accusative ;
g = f.g g = f.g ;
isMod = False
} ; } ;
ComplN3 f x = { ComplN3 f x = {
s = \\n,d,c => f.s ! n ! d ! Nom ++ f.c2 ++ x.s ! accusative ; s = \\n,d,c => f.s ! n ! d ! Nom ++ f.c2 ++ x.s ! accusative ;
g = f.g ; g = f.g ;
c2 = f.c3 c2 = f.c3 ;
isMod = False
} ; } ;
AdjCN ap cn = let g = cn.g in { AdjCN ap cn = let g = cn.g in {
s = \\n,d,c => preOrPost ap.isPre s = \\n,d,c => preOrPost ap.isPre
(ap.s ! agrAdj (gennum g n) d) (ap.s ! agrAdj (gennum g n) d)
(cn.s ! n ! d ! c) ; (cn.s ! n ! d ! c) ;
g = g g = g ;
isMod = True
} ; } ;
RelCN cn rs = let g = cn.g in { RelCN cn rs = let g = cn.g in {
s = \\n,d,c => cn.s ! n ! d ! c ++ rs.s ! agrP3 g n ; s = \\n,d,c => cn.s ! n ! d ! c ++ rs.s ! agrP3 g n ;
g = g g = g ;
isMod = cn.isMod
} ; } ;
SentCN cn sc = let g = cn.g in { SentCN cn sc = let g = cn.g in {
s = \\n,d,c => cn.s ! n ! d ! c ++ sc.s ; s = \\n,d,c => cn.s ! n ! d ! c ++ sc.s ;
g = g g = g ;
isMod = cn.isMod
} ; } ;
} }

20
lib/resource-1.0/swedish/StructuralSwe.gf
View File

@@ -25,7 +25,7 @@ concrete StructuralSwe of Structural = CatSwe **
during_Prep = ss "under" ; during_Prep = ss "under" ;
either7or_DConj = sd2 "antingen" "eller" ** {n = Sg} ; either7or_DConj = sd2 "antingen" "eller" ** {n = Sg} ;
everybody_NP = regNP "alla" "allas" Plg ; everybody_NP = regNP "alla" "allas" Plg ;
every_Det = {s = \\_ => "varje" ; n = Sg ; det = DDef Indef} ; every_Det = {s = \\_,_ => "varje" ; n = Sg ; det = DDef Indef} ;
everything_NP = regNP "allting" "alltings" SgNeutr ; everything_NP = regNP "allting" "alltings" SgNeutr ;
everywhere_Adv = ss "överallt" ; everywhere_Adv = ss "överallt" ;
from_Prep = ss "från" ; from_Prep = ss "från" ;
@@ -41,10 +41,10 @@ concrete StructuralSwe of Structural = CatSwe **
in_Prep = ss "i" ; in_Prep = ss "i" ;
it_Pron = regNP "det" "dess" SgNeutr ; it_Pron = regNP "det" "dess" SgNeutr ;
less_CAdv = ss "mindre" ; less_CAdv = ss "mindre" ;
many_Det = {s = \\_ => "många" ; n = Pl ; det = DDef Indef} ; many_Det = {s = \\_,_ => "många" ; n = Pl ; det = DDef Indef} ;
more_CAdv = ss "mer" ; more_CAdv = ss "mer" ;
most_Predet = {s = gennumForms ["den mesta"] ["det mesta"] ["de flesta"]} ; most_Predet = {s = gennumForms ["den mesta"] ["det mesta"] ["de flesta"]} ;
much_Det = {s = \\_ => "mycket" ; n = Pl ; det = DDef Indef} ; much_Det = {s = \\_,_ => "mycket" ; n = Pl ; det = DDef Indef} ;
must_VV = must_VV =
mkVerb6 "få" "måste" "få" "fick" "måst" "måst" ** {c2 = [] ; lock_VV = <>} ; mkVerb6 "få" "måste" "få" "fick" "måst" "måst" ** {c2 = [] ; lock_VV = <>} ;
no_Phr = ss ["Nej"] ; no_Phr = ss ["Nej"] ;
@@ -58,24 +58,26 @@ concrete StructuralSwe of Structural = CatSwe **
quite_Adv = ss "ganska" ; quite_Adv = ss "ganska" ;
she_Pron = mkNP "hon" "henne" "hennes" "hennes" "hennes" SgUtr P3 ; she_Pron = mkNP "hon" "henne" "hennes" "hennes" "hennes" SgUtr P3 ;
so_AdA = ss "så" ; so_AdA = ss "så" ;
someSg_Det = {s = genderForms "någon" "något" ; n = Sg ; det = DDef Indef} ; someSg_Det = {s = \\_ => genderForms "någon" "något" ; n = Sg ; det = DDef Indef} ;
somePl_Det = {s = \\_ => "några" ; n = Pl ; det = DDef Indef} ; somePl_Det = {s = \\_,_ => "några" ; n = Pl ; det = DDef Indef} ;
somebody_NP = regNP "någon" "någons" SgUtr ; somebody_NP = regNP "någon" "någons" SgUtr ;
something_NP = regNP "något" "någots" SgNeutr ; something_NP = regNP "något" "någots" SgNeutr ;
somewhere_Adv = ss "någonstans" ; somewhere_Adv = ss "någonstans" ;
that_Quant = {s = genderForms ["den där"] ["det där"] ; n = Sg ; det = DDef Def} ; that_Quant =
{s = \\_ => genderForms ["den där"] ["det där"] ; n = Sg ; det = DDef Def} ;
that_NP = regNP ["det där"] ["det därs"] SgNeutr ; that_NP = regNP ["det där"] ["det därs"] SgNeutr ;
there_Adv = ss "där" ; there_Adv = ss "där" ;
there7to_Adv = ss "dit" ; there7to_Adv = ss "dit" ;
there7from_Adv = ss "därifrån" ; there7from_Adv = ss "därifrån" ;
therefore_PConj = ss "därför" ; therefore_PConj = ss "därför" ;
these_NP = regNP ["de här"] ["det härs"] Plg ; these_NP = regNP ["de här"] ["det härs"] Plg ;
these_Quant = {s = \\_ => ["de här"] ; n = Pl ; det = DDef Def} ; these_Quant = {s = \\_,_ => ["de här"] ; n = Pl ; det = DDef Def} ;
they_Pron = mkNP "de" "dem" "deras" "deras" "deras" Plg P1 ; they_Pron = mkNP "de" "dem" "deras" "deras" "deras" Plg P1 ;
this_Quant = {s = genderForms ["den här"] ["det här"] ; n = Sg ; det = DDef Def} ; this_Quant =
{s = \\_ => genderForms ["den här"] ["det här"] ; n = Sg ; det = DDef Def} ;
this_NP = regNP ["det här"] ["det härs"] SgNeutr ; this_NP = regNP ["det här"] ["det härs"] SgNeutr ;
those_NP = regNP ["de där"] ["det därs"] Plg ; those_NP = regNP ["de där"] ["det därs"] Plg ;
those_Quant = {s = \\_ => ["de där"] ; n = Pl ; det = DDef Def} ; those_Quant = {s = \\_,_ => ["de där"] ; n = Pl ; det = DDef Def} ;
thou_Pron = mkNP "du" "dig" "din" "ditt" "dina" SgUtr P2 ; thou_Pron = mkNP "du" "dig" "din" "ditt" "dina" SgUtr P2 ;
through_Prep = ss "genom" ; through_Prep = ss "genom" ;
too_AdA = ss "för" ; too_AdA = ss "för" ;