Skip to main content

Critical Edition of Sanskrit Texts

  • Conference paper
Sanskrit Computational Linguistics (ISCLS 2007, ISCLS 2008)

Abstract

A critical edition takes into account all the different known versions of the same text in order to show the differences between any two distinct versions. The construction of a critical edition is a long and, sometimes, tedious work. Some software that help the philologist in such a task have been available for a long time for the European languages. However, such software does not exist yet for the Sanskrit language because of its complex graphical characteristics that imply computationally expensive solutions to problems occurring in text comparisons.

This paper describes the Sanskrit characteristics that make text comparisons different from other languages, presents computationally feasible solutions for the elaboration of the computer assisted critical edition of Sanskrit texts, and provides, as a byproduct, a distance between two versions of the edited text. Such a distance can then be used to produce different kinds of classifications between the texts.

This paper was supported by the ACI CNRS “histoire des savoirs” and the Asia IT & C contract 2004/091-775.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O’Hara, R.J., Robinson, P.: Computer-assisted methods of stemmatic analysis. In: Blake, N., Robinson, P. (eds.) Occasional Papers of the Canterbury Tales Project. Office for Humanities Communication, vol. 1, pp. 53–74. Office for Humanities Communication, Oxford Univerity (1993)

    Google Scholar 

  2. Monroy, C., et al.: Visualization of variants in textual collations to analyse the evolution of literary works in the cervantes project. In: Agosti, M., Thanos, C. (eds.) ECDL 2002. LNCS, vol. 2458, pp. 638–653. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Münster University: Digital nestle-aland (2006), http://nestlealand.uni-muenster.de/index.html

  4. Monier-Williams, M.: A Sanskrit English Dictionary. Clarendon Press, Oxford (1899)

    Google Scholar 

  5. Velthuis, F.: Devanāgarī for TEX , Version 1.2, User Manual (1991), http://www.ctan.org/tex-archive/language/devanagari/velthuis/

  6. Le Pouliquen, M.: Filiation de manuscrits sanskrit et arbres phylogénétiques. In: Mathématiques & Sciences Humaines (accepted for publication) (2007)

    Google Scholar 

  7. Gale, W.A., Church, K.: A program for aligning sentences in bilingual corpora. Computational Linguistics 19(3), 75–102 (1993)

    Google Scholar 

  8. Saitou, N., Nei, M.: The neighbour-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology Evolution 4, 406–425 (1987)

    Google Scholar 

  9. Huet, G.: Héritage du sanskrit: Dictionnaire français-sanskrit (2006), http://sanskrit.inria.fr/Dico.pd

  10. Huet, G.: Design of a lexical database for sanskrit. In: COLING Workshop on Electronic Dictionaries, Geneva, pp. 8–14 (2004)

    Google Scholar 

  11. Paxson, V.: GNU Flex Manual, Version 2.5.3. Free Software Foundation, Cambridge, Mass. (1996), http://www.gnu.org/software/flex/manual/

  12. Lesk, M.E., Schmidt, E.: Computing science technical report 39. Technical report, Bell Laboratories. Murray Hill, NJ (1975)

    Google Scholar 

  13. Renou, L.: Grammaire sanskrite: phonétique, composition, dérivation, le nom, le verbe, la phrase. Maisonneuve, Paris (1996) (réimpression)

    Google Scholar 

  14. Hunt, J.W., Szymanski, T.: Fast algorithm for computing longest common subsequence. CACM 20(5), 350–353 (1977)

    Article  Google Scholar 

  15. Hirschberg, D.: A linear space algorithm for computing maximal common subsequences. CACM 18, 341–343 (1975)

    Article  Google Scholar 

  16. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)

    Book  Google Scholar 

  17. Myers, E.W.: An O(ND) difference algorithm and its variations. Algorithmica 1(2), 251–266 (1986)

    Article  Google Scholar 

  18. Charras, C., Lecroq, T.: Sequence comparaison, http://www-igm.univ-mlv.fr/~lecroq/seqcomp/seqcomp.ps

  19. Haralambous, Y.: Fonts & Encodings. O’reilly Media, Inc., Sebastopol (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csernel, M., Patte, F. (2009). Critical Edition of Sanskrit Texts. In: Huet, G., Kulkarni, A., Scharf, P. (eds) Sanskrit Computational Linguistics. ISCLS ISCLS 2007 2008. Lecture Notes in Computer Science(), vol 5402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00155-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00155-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00154-3

  • Online ISBN: 978-3-642-00155-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics