StringMatch now FREE. Download newest version

StringMatch

Download Download Now   Buy Now Buy Now
Size: 1 MB $ 19.95 License: Shareware

StringMatch is a System Utilities::Other software developed by Istvan Szendro. After our trial and test, the software was found to be official, secure and free. Here is the official description for StringMatch: StringMatch analyzes a text file to find all repetitive strings in Repetitions mode, or all unique strings in Uniques mode.
Unlike usual text comparison programs that proceed character by character, StringMatch proceeds by text units of word, sentence, or paragraph, as instructed when started. It is fast and can process text containing millions of characters.
You define yourself what StringMatch should consider valid characters in a file. All you need to do is create a plain text file (an alphabet file) containing the valid characters. Any other characters in the source file will be treated as white space (separator) characters during processing.
So if your alphabet file only contains letters but no digits, then the strings '15 men on the dead man's chest' and '10 men on the dead man's chest' will be found to be identical.
Or if your alphabet file doesn't contain the letter 't', then the source string 'Peter' will be treated as if it was 'Pe er' (two words).
You can specify the minimum length of matching text units you want to appear in the results. This does not affect the maximum length of results -- StringMatch will find the longest possible matching strings.
Processing can be case-sensitive or case-insensitive.
StringMatch performs two passes on the source file.
Pass 1 finds all repetitive strings: when it encounters parts of the source file that are identical, it pursues those strings until they diverge.
Pass 2 performs deep analysis on Pass 1 results to identify their internal structure, looking for repetitions within, and overlaps between, Pass 1 results. StringMatch uses this fine-grain information to present final results in an intelligent and meaningful way.
Results are output to a file you specify, or to your default browser, sorted by your criteria.

StringMatch has some unique features:

Deep Analysis
After finding all repetitive strings in a first pass, StringMatch analyzes its own results in a second pass to find and interpret repetitive patterns within, and overlaps between, strings found in the first pass, enabling it to present the final results in a meaningful way.
Just one example (words are represented by digits for simplicity): Pass 1 will find that the source string '1 2 3 1 2 3 1 2 3' has the string '1 2 3 1 2 3' occurring twice, and that they overlap each other. Pass 2 analysis will reveal that '1 2 3 1 2 3' is itself repetitive, finds the cycle, and reports the final result: '1 2 3' occurs 3 times in the source file.

Synonyms
You can tell StringMatch to consider certain words as synonyms, and if two or more strings differ only in those words, the two strings will be found identical.
For example, if you specify Intel, Microsoft and IBM as synonyms of enterprise, then StringMatch will find that the three strings
Intel is a company
IBM is a company
Microsoft is a company
are identical, and will report that the string enterprise is a company occurs 3 times.

Text Unit
You can specify the text unit StringMatch should proceed by: word, sentence or paragraph.
Use 'Word' to perform fine-grain analysis and find even short repetitive patterns.
Use 'Sentence' or 'Paragraph' if you are only interested in larger-scale repetitions.

Minimum Length
You can specify the minimum number of text units (words, sentences or paragraphs) a result should have.
If you don't want to see all the 'in a', 'with the', etc. strings, set MinLen accordingly.

Uniques mode
In this mode, StringMatch will find all unique words, sentences or paragraphs in the source file.
For instance, if you select Word for text unit, the result will be a list of all unique words in the source file.

Sorted results by your criteria
You can set StringMatch to present results sorted by length, frequency, or weight (length x frequency) when in Repetitions mode, or alphabetically, by frequency, or by length when in Uniques mode.
Results are always sorted from largest value down.



..
StringMatch analyzes a text file to find all repetitive strings in Repetitions mode, or all unique strings in Uniques mode.
Unlike usual text comparison programs that proceed character by character, StringMatch proceeds by text units of word, sentence, or paragraph, as instructed when started. It is fast and can process text containing millions of characters.
You define yourself what StringMatch should consider valid characters in a file. All you need to do is create a plain text file (an alphabet file) containing the valid characters. Any other characters in the source file will be treated as white space (separator) characters during processing.
So if your alphabet file only contains letters but no digits, then the strings '15 men on the dead man's chest' and '10 men on the dead man's chest' will be found to be identical.
Or if your alphabet file doesn't contain the letter 't', then the source string 'Peter' will be treated as if it was 'Pe er' (two words).
You can specify the minimum length of matching text units you want to appear in the results. This does not affect the maximum length of results -- StringMatch will find the longest possible matching strings.
Processing can be case-sensitive or case-insensitive.
StringMatch performs two passes on the source file.
Pass 1 finds all repetitive strings: when it encounters parts of the source file that are identical, it pursues those strings until they diverge.
Pass 2 performs deep analysis on Pass 1 results to identify their internal structure, looking for repetitions within, and overlaps between, Pass 1 results. StringMatch uses this fine-grain information to present final results in an intelligent and meaningful way.
Results are output to a file you specify, or to your default browser, sorted by your criteria.

StringMatch has some unique features:

Deep Analysis
After finding all repetitive strings in a first pass, StringMatch analyzes its own results in a second pass to find and interpret repetitive patterns within, and overlaps between, strings found in the first pass, enabling it to present the final results in a meaningful way.
Just one example (words are represented by digits for simplicity): Pass 1 will find that the source string '1 2 3 1 2 3 1 2 3' has the string '1 2 3 1 2 3' occurring twice, and that they overlap each other. Pass 2 analysis will reveal that '1 2 3 1 2 3' is itself repetitive, finds the cycle, and reports the final result: '1 2 3' occurs 3 times in the source file.

Synonyms
You can tell StringMatch to consider certain words as synonyms, and if two or more strings differ only in those words, the two strings will be found identical.
For example, if you specify Intel, Microsoft and IBM as synonyms of enterprise, then StringMatch will find that the three strings
Intel is a company
IBM is a company
Microsoft is a company
are identical, and will report that the string enterprise is a company occurs 3 times.

Text Unit
You can specify the text unit StringMatch should proceed by: word, sentence or paragraph.
Use 'Word' to perform fine-grain analysis and find even short repetitive patterns.
Use 'Sentence' or 'Paragraph' if you are only interested in larger-scale repetitions.

Minimum Length
You can specify the minimum number of text units (words, sentences or paragraphs) a result should have.
If you don't want to see all the 'in a', 'with the', etc. strings, set MinLen accordingly.

Uniques mode
In this mode, StringMatch will find all unique words, sentences or paragraphs in the source file.
For instance, if you select Word for text unit, the result will be a list of all unique words in the source file.

Sorted results by your criteria
You can set StringMatch to present results sorted by length, frequency, or weight (length x frequency) when in Repetitions mode, or alphabetically, by frequency, or by length when in Uniques mode.
Results are always sorted from largest value down. you can download StringMatch free now.


ad below
Platforms: Windows NT/2000,Windows XP
Publisher: About Istvan Szendro | Istvan Szendro titles | Visit Istvan Szendro
Downloads: 0 last month, 22 total
Last updated: More than a year ago ()
Watch for updates:
Want to be notified when StringMatch is updated?

5 stars

Email a friend...
User Rating: NOT RATED
Rated by: 0 user(s)
      
Get the best software deals each week!

Deals

bottom

Get Weekly Deals

bottom
In Windows > Free Downloads
  1. 1TextPipe Standard 392811 downloads
  2. 2AnyChart JS Charts and Dashboards 44429 downloads
  3. 3Perfect Keyboard, Free Edition 26311 downloads
  4. 4ActivePresenter 13314 downloads
  5. 5MixPad Professional Audio Mixer 6996 downloads
  6. 6Prism Plus Edition 3340 downloads
  7. 7Switch Plus 2308 downloads
  8. 8TextPipe Engine 1997 downloads
  9. 9Ares Galaxy Turbo Booster 1714 downloads
  10. 10Trojan Remover 1335 downloads
bottom
In Windows > Top Freeware
  1. 1Perfect Keyboard, Free Edition 26598 downloads
  2. 2ECTkeyboard 34901 downloads
  3. 3ActivePresenter 13315 downloads
  4. 4Clipboard Magic 482 downloads
  5. 5British Bingo 302 downloads
  6. 6ExtremeCopy 325 downloads
  7. 7Extreme Injector 71 downloads
  8. 8FBackup 322 downloads
  9. 9Cubic Clipboard Helper 1123 downloads
  10. 10Enigma Virtual Box 82 downloads
bottom