|
[x]
Posted via EE Mobile
|
|
| Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
|
|
|
|
|
[x]
The Solution Rating System
|
|
| With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating. - The Grade of the Solution
- The Zone Rank of the Expert Providing the Solution
- The Number of Author and Expert Comments
- The Number of Experts Contributing
- The Feedback of the Community
Your Input Matters Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site. If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
|
|
|
|
Asked by needo_jee in Microsoft Visual Basic.Net, .NET, Miscellaneous Programming
I would like to match strings so that if a specific percentage is matched then consider it a complete match.
like
"welcome to expcrt exchange.com"
The string to find is "expert" (total 6 characters). it should match 5 characters which would be almost 84.2% match
Problems are:
1- string functions cannot be used as it need exact match for given string in the source string.
2- Using loops on source and target strings.. it need to track back references .. if consecutive characters are matched otherwise purge the found number of characters and start ahead of the index where it found 1 matching char.
Is there any such algorithm that allows such kind of comparisons?
-thanks
20091021-EE-VQP-81 - Hierarchy / EE_QW_3_20080625