forked from GitHub/gf-rgl
drop the copular sufix for P3 Pl
This commit is contained in:
@@ -18,11 +18,10 @@ concrete NounTur of Noun = CatTur ** open ResTur, SuffixTur, HarmonyTur, Prelude
|
||||
|
||||
UsePron p = p ;
|
||||
|
||||
-- TODO: look further into how correct this is.
|
||||
UsePN pn = {
|
||||
s = \\c => pn.s ! Sg ! c;
|
||||
h = pn.h;
|
||||
a = {n = Sg; p = P1}
|
||||
a = {n = Sg; p = P3}
|
||||
} ;
|
||||
|
||||
PossPron p = {s = []; useGen = YesGen p.a} ;
|
||||
|
||||
@@ -143,10 +143,10 @@ resource ParadigmsTur = open
|
||||
regN : Str -> N ;
|
||||
|
||||
-- Paradigm for proper noun
|
||||
regPN : Str -> Noun ;
|
||||
regPN : Str -> PN ;
|
||||
|
||||
-- Worst case function for proper nouns
|
||||
makePN : Str -> Str -> Noun ;
|
||||
makePN : Str -> Str -> PN ;
|
||||
|
||||
-- digits can be seen as proper noun, but we need an additional harmony argument
|
||||
-- since harmony information can not be extracted from digit string.
|
||||
@@ -611,7 +611,7 @@ resource ParadigmsTur = open
|
||||
|
||||
ablat_Case : Prep = mkPrep [] Ablat;
|
||||
dat_Case : Prep = mkPrep [] Dat;
|
||||
acc_Case : Prep = mkPrep [] Dat;
|
||||
acc_Case : Prep = mkPrep [] Acc;
|
||||
|
||||
mkQuant : Str -> Quant = \s -> lin Quant {s=s; useGen = NoGen} ;
|
||||
|
||||
|
||||
@@ -49,9 +49,9 @@ concrete VerbTur of Verb = CatTur ** open Prelude, ResTur, SuffixTur, HarmonyTur
|
||||
CompAP ap = lin VP {
|
||||
s = table {
|
||||
VPres agr => ap.s ! agr.n ! Nom ++
|
||||
case agr of {
|
||||
{n=Sg; p=P3} => [] ;
|
||||
_ => suffixStr ap.h (verbSuffixes ! agr)
|
||||
case agr.p of {
|
||||
P3 => [] ;
|
||||
_ => suffixStr ap.h (verbSuffixes ! agr)
|
||||
} ;
|
||||
VProg agr => ap.s ! agr.n ! Nom ;
|
||||
VPast agr => ap.s ! agr.n ! Nom ++
|
||||
|
||||
Reference in New Issue
Block a user