Overview
Examples
Screenshots
Comparisons
Applications
Download
Documentation
Tutorials
Bazaar
Status & Roadmap
FAQ
Authors & License
Forums
Funding Ultimate++
Search on this site
Search in forums












SourceForge.net Logo
Home » Developing U++ » UppHub » String near match algorithm
Re: String near match algorithm [message #24121 is a reply to message #24116] Sun, 27 December 2009 16:37 Go to previous messageGo to previous message
koldo is currently offline  koldo
Messages: 3361
Registered: August 2008
Senior Veteran
Mindtraveller wrote on Sun, 27 December 2009 13:25

OK. If I search for a word in text, I should split text into words and apply near search algorithm to each word.
1. Is it right?
2. Which value should I compare function result to in each case?


Sorry Mindtraveller

BSdiff and BSpatch work like diff and patch but for binary files instead of for text files.

To compare strings you should have to go to the original Didier algorithms. Perhaps he has something newer Smile.

Best regards
Koldo


Best regards
IƱaki
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: PlotCtrl
Next Topic: question on tool development for the IDE
Goto Forum:
  


Current Time: Thu May 09 06:36:28 CEST 2024

Total time taken to generate the page: 0.03401 seconds