1
0
forked from GitHub/gf-rgl

(Som) Ditransitive verbs

This commit is contained in:
Inari Listenmaa
2019-06-10 13:55:13 +02:00
parent a9bd48ccdd
commit 8c6be2e7b2
4 changed files with 58 additions and 54 deletions

View File

@@ -148,7 +148,7 @@ lin father_N2 = mkN2 (shortPossN (mkN "aabbe")) Gen ;
-- lin garden_N = mkN "" ; -- lin garden_N = mkN "" ;
lin girl_N = mkN "gabadh" "gabdho" fem ; lin girl_N = mkN "gabadh" "gabdho" fem ;
lin give_V3 = mkV3 "bixiyo" ; lin give_V3 = mkV3 "sii" ;
-- lin glove_N = mkN "" ; -- lin glove_N = mkN "" ;
-- lin go_V = joan_V ; -- lin go_V = joan_V ;
-- lin gold_N = mkN "" ; -- lin gold_N = mkN "" ;

View File

@@ -139,28 +139,27 @@ oper
a = Pl3 ; a = Pl3 ;
isPron = False isPron = False
} ; } ;
-------------------------------------------------------------------------------- --------------------------------------------------------------------------------
-- Pronouns -- Pronouns
-- De somaliska possessiva pronomenen, precis som de svenska, har två olika genusformer i singular och en enda form i plural.
-- ägaren då det ägda föremålet är
-- m.sg. f.sg.plural
-- kayga tayda kuwayga
-- kaaga taada kuwaaga
-- kiisa tiisa kuwiisa
-- keeda teeda kuweeda
--
-- kaayaga taayada kuwayaga (1 pl. exkl.)
-- keenna teenna kuweenna (1 pl. inkl.)
-- kiinna tiinna kuwiinna
-- kooda tooda kuwooda
Pronoun : Type = NounPhrase ** { Pronoun : Type = NounPhrase ** {
poss : { -- for PossPron : Pron -> Quant poss : { -- for PossPron : Pron -> Quant
--s, -- possessive suffix sp : GenNum => Str ; -- independent forms, e.g. M:kayga F:tayda Pl:kuwayga
sp : GenNum => Str ; -- independent forms s : Str ; -- short possessive suffix: e.g. family members, my/your name
s : Str ; -- special case: e.g. family members, name
v : Vowel} v : Vowel}
} ; } ;
-- Second series object pronouns, Sayeed p. 74-75
-- For two non-3rd person object pronouns, e.g. "They took you away from me"
secondObject : Agreement => Str = table {
Sg1 => "kay" ;
Sg2 => "kaa" ;
Pl1 Excl => "kayo" ;
Pl1 Incl => "keen" ;
Pl2 => "kiin" ;
_ => []
} ;
-------------------------------------------------------------------------------- --------------------------------------------------------------------------------
-- Det, Quant, Card, Ord -- Det, Quant, Card, Ord
@@ -536,6 +535,7 @@ oper
adv : Str ; adv : Str ;
c2, c3 : Preposition ; -- can combine together and with object pronoun(s?) c2, c3 : Preposition ; -- can combine together and with object pronoun(s?)
obj2 : {s : Str ; a : AgreementPlus} ; obj2 : {s : Str ; a : AgreementPlus} ;
secObj : Str ; -- if two overt pronoun objects
} ; } ;
VPSlash : Type = VerbPhrase ; VPSlash : Type = VerbPhrase ;
@@ -546,6 +546,7 @@ oper
adv = [] ; adv = [] ;
c2,c3 = noPrep ; c2,c3 = noPrep ;
obj2 = {s = [] ; a = Unassigned} ; obj2 = {s = [] ; a = Unassigned} ;
secObj = []
} ; } ;
useVc : Verb2 -> VPSlash = \v2 -> useV v2 ** { useVc : Verb2 -> VPSlash = \v2 -> useV v2 ** {
@@ -553,49 +554,59 @@ oper
} ; } ;
complSlash : VPSlash -> VerbPhrase = \vps -> let np = vps.obj2 in vps ** { complSlash : VPSlash -> VerbPhrase = \vps -> let np = vps.obj2 in vps ** {
comp = \\a => comp = \\agr =>
case np.a of { case np.a of {
Unassigned => vps.comp ! a ; Unassigned => vps.comp ! agr ;
IsPron ag => {p1 = [] ; -- object is a pronoun => nothing is placed before the verb _ => {p1 = np.s ; -- if object is a noun, it will come before verb in the sentence.
p2 = compl np.a vps} ; -- object combines with the preposition of the verb -- if object is a pronoun, np.s is empty.
NotPronP3 => {p1 = np.s ; -- object is a noun => it will come before verb in the sentence p2 = compl np.a vps ++ vps.secObj} -- object combines with the preposition of the verb.
p2 = compl np.a vps} -- object combines with the preposition of the verb -- secObj in case there was a ditransitive verb.
-- IsPron ag => {p1 = [] ; -- object is a pronoun => nothing is placed before the verb
-- p2 = compl np.a vps ++ vps.secObj} ; -- object combines with the preposition of the verb
-- NotPronP3 => {p1 = np.s ; -- object is a noun => it will come before verb in the sentence
-- p2 = compl np.a vps ++ vps.secObj} -- object combines with the preposition of the verb
} }
} ; } ;
compl : AgreementPlus -> VerbPhrase -> Str = \a,vp -> compl : AgreementPlus -> VerbPhrase -> Str = \a,vp ->
let agr = case a of {IsPron x => x ; _ => Pl3} ; let agr = case a of {IsPron x => x ; _ => Pl3} ;
in "<" ++ prepCombTable ! agr ! combine vp.c2 vp.c3 ++ ">" ; in prepCombTable ! agr ! combine vp.c2 vp.c3 ;
insertComp : VPSlash -> NounPhrase -> VerbPhrase = \vp,np -> insertComp : VPSlash -> NounPhrase -> VerbPhrase = \vp,np ->
let nps = if_then_Str np.isPron [] (np.s ! Abs) ; let noun = if_then_Str np.isPron [] (np.s ! Abs) ;
in case vp.obj2.a of { in case vp.obj2.a of {
Unassigned => Unassigned =>
vp ** {obj2 = {s = nps ; vp ** {obj2 = {
s = noun ;
a = agr2agrplus np.isPron np.a} a = agr2agrplus np.isPron np.a}
} ; } ;
-- If the old object in obj2 is 3rd person, we can safely replace its agreement, but keep its string. -- If the old object is 3rd person, we can safely replace its agreement.
-- We keep both old and new string (=noun, if there was one) in obj2.s.
NotPronP3|IsPron (Sg3 _|Pl3) => NotPronP3|IsPron (Sg3 _|Pl3) =>
vp ** {obj2 = vp.obj2 ** {a = agr2agrplus np.isPron np.a} ; vp ** {obj2 = {
adv = vp.adv ++ nps} ; s = vp.obj2.s ++ noun ;
a = agr2agrplus np.isPron np.a} ; --
} ; -- no secObj, because there's ≤1 non-3rd-person pronoun.
-- If old object was non-3rd person, we keep its agreement.
_ => vp ** {
obj2 = vp.obj2 ** {
s = vp.obj2.s ++ noun
} ;
secObj = vp.secObj ++ secondObject ! np.a}
-- This happens in two cases:
-- 1) insertAdv placed the preposition into vp.adv and called insertComp.
-- 2) ditransitive verb where both objects are non-3rd person. (Not implemented yet.)
_ => vp ** {adv = vp.adv ++ nps}
} ; } ;
insertAdv : Adverb -> VerbPhrase -> VerbPhrase = \adv,vp -> insertAdv : Adverb -> VerbPhrase -> VerbPhrase = \adv,vp ->
case adv.c2 of { case adv.c2 of {
noPrep => vp ** {adv = adv.s} ; -- The adverb is not formed with PrepNP noPrep => vp ** {adv = adv.s} ; -- The adverb is not formed with PrepNP
prep => insertComp vp' adv.np } prep => case <vp.c2,vp.obj2.a,vp.c3> of {
where { vp' : VerbPhrase = <noPrep,Unassigned,_> => insertComp <vp ** {c2 = adv.c2}:VerbPhrase> adv.np ; -- should cover for obligatory argument that is not introduced with a preposition
case <vp.c2,vp.obj2.a,vp.c3> of { -- NB. This is a safe assumption only for AdvVP, no guarantees for AdvVPSlash. <_,_, noPrep> => insertComp (vp ** {c3 = adv.c2}) adv.np ;
<noPrep,Unassigned,_> => vp ** {c2 = adv.c2} ; -- should cover for obligatory argument that is not introduced with a preposition
<_,_,noPrep> => vp ** {c3 = adv.c2} ;
-- if complement slots are full, put preposition just as a string. TODO check word order. -- if complement slots are full, put preposition just as a string. TODO check word order.
_ => vp ** {adv = (prepTable ! adv.c2).s ! adv.np.a} --only preposition inserted here, adv.np.s ! Abs will be inserted in insertComp! _ => vp ** {adv = (prepTable ! adv.c2).s ! adv.np.a ++ adv.np.s ! Abs}
} }
} ; } ;
-------------------------------------------------------------------------------- --------------------------------------------------------------------------------

