登录
首页 » Perl » extract-chs-sentence

extract-chs-sentence

于 2013-08-04 发布 文件大小:3KB
0 228
下载积分: 1 下载次数: 4

代码说明:

  可实现自动对中文句子进行自动切分,及完成切句子的功能。并且算法里有完整的utf8类型的识别函数。(Can realize automatic sentences for Chinese automatic segmentation, and the completion of the sentence cut function. And the algorithm has the complete identification of the type utf8 function.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 基于非线性薛定谔方程的锁模光纤激光器仿真
    基于非线性薛定谔方程的锁模光纤激光器仿真(Simulation of mode-locked fiber laser based on nonlinear Schrodinger equation)
    2021-04-15 10:48:54下载
    积分:1
  • lin2
    说明:  微网中逆变器准比例谐振控制模型,实现逆变器准pr控制,仿真效果很好。(Quasi-proportional Resonance Control Model of Inverter in Microgrid)
    2021-03-05 15:59:31下载
    积分:1
  • 基于多层编码遗传算法的车间调度算法(程序)
    遗传算法车间调度,基于matlab的一套车间调度遗传算法的实现过程的源代码(Genetic Algorithms for Job Shop Scheduling)
    2020-06-24 05:40:02下载
    积分:1
  • src
    银行管理程序,实现简单管理员删户开户,转账等功能(Bank management program)
    2013-05-28 13:54:49下载
    积分:1
  • 这是一个能在51中运行的精简UCOSII操作系统
    这是一个能在51中运行的精简UCOSII操作系统-This is a run in 51 operating system to streamline UCOSII
    2023-05-02 07:35:04下载
    积分:1
  • bearmtx
    悬臂梁的matlab编写程序实现可视化,并计算固有频率(This is a program written by an Israeli professor to calculate rotor dynamics)
    2019-05-07 19:29:04下载
    积分:1
  • Flat
    说明:  Flat D7 lsakakm kdklnd kidjn pwd nw nwpdnwm owqjkewqop jopqwm
    2020-06-25 20:40:01下载
    积分:1
  • 3-ph PWM rectifier with PFC
    采用PSIM软件(Powersim)三相PWM整理器 ,单位功率因数整流(3-ph PWM rectifier with PFC)
    2018-05-05 11:46:48下载
    积分:1
  • 遗传算法求解多旅行商问题
    说明:  旅行商问题(TravelingSalesmanProblem,TSP)是一个经典的组合优化问题。经典的TSP可以描述为:一个商品推销员要去若干个城市推销商品,该推销员从一个城市出发,需要经过所有城市后,回到出发地。应如何选择行进路线,以使总的行程最短。从图论的角度来看,该问题实质是在一个带权完全无向图中,找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列,随着顶点数的增加,会产生组合爆炸,它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
    2020-06-17 11:00:02下载
    积分:1
  • 代鬼批量订单
    生成批订单
    2022-01-25 14:27:40下载
    积分:1
  • 696516资源总数
  • 106918会员总数
  • 4今日下载