Potent - The XPath Rule Generalizer
This package builds atop Potent Tools to solve a single problem: given a set of XPath expressions, find the most specific expression which matches everything the original set would have. This allows you to learn a generalized pattern, e.g., for scraping data. A simple use case has a user specifying some example nodes, then you running
potent.simplify(thoseNodes) and the resultant expression should capture all the 'similar content' on a page.
yarn add potent
A common use-case, find elements and generalize the selector as you go:
const potent = ;let currentRule = potent;while...// e.g., user selects an element, userElementnewElement = potent;currentRule = potent;// use currentRule to find all matching elements.const allMatchingElements = potent;
XPathNodes result = potent;
takes a DOM element and turns it in to an object appropriate for simplifying.
XPathNodes common = potent;
takes in two results from
.get and produces the common query between them.
produces the XPath expression for this string.
DOMElementList matching = potent
produces a set of matching elements from your document for query
Where did this come from? This was the backend to a commercial project I embarked on in 2012 to provide a GUI scraping tool for academic researchers to collect data from government websites and other mostly-structured online data sources. The business was abandoned and instead became a set of tools I used for my own research and consulting efforts. The current version is effectively just a polished up version of that original code.
What about grouping rules? A common problem in this form of scraping occurs when you wish to collect tuples of data. If all fields are always available, then simple index matching will work. When fields are sporadically missing, it will not -- a way to avoid this problem is to match in stages; for example, match a collection of outer elements first, then iterate over them and match the requisite inner elements.
Is this problem well-defined?
Not really! There are many cases where the right decision is subjective -- for example, if we select
/a/b/d, a decision must be made whether to match
/a/b/(c|d). To support this, we calculate a configurable violation cost for each non-matching pair with the end goal being finding the minimum cost set. Similar cases apply on attribute patterns. The decisions as they have been made here have been used by a small number of users in production for many years.
Is there a GUI? Not publicly, yet.
Can I use prewritten XPath queries?
Yes, but only simple ones. For example, this is a valid usage of
const potent = ;const rule = potent; // -> '//div.title/a[@id]'const allTitles = potent; // -> ['Title 123', 'Title 124', ... 'Title 456', ..., 'Title 998', 'Title 999']
However, this relies on
XPathNodes::fromString() which is only partially implemented -- simple paths, attributes and anything produced from
.toString() should be functional.
Dual-licensed MIT or BSD-3-Clause. There is significant dependency on BSD-3-Clause licensed code, due to the use of old Firebug code from potent-tools.