EditDistance Thinking of using dynamic programming - CodeBus

Welcome！[Sign In] ！[Sign Up]！

Front-page it | Collect it | [中国-简体中文]

FAQ Fav

Location:

Mathimatics-Numerical algorithms

Title: EditDistance

Category:
Data structs
Tags:
[Text]
File Size:
1kb
Update:
2012-11-26
Downloads:
0 Times
Uploaded by:
boluo168608

Description: Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem

Downloaders recently: [More information of uploader boluo168608]

To Search: edit distance string approximate string matching sample code edit distance minimum edit distance

[demo] - text similarity comparison `` `good`
[dpa] - dynamic programming algorithms to find t
[StrMatch] - string comparison procedures. To compare
[editdistance.Rar] - This algorithm is very commonly used alg
[zifuchuanpipeisuanfa] - approximate string matching algorithm is
[Hash_STL(Time)] - The use of C++ Language STL to develop a
[trie_suffix] - Suffix tire tree (tire chart), for use i
[20091235482547] - Three-dimensional visual image to match
[EDIT_Distance] - To achieve the minimum edit distance alg

File list (Check if you may need any files):

EditDistance.txt

Main Category

SourceCode

Web Code

Develop Tools

Document

Other resource

About site

Total codes:120M
Total size:1500GB
Today updated:368
Members:1688565
Today members:634
Total members:198568
Downloaded:1200M

CodeBus www.codebus.net

“CodeBus” is the largest source code store in internet!

1999-2018 CodeBus All Rights Reserved.