標(biāo)題: Titlebook: Electronic Dictionaries and Automata in Computational Linguistics; LITP Spring School i Maurice Gross,Dominique Perrin Conference proceedin [打印本頁] 作者: EXERT 時間: 2025-3-21 16:47
書目名稱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é)科排名
作者: FLIC 時間: 2025-3-21 23:56
Some pronominalization issues in generation of texts in romance languages,作者: Servile 時間: 2025-3-22 01:35
The use of finite automata in the lexical representation of natural language,作者: Conscientious 時間: 2025-3-22 05:38 作者: 冥界三河 時間: 2025-3-22 09:00 作者: corn732 時間: 2025-3-22 13:26
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作者: corn732 時間: 2025-3-22 20:13 作者: Preamble 時間: 2025-3-22 21:35
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作者: PANIC 時間: 2025-3-23 04:09 作者: 起皺紋 時間: 2025-3-23 09:22 作者: maladorit 時間: 2025-3-23 10:03
Conference proceedings 1989 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 la作者: 我們的面粉 時間: 2025-3-23 16:13 作者: 指令 時間: 2025-3-23 18:05 作者: organic-matrix 時間: 2025-3-24 02:07 作者: hemoglobin 時間: 2025-3-24 03:34 作者: 系列 時間: 2025-3-24 08:30 作者: 帶來 時間: 2025-3-24 13:58
978-3-540-51465-7Springer-Verlag Berlin Heidelberg 1989作者: adequate-intake 時間: 2025-3-24 15:35 作者: 剛開始 時間: 2025-3-24 19:36 作者: 滔滔不絕地說 時間: 2025-3-25 01:19
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/306264.jpg作者: obligation 時間: 2025-3-25 03:59 作者: 軍械庫 時間: 2025-3-25 08:20 作者: bronchodilator 時間: 2025-3-25 15:23 作者: 惡心 時間: 2025-3-25 16:57
Data compression with substitution, The average expected compression ratio is often close to 2. Most methods have a bad behaviour when error appears in encoded texts. One bit lost and the decompression is almost impossible!.To increase the compression ratios, other methods can be used. Arithmetic coding is such an example which leads作者: PON 時間: 2025-3-25 23:14 作者: Melodrama 時間: 2025-3-26 02:37
The lexical analysis of French,nary step before syntactic analysis. We have shown that important linguistic problems appear during this basic step. Some of them cannot yet be solved (recognition of proper names, compound verbs, and so on); others, if solved during lexical analysis, facilitates the syntactic analysis by reducing t作者: 騎師 時間: 2025-3-26 06:44 作者: 善辯 時間: 2025-3-26 12:10 作者: 珊瑚 時間: 2025-3-26 12:42 作者: Engulf 時間: 2025-3-26 16:59
Conference proceedings 2012ions. Papers were invited on all aspects of programming language research, including: programming paradigms and styles, methods and tools to write and specify programs and languages, methods and tools for reasoning about programs, methods and tools for implementation, and concurrency and distribution.作者: HPA533 時間: 2025-3-26 22:23
Prediction of Insertion-Site Preferences of Transposons Using Support Vector Machines and Artificialeeping Beauty transposon dataset. We found that both ANN and SVM predictors are excellent in finding the most preferred regions. However, the SVM predictor outperforms the ANN predictor in recognizing preferred sites, in general.作者: Dealing 時間: 2025-3-27 01:47 作者: Fibrillation 時間: 2025-3-27 07:00 作者: negligence 時間: 2025-3-27 13:09 作者: llibretto 時間: 2025-3-27 14:11 作者: exercise 時間: 2025-3-27 20:58 作者: 不如屎殼郎 時間: 2025-3-28 00:19 作者: MOTIF 時間: 2025-3-28 03:51
