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

better noun morphology in Cat.

Browse Source
This commit is contained in:
jordi.saludes
2008-09-29 18:28:27 +00:00
parent 662663ffa3
commit becce3cb62
1 changed files with 109 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files

180
lib/resource/catalan/MorphoCat.gf
View File

@@ -1,45 +1,59 @@
--# -path=.:../romance:../common:../../prelude --# -path=.:../romance:../common:../../prelude
----1 A Simple Catalan Resource Morphology --1 A Simple Catalan Resource Morphology
----
---- Aarne Ranta 2002 -- 2005
----
---- This resource morphology contains definitions needed in the resource
---- syntax. To build a lexicon, it is better to use $ParadigmsCat$, which
---- gives a higher-level access to this module.
-- --
-- Aarne Ranta 2002 -- 2005
-- Jordi Saludes 2008: Derived from MorphoSpa.
--
-- This resource morphology contains definitions needed in the resource
-- syntax. To build a lexicon, it is better to use $ParadigmsCat$, which
-- gives a higher-level access to this module.
resource MorphoCat = CommonRomance, ResCat ** resource MorphoCat = CommonRomance, ResCat **
open PhonoCat, Prelude, Predef in { open PhonoCat, Prelude, Predef in {
flags optimize=all ; coding=utf8 ;
--2 Nouns
-- --
-- flags optimize=all ; -- The following macro is useful for creating the forms of number-dependent
-- -- tables, such as common nouns.
-- -- gcc M2.3
----2 Nouns
----
---- The following macro is useful for creating the forms of number-dependent
---- tables, such as common nouns.
--
oper oper
numForms : (_,_ : Str) -> Number => Str = \vi, vins -> numForms : (_,_ : Str) -> Number => Str = \vi, vins ->
table {Sg => vi ; Pl => vins} ; table {Sg => vi ; Pl => vins} ;
-- For example: nomCep : Str -> Number => Str = \cep ->
numForms cep (cep + "s") ;
nomHome : Str -> Number => Str = \home ->
numForms home (home + "s") ;
nomDona : Str -> Number => Str = \dona -> nomCasa : Str -> Str -> Number => Str = \es,casa ->
numForms dona (init dona + "es") ; numForms casa (init casa + es) ;
nomDisc : Str -> Number => Str = \disc -> nomFre : Str -> Number => Str = \fre ->
numForms disc (variants {disc + "s"; disc + "os"}) ; numForms fre (fre + "ns") ;
nomCas : Str -> Number => Str = \cas ->
numForms cas (cas + "os") ;
nomTest : Str -> Number => Str = \test ->
numForms test (variants {test + "s"; test + "os"}) ;
nomFaig : Str -> Number => Str = \faig ->
let
fa = Predef.tk 2 faig
in
numForms faig (variants {fa + "jos" ; faig + "s"}) ;
nomDesig : Str -> Number => Str = \desig ->
let
desi = Predef.tk 1 desig
in
numForms desig (variants {desi + "tjos" ; desi + "gs"}) ;
nomTemps : Str -> Number => Str = \temps ->
numForms temps temps ;
-- nomPilar : Str -> Number => Str = \pilar ->
-- numForms pilar (pilar + "es") ;
--
-- nomTram : Str -> Number => Str = \tram ->
-- numForms tram tram ;
--
-- Common nouns are inflected in number and have an inherent gender. -- Common nouns are inflected in number and have an inherent gender.
mkNoun : (Number => Str) -> Gender -> Noun = \noinois,gen -> mkNoun : (Number => Str) -> Gender -> Noun = \noinois,gen ->
@@ -49,57 +63,73 @@ oper
mkNoun (numForms vi vins) ; mkNoun (numForms vi vins) ;
mkNomReg : Str -> Noun = \noi -> mkNomReg : Str -> Noun = \noi ->
let
mkNounMas : (Str -> Number => Str) -> Noun = \rule -> mkNoun (rule noi) Masc
in
case last noi of { case last noi of {
"o" | "e" => mkNoun (nomHome noi) Masc ; "a" => mkNoun (nomCasa "es" noi) Fem ;
"a" => mkNoun (nomDona noi) Fem ; "s"|"x"|"ç" => mkNounMas nomCas ;
"c" => mkNoun (nomDisc noi) Masc ; "i"|"e" => mkNounMas nomFre ;
--- "u" => mkNounIrreg mec (init mec + "ces") Fem ; "í" => mkNounMas (nomCasa "ins") ;
_ => mkNoun (nomHome noi) Masc "à" => mkNounMas (nomCasa "ans") ;
"ó" => mkNounMas (nomCasa "ons") ;
"g" => mkNounMas nomFaig ;
_ => mkNounMas nomCep
} ; } ;
----2 Adjectives --2 Adjectives
---- --
-- Adjectives are conveniently seen as gender-dependent nouns. -- Adjectives are conveniently seen as gender-dependent nouns.
-- Here are some patterns. First one that describes the worst case. -- Here are some patterns. First one that describes the worst case.
-- gcc M2.1
mkAdj : (_,_,_,_,_ : Str) -> Adj = \petit,petita,petits,petites,petitament -> mkAdj : (_,_,_,_,_ : Str) -> Adj = \prim,prima,prims,primes,primament ->
{s = table { {s = table {
AF Masc n => numForms petit petits ! n ; AF Masc n => numForms prim prims ! n ;
AF Fem n => numForms petita petites ! n ; AF Fem n => numForms prima primes ! n ;
AA => petitament AA => primament
} }
} ; } ;
---- Then the regular and invariant patterns. --- Then the regular and invariant patterns.
--
-- adjfort : Str -> Adj = \solo -> adjPrim : Str -> Adj = \prim ->
-- let mkAdj prim (prim + "a") (prim + "s") (prim + "es") (prim + "ament") ;
-- sol = Predef.tk 1 solo
-- in adjBlau : Str -> Str -> Adj = \blau,blava ->
-- mkAdj solo (sol + "a") (sol + "os") (sol + "as") (sol + "amente") ; let
-- blav = Predef.tk 1 blava
adjFort : Str -> Adj = \fort -> in
mkAdj fort (fort + "a") (fort + "s") (fort + "es") (fort + "ament") ; mkAdj blau blava (blau + "s") (blav + "es") (blava + "ment") ;
--
-- adjBlu : Str -> Adj = \blu -> adjFondo : Str -> Adj = \fondo ->
-- mkAdj blu blu blu blu blu ; --- let
-- fond = Predef.tk 1 fondo
mkAdjReg : Str -> Adj = \fort -> adjFort fort ; in
{- adjBlau fondo (fond + "a") ;
case last solo of {
"o" => adjSolo solo ; adjBo : Str -> Adj = \bo ->
--- "e" => adjUtil solo (solo + "s") ; mkAdj bo (bo + "na") (bo + "ns") (bo + "nes") (bo + "nament") ;
"a" =>
_ => adjUtil solo (solo + "es") adjFidel : Str -> Adj = \fidel ->
let
fidels = fidel + "s"
in
mkAdj fidel fidel fidels fidels (fidel + "ment") ;
mkAdjReg : Str -> Adj = \prim ->
case last prim of {
"e"|"u"|"o" => adjFondo prim ;
_ => adjPrim prim
} ; } ;
-}
--
----2 Personal pronouns --2 Personal pronouns
----
---- All the eight personal pronouns can be built by the following macro.
---- The use of "ne" as atonic genitive is debatable.
---- We follow the rule that the atonic nominative is empty.
-- --
-- All the eight personal pronouns can be built by the following macro.
-- The use of "ne" as atonic genitive is debatable.
-- We follow the rule that the atonic nominative is empty.
mkPronoun : (_,_,_,_,_,_,_,_ : Str) -> mkPronoun : (_,_,_,_,_,_,_,_ : Str) ->
Gender -> Number -> Person -> Pronoun = Gender -> Number -> Person -> Pronoun =
\il,le,lui,Lui,son,sa,ses,see,g,n,p -> \il,le,lui,Lui,son,sa,ses,see,g,n,p ->
@@ -118,13 +148,13 @@ oper
a = {g = g ; n = n ; p = p} ; a = {g = g ; n = n ; p = p} ;
hasClit = True hasClit = True
} ; } ;
--2 Determiners
-- --
-- -- Determiners, traditionally called indefinite pronouns, are inflected
----2 Determiners -- in gender and number, like adjectives.
----
---- Determiners, traditionally called indefinite pronouns, are inflected pronForms : Adj -> Gender -> Number -> Str = \tal,g,n -> tal.s ! AF g n ;
---- in gender and number, like adjectives.
--
pronForms : Adj -> Gender -> Number -> Str = \tale,g,n -> tale.s ! AF g n ;
--
} }