Patent Document ID: 9563635
Application ID: 14064605

Base Claim:
1. A method for eliminating redundant information in a log file having unknown grammar, the method comprising: identifying, by one or more computer processors, an alphanumeric string in a log file, the alphanumeric string comprising a plurality of alphanumeric substrings separated by non-alphanumeric characters, the plurality of alphanumeric substrings including at least two distinct alphanumeric substrings; replacing, by the one or more computer processors, each alphanumeric substring of the plurality of alphanumeric substrings with a first alphanumeric character to generate a first resulting string that includes the non-alphanumeric characters and multiple occurrences of the first alphanumeric character; replacing, by the one or more computer processors, each pair of characters of the first resulting string that is identical to another pair of characters of the first resulting string with a second alphanumeric character to generate a second resulting string, wherein replacing each pair of characters of the first resulting string that is identical to another pair of characters of the first resulting string with a second alphanumeric character to generate a second resulting string comprises: responsive to determining that there are multiple distinct pairs of characters of the first resulting string that are identical to another pair of characters of the first resulting string and that the multiple distinct pairs of characters occur an equal number of times in the first resulting string, selecting, by the one or more computer processors, a pair of the multiple distinct pairs of characters based on a pre-defined hierarchy of characters included in the multiple distinct pairs of characters, and replacing, by the one or more computer processors, the selected pair of characters with the second alphanumeric character to generate the second resulting string; and replacing, by the one or more computer processors, consecutive occurrences of the second alphanumeric character, in the second resulting string, with one occurrence of the second alphanumeric character to generate a compressed string.

---

Claim 3:
3. The method of claim 1 , wherein the replacement of each pair of characters of the first resulting string that is identical to another pair of characters of the first resulting string is achieved by a byte-pair encoding algorithm.