Latvian: fixed some adjective paradigms, changed the default word order in ComplN2

The issues were unveiled while testing AttemptoLav in a more realistic domain
This commit is contained in:
Normunds Gruzitis
2012-10-23 00:12:36 +00:00
parent 1c69a5ee3d
commit e2ddf8a272
2 changed files with 29 additions and 28 deletions

View File

@@ -61,7 +61,7 @@ oper
s = table {
AAdj Posit Def g n c => mkAdjective_Pos lemma Def ! g ! n ! c ;
AAdj Posit Indef g n c => case lemma of {
s + "ais" => NON_EXISTENT ;
s + "ais" => mkAdjective_Pos lemma Def ! g ! n ! c ;
_ => mkAdjective_Pos lemma Indef ! g ! n ! c
} ;
AAdj _ _ _ _ _ => NON_EXISTENT ;
@@ -97,7 +97,7 @@ oper
Dat => stem + "am" ;
Acc => stem + "u" ;
Loc => stem + "ā" ;
Voc => NON_EXISTENT
Voc => stem + "ais"
} ;
Pl => table {
Nom => stem + "i" ;
@@ -105,7 +105,7 @@ oper
Dat => stem + "iem" ;
Acc => stem + "us" ;
Loc => stem + "os" ;
Voc => NON_EXISTENT
Voc => stem + "ie"
}
} ;
Fem => table {
@@ -115,7 +115,7 @@ oper
Dat => stem + "ai" ;
Acc => stem + "u" ;
Loc => stem + "ā" ;
Voc => NON_EXISTENT
Voc => stem + "ā"
} ;
Pl => table {
Nom => stem + "as" ;
@@ -123,7 +123,7 @@ oper
Dat => stem + "ām" ;
Acc => stem + "as" ;
Loc => stem + "ās" ;
Voc => NON_EXISTENT
Voc => stem + "ās"
}
}
} ;
@@ -179,7 +179,7 @@ oper
Dat => stem + "ākam" ;
Acc => stem + "āku" ;
Loc => stem + "ākā" ;
Voc => NON_EXISTENT
Voc => stem + "ākais"
} ;
Pl => table {
Nom => stem + "āki" ;
@@ -187,7 +187,7 @@ oper
Dat => stem + "ākiem" ;
Acc => stem + "ākus" ;
Loc => stem + "ākos" ;
Voc => NON_EXISTENT
Voc => stem + "ākie"
}
} ;
Fem => table {
@@ -197,7 +197,7 @@ oper
Dat => stem + "ākai" ;
Acc => stem + "āku" ;
Loc => stem + "ākā" ;
Voc => NON_EXISTENT
Voc => stem + "ākā"
} ;
Pl => table {
Nom => stem + "ākas" ;
@@ -205,7 +205,7 @@ oper
Dat => stem + "ākām" ;
Acc => stem + "ākas" ;
Loc => stem + "ākās" ;
Voc => NON_EXISTENT
Voc => stem + "ākās"
}
}
} ;
@@ -263,4 +263,5 @@ oper
Compar => stem + "āk" ;
Superl => "vis" + stem + "āk"
} ;
} ;

View File

@@ -48,7 +48,7 @@ oper
} ;
mkN2 = overload {
mkN2 : N -> ResLav.Prep -> N2 = \n,p -> lin N2 n ** { p = p ; isPre = False } ;
mkN2 : N -> ResLav.Prep -> N2 = \n,p -> lin N2 n ** { p = p ; isPre = True } ;
mkN2 : N -> ResLav.Prep -> Bool -> N2 = \n,p,isPre -> lin N2 n ** { p = p ; isPre = isPre } ;
} ;