找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Sanskrit Computational Linguistics; 4th International Sy Girish Nath Jha Conference proceedings 2010 The Editor(s) (if applicable) and The

[复制链接]
楼主: ODE
发表于 2025-3-23 12:05:31 | 显示全部楼层
,Modelling Aṣṭādhyāyī: An Approach Based on the Methodology of Ancillary Disciplines (,),tures are added to my earlier modelling of Pāṇinian system of Sanskrit grammar. This includes broader coverage of the Pāṇinian meta-language, mechanism for automatic application of rules and positioning the grammatical system within the procedural complexes of ancillary disciplines.
发表于 2025-3-23 14:39:06 | 显示全部楼层
发表于 2025-3-23 20:52:58 | 显示全部楼层
,On the Generalizability of Pāṇini’s Pratyāhāra-Technique to Other Languages,ras. In the present paper we demonstrate that Pāṇini’s pratyāhāra method is generalizable to the description of the phonological systems of other languages by applying it to the sound classes and phonological alternations of German. Furthermore, we compare Pāṇini’s pratyāhāra technique with the tech
发表于 2025-3-24 00:33:01 | 显示全部楼层
Building a Prototype Text to Speech for Sanskrit, simplified Sanskrit phone set, and employing a unit selection technique, where prerecorded sub-word units are concatenated to synthesize a sentence. We also discuss the issues involved in building a full-fledged text-to-speech for Sanskrit.
发表于 2025-3-24 02:37:18 | 显示全部楼层
,Rule-Blocking and Forward-Looking Conditions in the Computational Modelling of Pāṇinian Derivation,ations of his grammar against each other and against bodies of extant Sanskrit texts. To model Pāṇinian procedure requires creating data structures and a framework that allow one to approximate the statement of Pāṇinian rules in an executable language. Scharf (2009: 117-125) provided a few examples
发表于 2025-3-24 08:32:05 | 显示全部楼层
发表于 2025-3-24 11:49:52 | 显示全部楼层
发表于 2025-3-24 18:55:43 | 显示全部楼层
,Generative Graph Grammar of Neo-Vaiśeṣika Formal Ontology (NVFO),here is a need to develop suitable graph grammars. Ontological structures are fundamentally graphs. We work within the formal framework of Neo-Vaiśeṣika Formal Ontology (NVFO) to propose a generative graph grammar. The proposed formal grammar only produces well-formed graphs that can be readily inte
发表于 2025-3-24 21:30:01 | 显示全部楼层
,Headedness and Modification in Nyāya Morpho-Syntactic Analysis: Towards a Bracket-Parsing Model,e seen as .. and . respectively. Several representative sentences have been exemplified using the method developed. . and . not only come through to give a thorough analysis at word level, but may be extended, as it has been shown in this paper, to get a thorough analysis at syntactic and discourse
发表于 2025-3-25 01:24:10 | 显示全部楼层
Citation Matching in Sanskrit Corpora Using Local Alignment,c literature. The goal of this paper is to present methods for performing citation matching on Sanskrit texts. Exact matching and approximate matching are the two methods for performing citation matching. The exact matching method checks for exact occurrence of the citation with respect to the textu
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 18:34
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表