Commit 9a895097 authored by Gérard Huet's avatar Gérard Huet

README

parent adc9cedd
This diff is collapsed.
......@@ -40,7 +40,7 @@ value transducer = fun
| Nouc -> transducers.nouc (* consonant-initial noun *)
| Noun2 -> transducers.noun2 (* idem in mode non gen *)
| Pron -> transducers.pron (* declined pronouns *)
| Root -> transducers.root (* conjugated root forms and infinitives *)
| Root -> transducers.root (* conjugated root forms *)
| Vokv -> transducers.vokv (* vowel-initial vocative k.rdaantas *)
| Vokc -> transducers.vokc (* consonant-initial vocative k.rdaantas *)
| Inde -> transducers.inde (* indeclinables, particles *)
......@@ -105,7 +105,7 @@ and amuitic= fun
$Noun = Nounv + Nounc$ and
$Iic = Iicv + Iicc$\\
NB. $Abso$ = absolutives in -ya,
$Inde$ contains absolutives in -tvaa and infinitives,
$Inde$ contains absolutives in -tvaa
$Voca = Vocv + Vocc$ (vocatives),
$Auxi$ = finite forms of bhuu and k.r.\\
The following is obtained from the above recursion equation by Brzozowski's
......@@ -597,7 +597,7 @@ value validate out = match out with
else []
]
| [ (Abso,rev_abso_form,s) :: [ (Pv,prev,sv) :: r ] ] ->
(* Takes care of absolutives in -ya and infinitives with preverbs *)
(* Takes care of absolutives in -ya *)
let pv = Word.mirror prev in
let pv_str = Canon.decode pv
and abso_form = Word.mirror rev_abso_form in
......@@ -622,7 +622,7 @@ value validate out = match out with
if Phonetics.consonant initial then
let sandhi = Euphony ([ 48; 1; initial], [ 48; 1; 48 ], [ initial ]) in
[ last :: [ (Pron,[ 48; 1; 48 ],sandhi) :: rest ] ]
else [] ] *)
else [] ] - But we should do it between chunks as well *)
| [ (ph,form,_) :: [ (Pron,[ 1; 47; 10 ],_) :: _ ] ] (* e.sa *) ->
if Phonetics.consonant_initial (Word.mirror form)
then out else []
......@@ -633,10 +633,6 @@ value validate out = match out with
if Phonetics.consonant_initial (Word.mirror form) then []
else out
(*i TODO: similar test for dual forms i*)
(* Alternative: put infinitives in Root rather than Indecl+Abso
[| [ (Absc,_,_) :: _ ]
| [ (Absv,_,_) :: _ ] -> check root is autonomous ]
idem for infinitives, but they need their own phase/color *)
(* Finally we glue taddita suffix "forms" to the previous (iic) segment *)
(* NB This cumulates with the preverb glueing but not with itself *)
| [ (sfxph,sfx,s) :: [ (ph,rstem,sv) :: r ] ] when sfx_phase sfxph
......
......@@ -780,6 +780,9 @@ value record_part_m_th verbal stem entry =
match entry with
[ "cint" -> let pprm = Pprm_ 10 Primary (revcode "cintayaan") entry in
record_part pprm (* irregular *)
| "muc#1" | "sp.rz#1" ->
let mid_stem = rfix stem "aana" in (* Whitney§752 *)
record_part_m verbal mid_stem entry
| _ -> let mid_stem = trunc_a (rfix stem "amaana") (* -maana *) in
(* [trunc_a] needed because possible retroflexion in amaa.na *)
record_part_m verbal mid_stem entry
......@@ -1196,8 +1199,11 @@ value compute_active_present2 sstem wstem set entry third = do
; compute_athematic_imperative2a sstem wstem set entry
; match wstem with
[ [ 2 :: _ ] -> (* Ppr of roots in -aa is complex and overgenerates *)
let m_pstem = wstem and f_pstem = rev (fix2w wstem "at" set) in
record_part (Ppra_ 2 Primary m_pstem f_pstem entry)
match entry with
[ "maa#1" -> () (* no ppra *)
| _ -> let m_pstem = wstem and f_pstem = rev (fix2w wstem "at" set) in
record_part (Ppra_ 2 Primary m_pstem f_pstem entry)
]
| _ -> let m_pstem = if entry = "han#1" then revstem "ghn"
else correct2 wstem in
let f_pstem = if entry = "han#1" then revstem "ghnat"
......
......@@ -8,4 +8,4 @@
(**************************************************************************)
(* Generated by make version - see main Makefile *)
value version="3.05" and version_date="2018-02-23";
value version="3.05" and version_date="2018-02-27";
......@@ -18,6 +18,7 @@ philological applications:
It may also be used for interactive consulting of a Sanskrit Dictionary
with grammatical knowledge, on the Web, on a computer workstation,
or on a personal communicator device.
Finally, it may be used as support for teaching the language.
This project is the follow-up of two previous stages.
......@@ -51,9 +52,9 @@ This constituted the thesis research of Benoît Razet.
From 2006 onwards, an international cooperation on Sanskrit Computational
Linguistics was started between INRIA and the Sanskrit Studies Department
at the University of Hyderabad. The goal of this joint team is to develop
inter-operable packages for the manipulation of Sanskrit corpus, as
interlinked Web services.
at the University of Hyderabad, headed by Pr. Amba kulkarni. The goal of this
joint team is to develop inter-operable packages for the processing of
Sanskrit corpus, as communicating Web services.
In 2011-2012, Pawan Goyal spent a post-doctoral year working with
Gérard Huet on the Sanskrit Platform. He contributed many new modules:
......
VERSION='3.05'
DATE='2018-02-23'
DATE='2018-02-27'
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment