Abstract from "Robust Hyperlinks Cost Just Five Words Each", We propose robust hyperlinks as a solution to the problem of broken hyperlinks. A robust hyperlink is a URL augmented with a small "signature", computed from the referenced document. The signature can be submitted as a query to web search engines to locate the document. It turns out that very small signatures are sufficient to readily locate individual documents out of the many millions on the web. Robust hyperlinks exhibit a number of desirable qualities: they can be computed and exploited automatically, are small and cheap to compute (so that it is practical to make all hyperlinks robust), do not require new server or infrastructure support, can be rolled out reasonably well in the existing URL syntax, can be used to automatically retrofit existing links to make them robust, and are easy to understand. In particular, one can start using robust hyperlinks now, as servers and web pages are mostly compatible
LAPIS A user interface, a programmable web browser and text editor that demonstrates how lightweight structure can be used Lightweight Structure is the ability to recognize text structure automatically, using an extensible library of patterns and parsers. Structure can be detected in lots of ways: grammars (e.g. Java or HTML), regular expressions, even manual selections by the user. With lightweight structure, it doesn't matter how the structure was detected--whether by a regular expression, or by a grammar, or by a hand-coded parser. All that matters is the result: a region set, which is a set of intervals in the text. * Text constraints, a new pattern language that lets you write simple but powerful patterns using lightweight structure. * Simultaneous editing, a technique for doing repetitive text edits by controlling multiple cursors. * Selection guessing, a technique that infers multiple selections and text constraint patterns