mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-05-25 10:48:54 -06:00
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:
@@ -61,7 +61,7 @@ oper
|
|||||||
s = table {
|
s = table {
|
||||||
AAdj Posit Def g n c => mkAdjective_Pos lemma Def ! g ! n ! c ;
|
AAdj Posit Def g n c => mkAdjective_Pos lemma Def ! g ! n ! c ;
|
||||||
AAdj Posit Indef g n c => case lemma of {
|
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
|
_ => mkAdjective_Pos lemma Indef ! g ! n ! c
|
||||||
} ;
|
} ;
|
||||||
AAdj _ _ _ _ _ => NON_EXISTENT ;
|
AAdj _ _ _ _ _ => NON_EXISTENT ;
|
||||||
@@ -97,7 +97,7 @@ oper
|
|||||||
Dat => stem + "am" ;
|
Dat => stem + "am" ;
|
||||||
Acc => stem + "u" ;
|
Acc => stem + "u" ;
|
||||||
Loc => stem + "ā" ;
|
Loc => stem + "ā" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ais"
|
||||||
} ;
|
} ;
|
||||||
Pl => table {
|
Pl => table {
|
||||||
Nom => stem + "i" ;
|
Nom => stem + "i" ;
|
||||||
@@ -105,7 +105,7 @@ oper
|
|||||||
Dat => stem + "iem" ;
|
Dat => stem + "iem" ;
|
||||||
Acc => stem + "us" ;
|
Acc => stem + "us" ;
|
||||||
Loc => stem + "os" ;
|
Loc => stem + "os" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ie"
|
||||||
}
|
}
|
||||||
} ;
|
} ;
|
||||||
Fem => table {
|
Fem => table {
|
||||||
@@ -115,7 +115,7 @@ oper
|
|||||||
Dat => stem + "ai" ;
|
Dat => stem + "ai" ;
|
||||||
Acc => stem + "u" ;
|
Acc => stem + "u" ;
|
||||||
Loc => stem + "ā" ;
|
Loc => stem + "ā" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ā"
|
||||||
} ;
|
} ;
|
||||||
Pl => table {
|
Pl => table {
|
||||||
Nom => stem + "as" ;
|
Nom => stem + "as" ;
|
||||||
@@ -123,7 +123,7 @@ oper
|
|||||||
Dat => stem + "ām" ;
|
Dat => stem + "ām" ;
|
||||||
Acc => stem + "as" ;
|
Acc => stem + "as" ;
|
||||||
Loc => stem + "ās" ;
|
Loc => stem + "ās" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ās"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
} ;
|
} ;
|
||||||
@@ -179,7 +179,7 @@ oper
|
|||||||
Dat => stem + "ākam" ;
|
Dat => stem + "ākam" ;
|
||||||
Acc => stem + "āku" ;
|
Acc => stem + "āku" ;
|
||||||
Loc => stem + "ākā" ;
|
Loc => stem + "ākā" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ākais"
|
||||||
} ;
|
} ;
|
||||||
Pl => table {
|
Pl => table {
|
||||||
Nom => stem + "āki" ;
|
Nom => stem + "āki" ;
|
||||||
@@ -187,7 +187,7 @@ oper
|
|||||||
Dat => stem + "ākiem" ;
|
Dat => stem + "ākiem" ;
|
||||||
Acc => stem + "ākus" ;
|
Acc => stem + "ākus" ;
|
||||||
Loc => stem + "ākos" ;
|
Loc => stem + "ākos" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ākie"
|
||||||
}
|
}
|
||||||
} ;
|
} ;
|
||||||
Fem => table {
|
Fem => table {
|
||||||
@@ -197,7 +197,7 @@ oper
|
|||||||
Dat => stem + "ākai" ;
|
Dat => stem + "ākai" ;
|
||||||
Acc => stem + "āku" ;
|
Acc => stem + "āku" ;
|
||||||
Loc => stem + "ākā" ;
|
Loc => stem + "ākā" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ākā"
|
||||||
} ;
|
} ;
|
||||||
Pl => table {
|
Pl => table {
|
||||||
Nom => stem + "ākas" ;
|
Nom => stem + "ākas" ;
|
||||||
@@ -205,7 +205,7 @@ oper
|
|||||||
Dat => stem + "ākām" ;
|
Dat => stem + "ākām" ;
|
||||||
Acc => stem + "ākas" ;
|
Acc => stem + "ākas" ;
|
||||||
Loc => stem + "ākās" ;
|
Loc => stem + "ākās" ;
|
||||||
Voc => NON_EXISTENT
|
Voc => stem + "ākās"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
} ;
|
} ;
|
||||||
@@ -263,4 +263,5 @@ oper
|
|||||||
Compar => stem + "āk" ;
|
Compar => stem + "āk" ;
|
||||||
Superl => "vis" + stem + "āk"
|
Superl => "vis" + stem + "āk"
|
||||||
} ;
|
} ;
|
||||||
|
|
||||||
} ;
|
} ;
|
||||||
|
|||||||
@@ -48,7 +48,7 @@ oper
|
|||||||
} ;
|
} ;
|
||||||
|
|
||||||
mkN2 = overload {
|
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 } ;
|
mkN2 : N -> ResLav.Prep -> Bool -> N2 = \n,p,isPre -> lin N2 n ** { p = p ; isPre = isPre } ;
|
||||||
} ;
|
} ;
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user