GitHub/gf-rgl
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-rgl.git synced 2026-05-27 17:08:54 -06:00
Code Issues Packages Projects Releases Wiki Activity

drop the copular sufix for P3 Pl

Browse Source
This commit is contained in:
krangelov
2020-03-30 12:34:44 +02:00
parent e685d5038e
commit 4a50152e17
3 changed files with 7 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/turkish/NounTur.gf
View File

@@ -18,11 +18,10 @@ concrete NounTur of Noun = CatTur ** open ResTur, SuffixTur, HarmonyTur, Prelude
UsePron p = p ; UsePron p = p ;
-- TODO: look further into how correct this is.
UsePN pn = { UsePN pn = {
s = \\c => pn.s ! Sg ! c; s = \\c => pn.s ! Sg ! c;
h = pn.h; h = pn.h;
a = {n = Sg; p = P1} a = {n = Sg; p = P3}
} ; } ;
PossPron p = {s = []; useGen = YesGen p.a} ; PossPron p = {s = []; useGen = YesGen p.a} ;

6
src/turkish/ParadigmsTur.gf
View File

@@ -143,10 +143,10 @@ resource ParadigmsTur = open
regN : Str -> N ; regN : Str -> N ;
-- Paradigm for proper noun -- Paradigm for proper noun
regPN : Str -> Noun ; regPN : Str -> PN ;
-- Worst case function for proper nouns -- 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 -- digits can be seen as proper noun, but we need an additional harmony argument
-- since harmony information can not be extracted from digit string. -- since harmony information can not be extracted from digit string.
@@ -611,7 +611,7 @@ resource ParadigmsTur = open
ablat_Case : Prep = mkPrep [] Ablat; ablat_Case : Prep = mkPrep [] Ablat;
dat_Case : Prep = mkPrep [] Dat; 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} ; mkQuant : Str -> Quant = \s -> lin Quant {s=s; useGen = NoGen} ;

4
src/turkish/VerbTur.gf
View File

@@ -49,8 +49,8 @@ concrete VerbTur of Verb = CatTur ** open Prelude, ResTur, SuffixTur, HarmonyTur
CompAP ap = lin VP { CompAP ap = lin VP {
s = table { s = table {
VPres agr => ap.s ! agr.n ! Nom ++ VPres agr => ap.s ! agr.n ! Nom ++
case agr of { case agr.p of {
{n=Sg; p=P3} => [] ; P3 => [] ;
_ => suffixStr ap.h (verbSuffixes ! agr) _ => suffixStr ap.h (verbSuffixes ! agr)
} ; } ;
VProg agr => ap.s ! agr.n ! Nom ; VProg agr => ap.s ! agr.n ! Nom ;