找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Electronic Dictionaries and Automata in Computational Linguistics; LITP Spring School i Maurice Gross,Dominique Perrin Conference proceedin

[復(fù)制鏈接]
查看: 15905|回復(fù): 37
樓主
發(fā)表于 2025-3-21 16:47:31 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Electronic Dictionaries and Automata in Computational Linguistics
副標(biāo)題LITP Spring School i
編輯Maurice Gross,Dominique Perrin
視頻videohttp://file.papertrans.cn/307/306264/306264.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Electronic Dictionaries and Automata in Computational Linguistics; LITP Spring School i Maurice Gross,Dominique Perrin Conference proceedin
描述This volume contains the proceedings of the 15th Spring School of the LITP (Laboratoire d‘Informatique Théorique et de Programmation, Université Paris VI-VII, CNRS) held from May 25 to 29, 1987 in Saint-Pierre d‘Oléron. The meeting was organized by M. Borillo, M. Gross, M. Nivat and D. Perrin. The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The proceedings of the last three Spring Schools have already been published in this series and deal with "Automata on Infinite Words" (LNCS 192), "Combinators and Functional Programming Languages " (LNCS 242) and "Automata Networks" (LNCS 316). The contributions gathered for the 1987 conference present a unique combination of automata theory on the one hand and natural language processing on the other hand. Both fields have strong historical links as exemplified by the works of Chomsky and Harris in Linguistics, the work of Backus and others in Computer Science and the work of Schützenberger in Algebra. The methods described and discussed in the field of string processing and automata cover the traditional algorithms for string matching, data compression, sequence
出版日期Conference proceedings 1989
關(guān)鍵詞Algebraic Language Theory; Algebraische Sprachtheorie; Electronic Dictionaries; Elektronische Lexika; En
版次1
doihttps://doi.org/10.1007/3-540-51465-1
isbn_softcover978-3-540-51465-7
isbn_ebook978-3-540-48140-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1989
The information of publication is updating

書目名稱Electronic Dictionaries and Automata in Computational Linguistics影響因子(影響力)




書目名稱Electronic Dictionaries and Automata in Computational Linguistics影響因子(影響力)學(xué)科排名




書目名稱Electronic Dictionaries and Automata in Computational Linguistics網(wǎng)絡(luò)公開度




書目名稱Electronic Dictionaries and Automata in Computational Linguistics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Electronic Dictionaries and Automata in Computational Linguistics被引頻次




書目名稱Electronic Dictionaries and Automata in Computational Linguistics被引頻次學(xué)科排名




書目名稱Electronic Dictionaries and Automata in Computational Linguistics年度引用




書目名稱Electronic Dictionaries and Automata in Computational Linguistics年度引用學(xué)科排名




書目名稱Electronic Dictionaries and Automata in Computational Linguistics讀者反饋




書目名稱Electronic Dictionaries and Automata in Computational Linguistics讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:56:32 | 只看該作者
Some pronominalization issues in generation of texts in romance languages,
板凳
發(fā)表于 2025-3-22 01:35:44 | 只看該作者
The use of finite automata in the lexical representation of natural language,
地板
發(fā)表于 2025-3-22 05:38:04 | 只看該作者
5#
發(fā)表于 2025-3-22 09:00:40 | 只看該作者
6#
發(fā)表于 2025-3-22 13:26:21 | 只看該作者
The lexical analysis of French,. Each of these problems is well-known. What we have attempted here is to formulate them in such a form that they can be represented by finite automata and treated by the corresponding algorithms. It should be clear that the number of automata to be built, their size and the formulation of their int
7#
發(fā)表于 2025-3-22 20:13:49 | 只看該作者
8#
發(fā)表于 2025-3-22 21:35:39 | 只看該作者
Conference proceedings 1989works of Chomsky and Harris in Linguistics, the work of Backus and others in Computer Science and the work of Schützenberger in Algebra. The methods described and discussed in the field of string processing and automata cover the traditional algorithms for string matching, data compression, sequence
9#
發(fā)表于 2025-3-23 04:09:03 | 只看該作者
10#
發(fā)表于 2025-3-23 09:22:46 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-23 17:38
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
威信县| 寿阳县| 长武县| 密山市| 玉门市| 时尚| 武邑县| 上犹县| 青川县| 邵武市| 闻喜县| 大邑县| 灵山县| 四川省| 常山县| 郸城县| 清水县| 余干县| 云浮市| 垣曲县| 临沂市| 邢台县| 桐乡市| 阜康市| 山东| 沙河市| 甘孜| 霞浦县| 彭山县| 视频| 吴江市| 河源市| 和田县| 台州市| 深圳市| 定结县| 东乌| 和林格尔县| 句容市| 垫江县| 汉中市|