GitHub/gf-rgl
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-rgl.git synced 2026-06-15 10:00:11 -06:00
Code Issues Packages Projects Releases Wiki Activity

fix the word order for superlatives

Browse Source
This commit is contained in:
Krasimir Angelov
2023-11-04 15:04:15 +01:00
parent 14825b5617
commit e97205e04d
23 changed files with 91 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/french/CompatibilityFre.gf
View File

@@ -6,6 +6,6 @@ concrete CompatibilityFre of Compatibility = CatFre ** open Prelude, CommonRoman
lin
NumInt n = {s = \\_ => n.s ; isNum = True ; n = Pl} ;
OrdInt n = {s = \\_ => n.s ++ SOFT_BIND ++ "."} ; ---
OrdInt n = {s = \\_ => n.s ++ SOFT_BIND ++ "." ; s2 = \\_ => []} ; ---
}

3
src/french/DiffFre.gf
View File

@@ -341,4 +341,7 @@ instance DiffFre of DiffRomance - [
param
HasArt = NoArt | UseArt | AlwaysArt ;
oper
superlCanBePost = False ;
} ;

2
src/french/ExtraFre.gf
View File

@@ -77,7 +77,7 @@ concrete ExtraFre of ExtraFreAbs = ExtraRomanceFre **
s,sp = \\g,c => prepCase c ++ genForms "tout" "toute" ! g ;
spn= \\c => prepCase c ++ "tout" ;
n = Sg ;
s2 = [] ;
s2 = \\c => [] ;
isNeg = False
} ;

4
src/french/MakeStructuralFre.gf
View File

@@ -42,12 +42,12 @@ oper
mkDet : Str -> Det = \s -> lin Det {
s,sp = \\_,c => prepCase c ++ s ;
spn = \\c => prepCase c ++ s ;
n = Sg ; s2 = [] ; isNeg = False
n = Sg ; s2 = \\g => [] ; isNeg = False
} ;
mkDet : Str -> Str -> Number -> Det = \m,f,n -> lin Det {
s,sp = \\g,c => prepCase c ++ case g of {Masc => m ; Fem => f} ;
spn = \\c => prepCase c ++ m ;
n = n ; s2 = [] ; isNeg = False
n = n ; s2 = \\g => [] ; isNeg = False
} ;
} ;

12
src/french/StructuralFre.gf
View File

@@ -38,7 +38,7 @@ lin
sp = \\g,c => prepCase c ++ genForms "chacun" "chacune" ! g ;
spn= \\c => prepCase c ++ "tout" ;
n = Sg ;
s2 = [] ;
s2 = \\g => [] ;
isNeg = False
} ;
everything_NP = pn2np (mkPN ["tout"] Masc) ;
@@ -46,7 +46,7 @@ lin
few_Det = {
s,sp = \\g,c => prepCase c ++ "peu" ++ elisDe ;
spn = \\c => prepCase c ++ "peu" ++ elisDe ;
n = Pl ; s2 = [] ; isNeg = False} ;
n = Pl ; s2 = \\g => [] ; isNeg = False} ;
--- DEPREC first_Ord = {s = \\ag => (regA "premier").s ! Posit ! AF ag.g ag.n} ;
for_Prep = mkPreposition "pour" ;
from_Prep = complGen ; ---
@@ -75,12 +75,12 @@ lin
many_Det = {
s,sp = \\_,c => prepCase c ++ "plusieurs" ;
spn = \\c => prepCase c ++ "plusieurs" ;
n = Pl ; s2 = [] ; isNeg = False} ;
n = Pl ; s2 = \\g => [] ; isNeg = False} ;
more_CAdv = X.mkCAdv "plus" conjThan ;
most_Predet = {s = \\_,c => prepCase c ++ ["la plupart"] ; c = CPrep P_de ; a = PNoAg} ;
much_Det = {s,sp = \\_,c => prepCase c ++ "beaucoup" ++ elisDe ;
spn = \\c => prepCase c ++ "beaucoup" ++ elisDe ;
n = Pl ; s2 = [] ; isNeg = False} ;
n = Pl ; s2 = \\g => [] ; isNeg = False} ;
must_VV = mkVV (devoir_V2 ** {lock_V = <>}) ;
---b no_Phr = ss "non" ;
no_Utt = ss "non" ;
@@ -103,11 +103,11 @@ lin
somePl_Det = {
s,sp = \\_,c => prepCase c ++ "quelques" ;
spn = \\c => prepCase c ++ "quelque chose" ;
n = Pl ; s2 = [] ; isNeg = False} ; ---- sp
n = Pl ; s2 = \\g => [] ; isNeg = False} ; ---- sp
someSg_Det = {
s,sp = \\_,c => prepCase c ++ "quelque" ;
spn = \\c => prepCase c ++ "quelque chose" ;
n = Sg ; s2 = [] ; isNeg = False} ; ----sp
n = Sg ; s2 = \\g => [] ; isNeg = False} ; ----sp
something_NP = pn2np (mkPN ["quelque chose"] Masc) ;
somewhere_Adv = ss ["quelque part"] ; --- ne - pas