找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Reversible Grammar in Natural Language Processing; Tomek Strzalkowski Book 1994 Springer Science+Business Media Dordrecht 1994 Parsing.com

[復(fù)制鏈接]
11#
發(fā)表于 2025-3-23 12:24:09 | 只看該作者
12#
發(fā)表于 2025-3-23 14:55:15 | 只看該作者
Reversible Grammars and their Application in Machine Translation,solving. On the other hand, a declarative mode allows the construction of grammars which can be be neutral as to the processes applying to them, whether parser or generator.’.If this neutrality with respect to the process presents obvious theoretical and practical advantages, it imposes some constra
13#
發(fā)表于 2025-3-23 18:02:14 | 只看該作者
,Reversible Machine Translation: What to Do When the Languages Don’t Match Up, not identical to the literal meaning of the natural target translation. We first outline the problem and show, using examples, some common situations in which the problem arises. We then describe a theoretical framework that lets us begin to define what it means to solve the problem. Finally, we pr
14#
發(fā)表于 2025-3-24 01:35:58 | 只看該作者
A Generationist Approach to Grammar Reversibility in Natural Language Processing,the relevance for NLP of the concept that the processes of syntactic parsing and generation can be regarded as inverses of each other. This chapter draws on the experience of developing and implementing a large NLP system that is (1) generation-based and (2) bi-directional in order to suggest that t
15#
發(fā)表于 2025-3-24 03:56:27 | 只看該作者
Semantic Interpretation in a Systemic Functional Grammar,entation of this method — the REVELATION]. semantic interpreter has been developed. This interpreter is derived from a SFG generator for a subset of English — GENESYS — and is thus, in contrast with most reversible grammars, an interpreter based on a generator. Since REVELATION] assumes that some pa
16#
發(fā)表于 2025-3-24 10:03:01 | 只看該作者
Book 1994This task can be viewed from very differentperspectives by theoretical and computational linguists, and computerscientists. The papers in this volume present a broad range ofapproaches to reversible, bi-directional, and non-directional grammarsystems that have emerged in recent years. This is also t
17#
發(fā)表于 2025-3-24 12:36:21 | 只看該作者
0893-3405 terances. This task can be viewed from very differentperspectives by theoretical and computational linguists, and computerscientists. The papers in this volume present a broad range ofapproaches to reversible, bi-directional, and non-directional grammarsystems that have emerged in recent years. This
18#
發(fā)表于 2025-3-24 16:11:52 | 只看該作者
19#
發(fā)表于 2025-3-24 19:42:40 | 只看該作者
A Reversible Constraint-Based Logic Grammar: Application to the Treatment of Secondary Predication to design, in a symmetric way, a parser and a generator from that formalism. This abstract machinery is then exemplified by a detailed study of secondary predications and small clauses within the framework of a principled-based description of language: Government and Binding theory.
20#
發(fā)表于 2025-3-25 00:02:38 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-20 13:00
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
九江市| 永州市| 浙江省| 永济市| 女性| 闽侯县| 贵溪市| 策勒县| 习水县| 贵州省| 平定县| 屏南县| 静安区| 韩城市| 四平市| 延长县| 安徽省| 开平市| 丽水市| 高密市| 苍梧县| 余庆县| 河池市| 长顺县| 新竹市| 甘洛县| 荥经县| 黄陵县| 渝中区| 镇坪县| 永靖县| 秭归县| 腾冲县| 长汀县| 阜南县| 陈巴尔虎旗| 平顺县| 堆龙德庆县| 年辖:市辖区| 清徐县| 明星|