GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-05-26 19:28:54 -06:00
Code Issues Packages Projects Releases Wiki Activity

Finnish complete

Browse Source
This commit is contained in:
aarne
2006-02-07 18:05:25 +00:00
parent 52dc7d460d
commit 0e4a0f2041
45 changed files with 567 additions and 436 deletions
Download Patch File Download Diff File Expand all files Collapse all files

82
lib/resource-1.0/finnish/NounFin.gf
View File

@@ -13,21 +13,26 @@ concrete NounFin of Noun = CatFin ** open ResFin, Prelude in {
True => Sg ;
_ => det.n
} ;
ncase : Case -> NForm = \c -> case <n,c,det.isNum,det.isPoss> of {
<_, Nom,True,_> => NCase Sg Part ;
<_, _, True,False> => NCase Sg c ;
<_, Nom,_,True> => NPossNom ;
<Sg,Gen,_,True> => NPossNom ;
<Pl,Gen,_,True> => NPossGenPl ;
<_,Transl,_,True> => NPossTransl n ;
<_,Illat,_,True> => NPossIllat n ;
ncase : Case -> NForm = \c ->
case <n,c,det.isNum,det.isPoss, det.isDef> of {
<_, Nom, True,_,_> => NCase Sg Part ; -- kolme kytkintä(ni)
<_, _, True,False,_> => NCase Sg c ; -- kolmeksi kytkimeksi
<Pl,Nom, _,_,False> => NCase Pl Part ; -- kytkimiä
<_, Nom,_,True,_> => NPossNom ; -- kytkime+ni on/ovat...
<Sg,Gen,_,True,_> => NPossNom ; -- kytkime+ni vika
<Pl,Gen,_,True,_> => NPossGenPl ; -- kytkimie+ni viat
<_, Transl,_,True,_> => NPossTransl n ; -- kytkim(e|i)kse+ni
<_, Illat,_,True,_> => NPossIllat n ; -- kytkim(ee|ii)+ni
_ => NCase n c ----
}
_ => NCase n c -- kytkin, kytkimen,...
}
in {
s = \\c => let k = npform2case c in
det.s1 ! k ++ cn.s ! ncase k ++ det.s2 ;
a = agrP3 det.n ;
a = agrP3 (case det.isDef of {
False => Sg ; -- autoja menee; kolme autoa menee
_ => det.n
}) ;
isPron = False
} ;
@@ -49,36 +54,40 @@ concrete NounFin of Noun = CatFin ** open ResFin, Prelude in {
s2 = quant.s2 ;
n = Sg ;
isNum = False ;
isPoss = quant.isPoss
isPoss = quant.isPoss ;
isDef = False -- doesn't matter with Sg
} ;
DetPl quant num ord = {
s1 = \\c => quant.s1 ! c ++ num.s ! Sg ! c ++ ord.s ! Sg ! c ;
s2 = quant.s2 ;
s1 = \\c => quant.s1 ! c ++ num.s ! Pl ! c ++ ord.s ! Pl ! c ;
s2 = quant.s2 ;
n = Pl ;
isNum = num.isNum ;
isPoss = quant.isPoss
isPoss = quant.isPoss ;
isDef = quant.isDef
} ;
SgQuant quant = {
s1 = quant.s1 ! Sg ;
s2 = quant.s2 ;
isNum = quant.isNum ;
isPoss = quant.isPoss
isPoss = quant.isPoss ;
isDef = quant.isDef -- doesn't matter with Sg
} ;
PlQuant quant = {
s1 = quant.s1 ! Pl ;
s2 = quant.s2 ;
isNum = quant.isNum ;
isPoss = quant.isPoss
isPoss = quant.isPoss ;
isDef = quant.isDef
} ;
PossPron p = {
s1 = \\_,_ => p.s ! NPCase Gen ;
s2 = BIND ++ table Agr ["ni" ; "si" ; "nsa" ; "mme" ; "nne" ; "nsa"] ! p.a ;
s2 = BIND ++ possSuffix p.a ;
isNum = False ;
isPoss = True
isPoss = True ;
isDef = True --- "minun kolme autoani ovat" ; thus "...on" is missing
} ;
NoNum = {s = \\_,_ => [] ; isNum = False} ;
@@ -87,29 +96,30 @@ concrete NounFin of Noun = CatFin ** open ResFin, Prelude in {
NumInt n = {s = \\_,_ => n.s ; isNum = True} ;
OrdInt n = {s = \\_,_ => n.s ++ "."} ;
---- NumNumeral numeral = {s = numeral.s ! NCard} ;
---- OrdNumeral numeral = {s = numeral.s ! NOrd} ;
NumNumeral numeral = {s = \\n,c => numeral.s ! NCard (NCase n c) ; isNum = True} ;
OrdNumeral numeral = {s = \\n,c => numeral.s ! NOrd (NCase n c)} ;
AdNum adn num = {s = \\n,c => adn.s ++ num.s ! n ! c ; isNum = num.isNum} ;
---- OrdSuperl a = {s = a.s ! AAdj Superl} ;
OrdSuperl a = {s = \\n,c => a.s ! Superl ! AN (NCase n c)} ;
DefArt = {
s1 = \\_,_ => [] ;
s2 = [] ;
isNum,isPoss = False
isNum,isPoss = False ;
isDef = True -- autot ovat
} ;
IndefArt = {
s1 = \\_,_ => [] ; --- Nom is Part in Pl ?
s1 = \\_,_ => [] ; -- Nom is Part in Pl: use isDef in DetCN
s2 = [] ;
isNum,isPoss = False
isNum,isPoss,isDef = False -- autoja on
} ;
MassDet = {
s1 = \\_ => [] ; --- Nom is Part ?
s2 = [] ;
isNum,isPoss = False
isNum,isPoss,isDef = False
} ;
UseN n = n ;
@@ -117,6 +127,8 @@ concrete NounFin of Noun = CatFin ** open ResFin, Prelude in {
UseN2 n = n ;
UseN3 n = n ;
--- If a possessive suffix is added here it goes after the complements...
ComplN2 f x = {
s = \\nf => appCompl True Pos f.c2 x ++ f.s ! nf
} ;
@@ -128,10 +140,16 @@ concrete NounFin of Noun = CatFin ** open ResFin, Prelude in {
AdjCN ap cn = {
s = \\nf => ap.s ! True ! AN nf ++ cn.s ! nf
} ;
{-
RelCN cn rs = {s = \\n,c => cn.s ! n ! c ++ rs.s ! {n = n ; p = P3}} ;
AdvCN cn ad = {s = \\n,c => cn.s ! n ! c ++ ad.s} ;
SentCN cn sc = {s = \\n,c => cn.s ! n ! c ++ sc.s} ;
-}
RelCN cn rs = {s = \\nf => cn.s ! nf ++ rs.s ! agrP3 (numN nf)} ;
AdvCN cn ad = {s = \\nf => cn.s ! nf ++ ad.s} ;
SentCN cn sc = {s = \\nf=> cn.s ! nf ++ sc.s} ;
oper
numN : NForm -> Number = \nf -> case nf of {
NCase n _ => n ;
_ => Sg ---
} ;
}