找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: ODE
11#
發(fā)表于 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.
12#
發(fā)表于 2025-3-23 14:39:06 | 只看該作者
13#
發(fā)表于 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
14#
發(fā)表于 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.
15#
發(fā)表于 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
16#
發(fā)表于 2025-3-24 08:32:05 | 只看該作者
17#
發(fā)表于 2025-3-24 11:49:52 | 只看該作者
18#
發(fā)表于 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
19#
發(fā)表于 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
20#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-31 01:53
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
望江县| 扶余县| 西吉县| 昭通市| 望江县| 偃师市| 新干县| 洞口县| 山东| 旬阳县| 宣汉县| 丹阳市| 习水县| 长寿区| 大石桥市| 称多县| 上蔡县| 庆阳市| 许昌市| 磴口县| 梓潼县| 阜阳市| 伊金霍洛旗| 广东省| 铁岭市| 济阳县| 桓台县| 常州市| 怀远县| 桐柏县| 南乐县| 共和县| 南宁市| 安图县| 满洲里市| 黎川县| 和龙市| 陇西县| 铁岭市| 鄂温| 远安县|