1
0
forked from GitHub/gf-core

trying to find some inefficiencies in Finnish resource

This commit is contained in:
aarne
2010-10-25 19:56:47 +00:00
parent cd0a9982bd
commit e745881e4a
6 changed files with 32 additions and 2 deletions

View File

@@ -142,12 +142,27 @@ param
appCompl : Bool -> Polarity -> Compl -> NP -> Str = \isFin,b,co,np ->
let
c = case co.c of {
NPAcc => case b of {
Neg => NPCase Part ; -- en näe taloa/sinua
Pos => case isFin of {
True => NPAcc ; -- näen/täytyy nähdä sinut
_ => case np.isPron of {
False => NPCase Nom ; -- täytyy nähdä talo
_ => NPAcc
}
}
} ;
_ => co.c
} ;
{-
c = case <isFin, b, co.c, np.isPron> of {
<_, Neg, NPAcc,_> => NPCase Part ; -- en näe taloa/sinua
<_, Pos, NPAcc,True> => NPAcc ; -- näen/täytyy sinut
<False,Pos, NPAcc,False> => NPCase Nom ; -- täytyy nähdä talo
<_,_,coc,_> => coc
} ;
-}
nps = np.s ! c
in
preOrPost co.isPre co.s nps ;

View File

@@ -69,7 +69,8 @@ concrete VerbFin of Verb = CatFin ** open Prelude, ResFin in {
SlashV2VNP v np vp =
insertObj
(\\fin,b,a => appCompl fin b v.c2 np ++ infVP v.sc b a vp v.vi)
(\\fin,b,a => appCompl True b v.c2 np ++ ---- fin -> stack overflow
infVP v.sc b a vp v.vi)
(predV v) ** {c2 = vp.c2} ;
AdvVP vp adv = insertObj (\\_,_,_ => adv.s) vp ;