View File

@@ -143,7 +143,7 @@ lin with_Prep = prep la ;
} ; } ;
we_Pron = { we_Pron = {
s = table {Nom => "aan" ; Voc => "innaga" ; _Abs => "na"} ; s = table {Nom => "aan" ; Voc => "innaga" ; _Abs => "na"} ;
a = Pl1 Incl ; isPron = True ; a = Pl1 Excl ; isPron = True ;
poss = {s = "een" ; v = vE ; sp = gnTable "eenn" "eenn" "uweenn"} poss = {s = "een" ; v = vE ; sp = gnTable "eenn" "eenn" "uweenn"}
} ; } ;
youPl_Pron = { youPl_Pron = {

View File

@@ -30,22 +30,15 @@ lin
-- : V2 -> VPSlash -- : V2 -> VPSlash
SlashV2a = useVc ; SlashV2a = useVc ;
{-
-- : V3 -> NP -> VPSlash ; -- give it (to her) -- : V3 -> NP -> VPSlash ; -- give it (to her)
Slash2V3 v3 npNori = slashDObj v3 ** Slash2V3 v3 np = insertComp (useVc v3) np ;
{ iobj = { s = npNori.s ! Dat ;
agr = npNori.agr }
} ;
-- : V3 -> NP -> VPSlash ; -- give (it) to her -- : V3 -> NP -> VPSlash ; -- give (it) to her
Slash3V3 v3 npNor = slashIObj v3 ** Slash3V3 v3 np = insertComp (useVc v3) np ;
{ dobj = npNor ** { s = mkDObj npNor } {-
} ;
-- : V2V -> VP -> VPSlash ; -- beg (her) to go -- : V2V -> VP -> VPSlash ; -- beg (her) to go
SlashV2V v2v vp = ; SlashV2V v2v vp = ;
-- : V2S -> S -> VPSlash ; -- answer (to him) that it is good -- : V2S -> S -> VPSlash ; -- answer (to him) that it is good
SlashV2S v2s s = ; SlashV2S v2s s = ;