-
编辑距离
简介 至少需要多少次的处理才能将一个字符串变成另一个字符串安装python-Levenshteinconda指定对应的环境activate tensorflow(envname) 然后再下载相应的包python实践 比较两个文本的相似距离 参考：https://blog.csdn.net/HappyRocking/article/details/86491042 def minDistance(word1, word2): """ :t...…
-
ShopSign: a Diverse Scene Text Dataset of Chinese Shop Signs in Street Views
Zhang C, Peng G, Tao Y, et al. ShopSign: a Diverse Scene Text Dataset of Chinese Shop Signs in Street Views[J]. arXiv preprint arXiv:1903.10412, 2019. shopsign: a diverse scene text dataset of chinese shop signs in street views 展示牌：一种多...…
-
Automatic Error Checking and Correction of Electronic Medical Records
Yuan-Yuan Lv, Yong-Li Deng, Ming-Liang Liu, Qi-Yong Lu:Automatic Error Checking and Correction of Electronic Medical Records. FSDM 2015: 32-40 下载要钱摘要 Tn this paper, an effective error checking and correction method of or Chinese medical re...…
-
OCR of Historical Printings of Latin Texts: Problems, Prospects, Progress
Springmann U, Najock D, Morgenroth H, Schmid H, Gotscharek A, Fink F (2014) OCR of Historical Printings of Latin Texts: Problems, Prospects, Progress. In: Proceedings of the First InternationalConference on Digital Access to Textual Cultural Her...…
-
Unsupervised profiling of OCRed historical documents[B刊]
Ulrich Reffle, Christoph Ringlstetter:Unsupervised profiling of OCRed historical documents. Pattern Recognition 46(5): 1346-1357 (2013) 不好下载 摘要 In search engines and digital libraries, more and more OCRed historical docume...…
-
Learning string distance with smoothing for OCR spelling correction【C刊】
Daniel Hládek, Ján Stas, Stanislav Ondás, Jozef Juhár, László Kovács:Learning string distance with smoothing for OCR spelling correction. Multimedia Tools Appl. 76(22): 24549-24567 (2017)摘要 large databases of scanned documents (medical reco...…
-
Upcycle Your OCR: Reusing OCRs for Post-OCR Text Correction in Romanised Sanskrit
Amrith Krishna, Bodhisattwa Prasad Majumder, Rajesh Shreedhar Bhat, Pawan Goyal:Upcycle Your OCR: Reusing OCRs for Post-OCR Text Correction in Romanised Sanskrit. CoNLL 2018: 345-355 【C会】 upcycle vt.升级改造。即; 用创新的方式将某样东西改造以让发挥新的功效。与r...…
-
Adaptive Edit-Distance and Regression Approach for Post-OCR Text Correction
摘要 Post-processing is a crucial step in improving the performance of OCR process. In this paper, we present a novel approach which explores a modified way of candidate generating and candidate scoring at character level as well as word level....…
-
PoCoTo - an open source system for efficient interactive postcorrection of OCRed historical texts
Thorsten Vobl, Annette Gotscharek, Ulrich Reffle, Christoph Ringlstetter, Klaus U. Schulz:PoCoTo - an open source system for efficient interactive postcorrection of OCRed historical texts.DATeCH 2014: 57-61 下载要钱摘要 When applied to historica...…
-
[开源期刊C以下]Deep Learning-Aided OCR Techniques for Chinese Uppercase Characters in the Application of Internet of Things
Yue Yin, Wei Zhang, Sheng Hong, Jie Yang, Jian Xiong, Guan Gui:Deep Learning-Aided OCR Techniques for Chinese Uppercase Characters in the Application of Internet of Things.IEEE Access 7: 47043-47049 (2019) IEEE Access： 开源期刊，审稿速度快 ...…
-
647. Palindromic Substrings
Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.给定一个字符串，您的任务是计算此字符串中的回文子串数。具有不...…
-
百度API使用
过程 最开始对着官网安装，下载，一直出错，在wins电脑上使用pip安装不了 官网API:https://cloud.baidu.com/doc/OCR/OCR-API/24.5C.E8.B0.83.E7.94.A8.E6.96.B9.E5.BC.8F.html http://ai.baidu.com/forum/topic/show/867951 使用147电脑，选中合适的python,,然后直接进入pycharm—settings——编译器中选中+,...…
-
983. Minimum Cost For Tickets
In a country popular for train travel, you have planned some train travelling one year in advance. The days of the year that you will travel is given as an array days. Each day is an integer from 1 to 365.Train tickets are sold in 3 different wa...…
-
快捷键使用
pycharm快捷键 shift+tab 代码前移 Ctrl + R 替换 Ctrl + Shift + F 全局查找 Ctrl + Shift + R 全局替换…
-
70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a positive integer.Example 1:Input: 2Output: 2Explanation: Th...…
-
Latex安装使用
安装 https://www.bilibili.com/video/av47955269?from=search&seid=16088214270855146026 参考以上网址，下载镜像 我使用的是拷贝的2018的iso镜像 使用ultraISO，加载该文件， 具体步骤如下：（1）打开“UltraISO”，选择“工具”选项卡，选择“加载到虚拟光驱 ”（2）选择要打开的iso文件，单击“加载”（3）进入“我的电脑”，会出现虚拟光驱已加载文件3 运行iso文件中的insta...…
-
931. Minimum Falling Path Sum
Given a square array of integers A, we want the minimum sum of a falling path through A.A falling path starts at any element in the first row, and chooses one element from each row. The next row’s choice must be in a column that is different from...…
-
877. Stone Game
Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].The objective of the game is to end with the most stones. The total number of ston...…
-
338. Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.给定非负整数num。 对于0≤i≤_n范围内的每个数字i，计算其二进制表示中的1的数量并将它们作为数组返回。Example 1:Input: 2Ou...…
-
1025. Divisor Game
Alice and Bob take turns playing a game, with Alice starting first.Initially, there is a number N on the chalkboard. On each player’s turn, that player makes a move consisting of: Choosing any x with 0 < x < N and N % x == 0. Replacing th...…
