mirror of
https://github.com/GrammaticalFramework/gf-rgl.git
synced 2026-06-25 02:56:28 -06:00
(Ger) Corrections of determiners in Structural, DetQuantOrd in Noun. Additions to Extend
This commit is contained in:
Hans Leiss
+288
-185
@@ -2,15 +2,19 @@
|
||||
|
||||
concrete ExtendGer of Extend =
|
||||
CatGer ** ExtendFunctor
|
||||
- [
|
||||
InOrderToVP,
|
||||
VPS, ListVPS, VPI, ListVPI, RNP, RNPList,
|
||||
MkVPS, BaseVPS, ConsVPS, ConjVPS, PredVPS,
|
||||
MkVPI, BaseVPI, ConsVPI, ConjVPI, ComplVPIVV,
|
||||
ComplSlashPartLast,
|
||||
Base_nr_RNP, Base_rn_RNP, Base_rr_RNP, Conj_RNP,
|
||||
CardCNCard, CompoundN,
|
||||
PassVPSlash, PassAgentVPSlash, PastPartAP, PastPartAgentAP
|
||||
- [ -- remove the default implementations of:
|
||||
GenNP, EmptyRelSlash,
|
||||
VPS, ListVPS, MkVPS, BaseVPS, ConsVPS, ConjVPS, PredVPS,
|
||||
VPI, ListVPI, MkVPI, BaseVPI, ConsVPI, ConjVPI, ComplVPIVV,
|
||||
ICompAP, IAdvAdv, CompIQuant, PrepCN,
|
||||
PastPartAP, PastPartAgentAP,
|
||||
PassVPSlash, PassAgentVPSlash,
|
||||
AdvIsNP,
|
||||
RNP, RNPList, Base_rr_RNP, Base_nr_RNP, Base_rn_RNP, Cons_rr_RNP, Cons_nr_RNP, Conj_RNP,
|
||||
ReflRNP, ReflPron, ReflPoss, PredetRNP, AdvRNP, ReflA2RNP, PossPronRNP,
|
||||
CompoundN, DetNPMasc, DetNPFem, UseDAP, UseDAPMasc, UseDAPFem,
|
||||
CardCNCard,
|
||||
InOrderToVP
|
||||
]
|
||||
with
|
||||
(Grammar = GrammarGer) **
|
||||
@@ -19,7 +23,22 @@ concrete ExtendGer of Extend =
|
||||
ResGer,
|
||||
Coordination,
|
||||
Prelude,
|
||||
ParadigmsGer in {
|
||||
(P = ParadigmsGer) in {
|
||||
|
||||
lin
|
||||
GenNP np = {
|
||||
s,sp = \\gn,c => np.s ! False ! Gen ++ np.ext ++ np.rc ;
|
||||
a = Strong ;
|
||||
isDefArt = False ;
|
||||
delCardOne = False
|
||||
} ;
|
||||
|
||||
EmptyRelSlash slash = {
|
||||
s = \\m,t,a,p,gn =>
|
||||
appPrep slash.c2 (relPron ! gn) ++ slash.s ! m ! t ! a ! p ! Sub ;
|
||||
c = slash.c2.c
|
||||
} ;
|
||||
|
||||
|
||||
lincat
|
||||
VPI = {s : Bool => Str} ;
|
||||
@@ -27,37 +46,13 @@ concrete ExtendGer of Extend =
|
||||
VPS = {s : Order => Agr => Str} ;
|
||||
[VPS] = {s1,s2 : Order => Agr => Str} ;
|
||||
|
||||
lin
|
||||
|
||||
InOrderToVP vp = {s = "um" ++ useInfVP False vp} ;
|
||||
|
||||
lin
|
||||
BaseVPI = twoTable Bool ;
|
||||
ConsVPI = consrTable Bool comma ;
|
||||
|
||||
MkVPI vp = {s = \\b => useInfVP b vp} ;
|
||||
ConjVPI = conjunctDistrTable Bool ;
|
||||
|
||||
ComplVPIVV v vpi =
|
||||
insertInf {inpl = <\\_ => [], (vpi.s ! v.isAux)> ; extr = \\_ => []} -- HL 3/22
|
||||
(predVGen v.isAux v) ;
|
||||
|
||||
BaseVPS = twoTable2 Order Agr ;
|
||||
ConsVPS = consrTable2 Order Agr comma ;
|
||||
|
||||
PredVPS np vpi =
|
||||
let
|
||||
subj = np.s ! False ! Nom ++ bigNP np ;
|
||||
agr = np.a ;
|
||||
in {
|
||||
s = \\o =>
|
||||
let verb = vpi.s ! o ! agr
|
||||
in case o of {
|
||||
Main => subj ++ verb ;
|
||||
Inv => verb ++ subj ; ---- älskar henne och sover jag
|
||||
Sub => subj ++ verb
|
||||
}
|
||||
} ;
|
||||
|
||||
MkVPS tm p vp =
|
||||
let vps = useVP vp in {
|
||||
s = \\o,agr =>
|
||||
@@ -115,7 +110,251 @@ lin
|
||||
} ;
|
||||
|
||||
ConjVPS = conjunctDistrTable2 Order Agr ;
|
||||
|
||||
PredVPS np vpi =
|
||||
let
|
||||
subj = np.s ! False ! Nom ++ bigNP np ;
|
||||
agr = np.a ;
|
||||
in {
|
||||
s = \\o =>
|
||||
let verb = vpi.s ! o ! agr
|
||||
in case o of {
|
||||
Main => subj ++ verb ;
|
||||
Inv => verb ++ subj ; ---- älskar henne och sover jag
|
||||
Sub => subj ++ verb
|
||||
}
|
||||
} ;
|
||||
|
||||
-- existentials that work in the absence of Cl
|
||||
|
||||
MkVPI vp = {s = \\b => useInfVP b vp} ;
|
||||
|
||||
ConjVPI = conjunctDistrTable Bool ;
|
||||
|
||||
ComplVPIVV v vpi =
|
||||
insertInf {inpl = <\\_ => [], (vpi.s ! v.isAux)> ; extr = \\_ => []} -- HL 3/22
|
||||
(predVGen v.isAux v) ;
|
||||
|
||||
-- the same for VPSlash, taking a complement with shared V2 verbs
|
||||
|
||||
-- Conjunction of copula complements
|
||||
|
||||
-- Conjunction of imperatives
|
||||
|
||||
ICompAP ap = {
|
||||
s = \\_ => "wie" ++ ap.s ! APred ;
|
||||
ext = ap.c.p1 ++ ap.c.p2 ++ ap.ext
|
||||
} ;
|
||||
|
||||
IAdvAdv adv = {s = "wie" ++ adv.s} ;
|
||||
|
||||
CompIQuant iq = {
|
||||
s = \\a => iq.s ! (gennum (genderAgr a) (numberAgr a))! Nom ;
|
||||
ext = ""
|
||||
} ;
|
||||
|
||||
PrepCN prep cn = {
|
||||
s = prep.s ! GPl ++ cn.s ! Strong ! Sg ! prep.c ++ cn.adv ++ cn.rc ! Sg ++ cn.ext} ;
|
||||
|
||||
-- fronted/focal constructions, only for main clauses
|
||||
|
||||
-- participle constructions
|
||||
|
||||
PastPartAP vp =
|
||||
let a = agrP3 Sg in {
|
||||
s = \\af => (vp.nn ! a).p1 ++ (vp.nn ! a).p2 ++ (vp.nn ! a).p3 ++ vp.a2 ++ vp.adj
|
||||
++ vp.inf.inpl.p2 ++ (vp.inf.extr ! a) ++ vp.s.s ! VPastPart af ;
|
||||
isPre = True ;
|
||||
c = <[],[]> ;
|
||||
ext = vp.ext
|
||||
} ;
|
||||
|
||||
PastPartAgentAP vp np =
|
||||
let a = agrP3 Sg ;
|
||||
agent = appPrepNP P.von_Prep np
|
||||
in {
|
||||
s = \\af => (vp.nn ! a).p1 ++ (vp.nn ! a).p2 ++ (vp.nn ! a).p3
|
||||
++ vp.a2 ++ agent ++ vp.adj ++ vp.inf.inpl.p2
|
||||
++ vp.c2.s ! GPl -- junk if not TV
|
||||
++ vp.ext ++ (vp.inf.extr ! a) ++ vp.s.s ! VPastPart af ;
|
||||
isPre = True ;
|
||||
c = <[],[]> ;
|
||||
ext = []
|
||||
} ;
|
||||
|
||||
-- this is a generalization of Verb.PassV2 and should replace it in the future.
|
||||
|
||||
PassVPSlash vp =
|
||||
insertObj (\\_ => (PastPartAP vp).s ! APred) (predV werdenPass) **
|
||||
{ c1 = subjPrep vp.c2 } ;
|
||||
-- this also gives "mit dir wird gerechnet" ;
|
||||
-- the alternative linearisation ("es wird mit dir gerechnet") is not implemented
|
||||
|
||||
PassAgentVPSlash vp np = ---- "von" here, "durch" in StructuralGer
|
||||
insertObj (\\_ => (PastPartAgentAP (lin VPSlash vp) (lin NP np)).s ! APred) (predV werdenPass) ;
|
||||
|
||||
-- publishing of the document
|
||||
|
||||
-- counterpart to ProgrVP, for VPSlash
|
||||
|
||||
-- construct VPSlash from A2 and N2
|
||||
|
||||
-- existential for mathematics
|
||||
|
||||
-- existentials with a/no variation
|
||||
|
||||
-- generalisation of existential, with adverb as an argument
|
||||
|
||||
AdvIsNP adv np = let comp : Agr => Str = \\agr => np.s ! False ! Nom ++ np.rc ++ np.ext in
|
||||
mkClause adv.s np.a (insertObj comp (predV sein_V)) ; -- HL 12/2023, prelim, wrong order
|
||||
|
||||
-- infinitive for purpose AR 21/8/2013
|
||||
|
||||
-- object S without "that"
|
||||
|
||||
-- front the extraposed part
|
||||
|
||||
-- proper structure of "it is AP to VP"
|
||||
|
||||
-- to use an AP as CN or NP without CN
|
||||
|
||||
-- infinitive complement for IAdv
|
||||
|
||||
-- alternative to EmbedQS. For English, EmbedQS happens to work,
|
||||
|
||||
-- Reflexive noun phrases -- (HL 5/2022: improved and completed, RNPList added)
|
||||
|
||||
lincat
|
||||
RNP = {s : Agr => Case => Str ; rc,ext : Str ; isPron : Bool} ;
|
||||
RNPList = {s1,s2 : Agr => Case => Str} ;
|
||||
|
||||
linref
|
||||
RNP = \rnp -> rnp.s ! AgSgP3 Masc ! Acc ++ rnp.ext ++ rnp.rc ;
|
||||
|
||||
lin
|
||||
ReflRNP vps rnp =
|
||||
insertObjReflNP (lin RNP rnp) vps ;
|
||||
|
||||
ReflPron = { -- with personal pronoun nominative
|
||||
s = ResGer.reflPron ; rc,ext = [] ; isPron = True } ;
|
||||
|
||||
-- To distinguish personal pronoun from reflexive pronoun:
|
||||
-- du kennst mich vs. ich kenne mich selbst
|
||||
-- er kennt ihn vs. er kennt sich (selbst)
|
||||
-- sie kennen sich (selbst) =/= sie kennen einander
|
||||
-- we might define ReflPron by the stronger
|
||||
-- oper
|
||||
-- reflPronSelf : Agr => Case => Str =
|
||||
-- \\a => \\c => reflPron ! a ! c ++ "selbst" ;
|
||||
|
||||
lin
|
||||
ReflPoss num cn =
|
||||
{s = \\a,c => let adjf = case num.n of {Sg => Strong ; Pl => Weak} -- Duden 477, HL 5/2022
|
||||
in possPron a num.n cn.g c
|
||||
++ num.s ! AMod (gennum cn.g num.n) c -- HL 5/2022: meine wenigstens 3 cn,
|
||||
++ cn.s ! adjfCase adjf c ! num.n ! c -- not: wenigstens 3 meine cn
|
||||
++ cn.adv ;
|
||||
ext = cn.ext ; rc = cn.rc ! num.n ;
|
||||
isPron = False} ;
|
||||
|
||||
-- To distinguish possessive pronoun from reflexive possessive pronoun:
|
||||
-- du kennst meine Fehler vs. ich kenne meine eigenen Fehler
|
||||
-- er|sie|es kennt seine|ihre Fehler vs. er|sie|es kennt seine|ihre|seine eigenen Fehler
|
||||
-- we might define ReflPoss by the stronger
|
||||
-- oper
|
||||
-- reflPossPron : Agr -> Number -> Gender -> Case -> Str =
|
||||
-- let eigen = adjForms "eigen" "eigen" in
|
||||
-- \a,n,g,c -> possPron a n g c ++ (eigen ! (AMod (gennum g n) c)) ;
|
||||
|
||||
PredetRNP pred rnp = rnp ** { -- HL 5/2022
|
||||
s = \\a,c => let n : Number = case pred.a of {PAg n => n ; _ => numberAgr a} ;
|
||||
g : Gender = genderAgr a ;
|
||||
d = case pred.c.k of {NoCase => c ; PredCase k => k} ;
|
||||
in case rnp.isPron of {
|
||||
True => pred.s ! Pl ! Masc ! c ++ "von" ++ rnp.s ! a ! Dat ;
|
||||
_ => pred.s ! n ! genderAgr a ! c ++ pred.c.p ++ rnp.s ! a ! d} ;
|
||||
ext = rnp.ext ; rc = rnp.rc ;
|
||||
isPron = False} ;
|
||||
-- ok: alle von uns; die meisten von uns ; wrong: *nur von uns =/= nur wir
|
||||
|
||||
AdvRNP np prep rnp = {s = \\a,c => np.s ! False ! c
|
||||
++ appPrep prep (rnp.s ! a) ++ rnp.ext ++ rnp.rc ;
|
||||
ext = np.ext ; rc = np.rc ; isPron = False} ;
|
||||
|
||||
AdvRAP ap prep rnp =
|
||||
let -- ? adv ++ ap.s ! af
|
||||
adv = appPrep prep (rnp.s ! agrP3 Sg) ; -- bug: fixed agreement
|
||||
in ap ** { s = \\af => ap.s ! af ++ adv } ; -- e.g. unknown in one's youth
|
||||
|
||||
ReflA2RNP adj rnp = -- would need AP.c : Agr => Str*Str, not AP.c : Str*Str
|
||||
let -- as we have no reflexive AP,
|
||||
compl = appPrep adj.c2 (rnp.s ! agrP3 Sg) ; -- we use a fixed agreement
|
||||
in {
|
||||
s = adj.s ! Posit ;
|
||||
isPre = True ;
|
||||
c = case adj.c2.t of {isCase => <compl, []> ; _ => <[], compl>} ;
|
||||
ext = rnp.ext ++ rnp.rc
|
||||
} ;
|
||||
|
||||
PossPronRNP pron num cn rnp =
|
||||
GrammarGer.DetCN (GrammarGer.DetQuant (GrammarGer.PossPron pron) num)
|
||||
(GrammarGer.PossNP cn (lin NP {s = \\_,c => rnp.s ! pron.a ! c ;
|
||||
a = pron.a ;
|
||||
w = WLight ;
|
||||
ext = rnp.ext ;
|
||||
rc = rnp.rc})) ;
|
||||
|
||||
-- AdvRVP : VP -> Prep -> RNP -> VP not implemented, as the reflexive adverb (Prep + RNP): Agr => Str
|
||||
-- could only be added to vp.a2:Str with fixed agreement, but can depend on nominal subject or object,
|
||||
-- e.g. "er spricht mit ihr über sein Kind" vs. "er spricht mit ihr über ihr Kind".
|
||||
|
||||
ConjRNP conj rnps = conjunctDistrTable2 Agr Case conj rnps
|
||||
** {isPron = False ; ext,rc = []} ;
|
||||
|
||||
Base_rr_RNP x y = twoTable2 Agr Case x y ;
|
||||
Base_nr_RNP x y = twoTable2 Agr Case {s = \\_,c => x.s ! False ! c ++ x.ext ++ x.rc} y ;
|
||||
Base_rn_RNP x y = twoTable2 Agr Case x {s = \\_,c => y.s ! False ! c ++ y.ext ++ y.rc} ;
|
||||
|
||||
Cons_rr_RNP x xs = consrTable2 Agr Case comma x xs ;
|
||||
Cons_nr_RNP x xs = consrTable2 Agr Case comma {s = \\_,c => x.s ! False ! c ++ x.ext ++ x.rc} xs ;
|
||||
|
||||
-- reflexive possessive on its own right, like in Swedish, Czech, Slovak
|
||||
|
||||
--- from Extensions
|
||||
|
||||
CompoundN a x =
|
||||
let s = a.co in lin N {
|
||||
s = \\n,c => s ++ Predef.BIND ++ x.uncap.s ! n ! c ;
|
||||
co = s ++ Predef.BIND ++ x.uncap.co ;
|
||||
uncap = {
|
||||
s = \\n,c => a.uncap.co ++ Predef.BIND ++ x.uncap.s ! n ! c ;
|
||||
co = a.uncap.co ++ Predef.BIND ++ x.uncap.co ;
|
||||
} ;
|
||||
g = x.g
|
||||
} ;
|
||||
|
||||
-- very language-specific things
|
||||
|
||||
-- Romance
|
||||
|
||||
DetNPMasc det = {
|
||||
s = \\b,c => det.sp ! b ! Masc ! c ;
|
||||
a = agrgP3 Masc det.n ;
|
||||
w = case det.isDef of {True => WLight ; _ => WHeavy} ;
|
||||
ext, rc = []
|
||||
} ;
|
||||
|
||||
DetNPFem det = {
|
||||
s = \\b,c => det.sp ! b ! Fem ! c ;
|
||||
a = agrgP3 Fem det.n ;
|
||||
w = case det.isDef of {True => WLight ; _ => WHeavy} ;--WLight ;
|
||||
ext, rc = []
|
||||
} ;
|
||||
|
||||
-- German
|
||||
|
||||
-- UseDAP replaces DetNP from the RGL which is more limited.
|
||||
|
||||
UseDAP det = {
|
||||
s = \\b,c => det.sp ! Neutr ! c ;
|
||||
a = agrP3 det.n ;
|
||||
@@ -137,168 +376,32 @@ lin
|
||||
rc, ext = []
|
||||
} ;
|
||||
|
||||
lin
|
||||
CardCNCard card cn = {
|
||||
s = \\g,c =>
|
||||
(Grammar.DetCN (Grammar.DetQuant Grammar.IndefArt (Grammar.NumCard card)) cn).s ! False ! c ;
|
||||
n = Pl
|
||||
} ;
|
||||
|
||||
lin PassVPSlash vp =
|
||||
insertObj (\\_ => (PastPartAP vp).s ! APred) (predV werdenPass) **
|
||||
{ c1 = subjPrep vp.c2 } ;
|
||||
-- this also gives "mit dir wird gerechnet" ;
|
||||
-- the alternative linearisation ("es wird mit dir gerechnet") is not implemented
|
||||
|
||||
lin PassAgentVPSlash vp np = ---- "von" here, "durch" in StructuralGer
|
||||
insertObj (\\_ => (PastPartAgentAP (lin VPSlash vp) (lin NP np)).s ! APred) (predV werdenPass) ;
|
||||
|
||||
lin PastPartAP vp =
|
||||
let a = agrP3 Sg in {
|
||||
s = \\af => (vp.nn ! a).p1 ++ (vp.nn ! a).p2 ++ (vp.nn ! a).p3 ++ vp.a2 ++ vp.adj
|
||||
++ vp.inf.inpl.p2 ++ (vp.inf.extr ! a) ++ vp.s.s ! VPastPart af ;
|
||||
isPre = True ;
|
||||
c = <[],[]> ;
|
||||
ext = vp.ext
|
||||
CardCNCard card cn = {
|
||||
s = let det = (Grammar.DetQuant Grammar.IndefArt (Grammar.NumCard card)) ;
|
||||
np = (Grammar.DetCN det cn).s ! False
|
||||
in table{APred => np ! Nom ; AMod gn c => np ! c} ; -- HL 12/2023
|
||||
n = Pl
|
||||
} ;
|
||||
|
||||
lin PastPartAgentAP vp np =
|
||||
let a = agrP3 Sg ;
|
||||
agent = appPrepNP von_Prep np
|
||||
in {
|
||||
s = \\af => (vp.nn ! a).p1 ++ (vp.nn ! a).p2 ++ (vp.nn ! a).p3
|
||||
++ vp.a2 ++ agent ++ vp.adj ++ vp.inf.inpl.p2
|
||||
++ vp.c2.s ! GPl -- junk if not TV
|
||||
++ vp.ext ++ (vp.inf.extr ! a) ++ vp.s.s ! VPastPart af ;
|
||||
isPre = True ;
|
||||
c = <[],[]> ;
|
||||
ext = []
|
||||
} ;
|
||||
|
||||
lin CompoundN a x =
|
||||
let s = a.co in
|
||||
lin N {
|
||||
s = \\n,c => s ++ Predef.BIND ++ x.uncap.s ! n ! c ;
|
||||
co = s ++ Predef.BIND ++ x.uncap.co ;
|
||||
uncap = {
|
||||
s = \\n,c => a.uncap.co ++ Predef.BIND ++ x.uncap.s ! n ! c ;
|
||||
co = a.uncap.co ++ Predef.BIND ++ x.uncap.co ;
|
||||
} ;
|
||||
g = x.g
|
||||
} ;
|
||||
InOrderToVP vp = {s = "um" ++ useInfVP False vp} ;
|
||||
|
||||
|
||||
-- Reflexive noun phrases -- (HL 5/2022: improved and completed, RNPList added)
|
||||
|
||||
lincat
|
||||
RNP = {s : Agr => Case => Str ; rc,ext : Str ; isPron : Bool} ; -- Case, not PCase !!!
|
||||
RNPList = {s1,s2 : Agr => Case => Str} ;
|
||||
|
||||
linref
|
||||
RNP = \rnp -> rnp.s ! AgSgP3 Masc ! Acc ++ rnp.ext ++ rnp.rc ;
|
||||
|
||||
lin
|
||||
ReflRNP vps rnp =
|
||||
insertObjReflNP rnp vps ;
|
||||
|
||||
ReflPron = { -- with personal pronoun nominative
|
||||
s = ResGer.reflPron ; rc,ext = [] ; isPron = True } ;
|
||||
|
||||
-- We might define ReflPron by the stronger reflPronSelf below, using "selbst"
|
||||
-- to distinguish personal pronoun from reflexive pronoun:
|
||||
-- du kennst mich vs. ich kenne mich selbst
|
||||
-- er kennt ihn vs. er kennt sich (selbst)
|
||||
-- sie kennen sich (selbst) =/= sie kennen einander
|
||||
|
||||
ReflPoss num cn =
|
||||
{s = \\a,c => let adjf = case num.n of {Sg => Strong ; Pl => Weak} -- Duden 477, HL 5/2022
|
||||
in possPron a num.n cn.g c ++ num.s ! cn.g ! c -- HL 5/2022: meine wenigstens 3 cn,
|
||||
++ cn.s ! adjfCase adjf c ! num.n ! c -- not: wenigstens 3 meine cn
|
||||
++ cn.adv ;
|
||||
ext = cn.ext ; rc = cn.rc ! num.n ;
|
||||
isPron = False} ;
|
||||
|
||||
-- We might define ReflPoss by the stronger reflPossPron below, using "eigen(er)"
|
||||
-- to distinguish possessive pronoun from reflexive possessive pronoun:
|
||||
-- du kennst meine Fehler vs. ich kenne meine eigenen Fehler
|
||||
-- er|sie|es kennt seine|ihre Fehler vs. er|sie|es kennt seine|ihre|seine eigenen Fehler
|
||||
|
||||
PredetRNP pred rnp = rnp ** { -- HL 5/2022
|
||||
s = \\a,c => let n : Number = case pred.a of {PAg n => n ; _ => numberAgr a} ;
|
||||
g : Gender = genderAgr a ;
|
||||
d = case pred.c.k of {NoCase => c ; PredCase k => (prepC k).c} ;
|
||||
in case rnp.isPron of {
|
||||
True => pred.s ! Pl ! Masc ! c ++ "von" ++ rnp.s ! a ! Dat ;
|
||||
_ => pred.s ! n ! genderAgr a ! c ++ pred.c.p ++ rnp.s ! a ! d} ;
|
||||
ext = rnp.ext ; rc = rnp.rc ;
|
||||
isPron = False} ;
|
||||
-- ok: alle von uns; die meisten von uns ; wrong: *nur von uns =/= nur wir
|
||||
{-
|
||||
AdvRNP np prep rnp = {s = \\a,c => np.s ! c
|
||||
++ appPrep prep (rnp.s ! a) ++ rnp.ext ++ rnp.rc ;
|
||||
ext = np.ext ; rc = np.rc ; isPron = False} ;
|
||||
|
||||
AdvRAP ap prep rnp =
|
||||
let -- ? adv ++ ap.s ! af
|
||||
adv = appPrep prep (rnp.s ! agrP3 Sg) ; -- bug: fixed agreement
|
||||
in ap ** { s = \\af => ap.s ! af ++ adv } ; -- e.g. unknown in one's youth
|
||||
|
||||
ReflA2RNP adj rnp = -- would need AP.c : Agr => Str*Str, not AP.c : Str*Str
|
||||
let -- as we have no reflexive AP,
|
||||
compl = appPrep adj.c2 (rnp.s ! agrP3 Sg) ; -- we use a fixed agreement
|
||||
in {
|
||||
s = adj.s ! Posit ;
|
||||
isPre = True ;
|
||||
c = case adj.c2.t of {False => <compl, []> ; True => <[], compl>} ;
|
||||
ext = rnp.ext ++ rnp.rc
|
||||
} ;
|
||||
|
||||
PossPronRNP pron num cn rnp =
|
||||
GrammarGer.DetCN (GrammarGer.DetQuant (GrammarGer.PossPron pron) num)
|
||||
(GrammarGer.PossNP cn (lin NP {s = \\pc => -- usePrepC pc (\c -> rnp.s ! pron.a ! c) ;
|
||||
rnp.s ! pron.a ! pc ;
|
||||
a = pron.a ;
|
||||
w = WLight ;
|
||||
ext = rnp.ext ;
|
||||
rc = rnp.rc})) ;
|
||||
|
||||
-- AdvRVP : VP -> Prep -> RNP -> VP not implemented, as the reflexive adverb (Prep + RNP): Agr => Str
|
||||
-- could only be added to vp.a2:Str with fixed agreement, but can depend on nominal subject or object,
|
||||
-- e.g. "er spricht mit ihr über sein Kind" vs. "er spricht mit ihr über ihr Kind".
|
||||
-}
|
||||
ConjRNP conj rnps = conjunctDistrTable2 Agr Case conj rnps
|
||||
** {isPron = False ; ext,rc = []} ;
|
||||
|
||||
Base_rr_RNP x y = twoTable2 Agr Case x y ;
|
||||
Base_nr_RNP x y = twoTable2 Agr Case {s = \\_,c => x.s ! False ! c ++ x.ext ++ x.rc} y ;
|
||||
Base_rn_RNP x y = twoTable2 Agr Case x {s = \\_,c => y.s ! False ! c ++ y.ext ++ y.rc} ;
|
||||
|
||||
Cons_rr_RNP x xs = consrTable2 Agr Case comma x xs ;
|
||||
Cons_nr_RNP x xs = consrTable2 Agr Case comma {s = \\_,c => x.s ! False ! c ++ x.ext ++ x.rc} xs ;
|
||||
{-
|
||||
oper
|
||||
-- reflPronSelf : Agr => Case => Str = \\a => \\c => reflPron ! a ! c ++ "selbst" ;
|
||||
|
||||
-- reflPossPron : Agr -> Number -> Gender -> Case -> Str =
|
||||
-- let eigen = adjForms "eigen" "eigen" in
|
||||
-- \a,n,g,c -> possPron a n g c ++ (eigen ! (AMod (gennum g n) c)) ;
|
||||
|
||||
insertObjReflNP : RNP -> ResGer.VPSlash -> ResGer.VP = -- HL 5/2022
|
||||
\rnp,vp -> insertObjRNP rnp vp.c2 vp ;
|
||||
|
||||
insertObjRNP : RNP -> Preposition -> ResGer.VPSlash -> ResGer.VP = -- HL 5/2022
|
||||
\rnp,prep,vp -> -- generalize ResGer.insertObjRefl
|
||||
let -- prep = vp.c2 ;
|
||||
c = case prep.c of { NPC cc => cc ; _ => Acc } ; -- put rnp.ext ++ rnp.rc to vp.ext ?
|
||||
obj : Agr => Str = \\a => prep.s ++ rnp.s ! a ! c ++ rnp.ext ++ rnp.rc
|
||||
let
|
||||
obj : Agr => Str = \\a => prep.s ! GPl ++ rnp.s ! a ! prep.c ++ rnp.ext ++ rnp.rc
|
||||
in vp ** {
|
||||
nn = \\a =>
|
||||
let vpnn = vp.nn ! a in
|
||||
case <prep.t, rnp.isPron, c> of { -- consider non-pron rnp as light, add to vpnn.p2
|
||||
<False,True,Acc> => <obj ! a ++ vpnn.p1, vpnn.p2, vpnn.p3, vpnn.p4> ; -- pronoun switch:
|
||||
<False,True,_> => <vpnn.p1 ++ obj ! a, vpnn.p2, vpnn.p3, vpnn.p4> ; -- accPron < pron
|
||||
<False,False,_> => <vpnn.p1, vpnn.p2 ++ obj ! a, vpnn.p3, vpnn.p4> ; -- < non-pron nominal
|
||||
<True,_,_> => <vpnn.p1, vpnn.p2, vpnn.p3 ++ obj ! a, vpnn.p4> } -- or prepositional
|
||||
case <prep.t, rnp.isPron, prep.c> of { -- consider non-pron rnp as light, add to vpnn.p2
|
||||
<isCase,True,Acc> => <obj ! a ++ vpnn.p1, vpnn.p2, vpnn.p3, vpnn.p4> ; -- pronoun switch:
|
||||
<isCase,True,_> => <vpnn.p1 ++ obj ! a, vpnn.p2, vpnn.p3, vpnn.p4> ; -- accPron < pron
|
||||
<isCase,False,_> => <vpnn.p1, vpnn.p2 ++ obj ! a, vpnn.p3, vpnn.p4> ; -- < non-pron nominal
|
||||
<_,_,_> => <vpnn.p1, vpnn.p2, vpnn.p3 ++ obj ! a, vpnn.p4> } -- or prepositional
|
||||
} ;
|
||||
-}
|
||||
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user