From Paninian Sandhi to Finite State Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

From Paninian Sandhi to Finite State Calculus


The most authoritative description of the morphophonemic rules that apply at word boundaries (external sandhi) in Sanskrit is by the great grammarian Panini (fl. 5th c. B. C. E.). These rules are stated formally in Panini's grammar, the Astadhayi group of eight chapters'. The present paper summarizes Panini's handling of sandhi, his notational conventions, and formal properties of his theory. An XML vocabulary for expressing Panini's morphophonemic rules is then introduced, in which his rules for sandhi have been expressed. Although Panini's notation potentially exceeds a finite state grammar in power, individual rules do not rewrite their own output, and thus they may be automatically translated into a rule cascade from which a finite state transducer can be compiled.
Fichier principal
Vignette du fichier
Hyman.pdf (204.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00202966 , version 1 (08-01-2008)


  • HAL Id : inria-00202966 , version 1


Malcolm D. Hyman. From Paninian Sandhi to Finite State Calculus. First International Sanskrit Computational Linguistics Symposium, INRIA Paris-Rocquencourt, Oct 2007, Rocquencourt, France. ⟨inria-00202966⟩


139 View
1653 Download


Gmail Facebook Twitter LinkedIn More