Sorting documents according to comprehensibility scores determined for the documents
US-2024119078-A1 · Apr 11, 2024 · US
Automatically mining patterns for rule based data standardization systems
US8996524B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8996524-B2 |
| Application number | US-201213415144-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 8, 2012 |
| Priority date | Mar 7, 2012 |
| Publication date | Mar 31, 2015 |
| Grant date | Mar 31, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
Methods, computer program products and systems are provided for mining for sub-patterns within a text data set. The embodiments facilitate finding a set of N frequently occurring sub-patterns within the data set, extracting the N sub-patterns from the data set, and clustering the extracted sub-patterns into K groups, where each extracted sub-pattern is placed within the same group with other extracted sub-patterns based upon a distance value D that determines a degree of similarity between the sub-pattern and every other sub-pattern within the same group.
First claim
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method for mining for sub-patterns within a text data set, the method comprising: finding a set of N frequently occurring sub-patterns within the data set; extracting the N sub-patterns from the data set; and clustering the extracted sub-patterns into K groups, wherein each extracted sub-pattern is placed within the same group with other extracted sub-patterns based upon a distance value D that determines a degree of similarity bet…
Assignees
Inventors
Classifications
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US8996524B2 cover?
- Methods, computer program products and systems are provided for mining for sub-patterns within a text data set. The embodiments facilitate finding a set of N frequently occurring sub-patterns within the data set, extracting the N sub-patterns from the data set, and clustering the extracted sub-patterns into K groups, where each extracted sub-pattern is placed within the same group with other ex…
- Who is the assignee on this patent?
- Chaturvedi Snigdha, Faruquie Tanveer A, Karanam Hima P, and 4 more
- What technology area does this patent fall under?
- Primary CPC classification G06F16/35. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Mar 31 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).