Fast and effective soft links
Article first published online: 10 APR 2012
Copyright © 2012 John Wiley & Sons, Ltd.
Software: Practice and Experience
Volume 43, Issue 5, pages 577–593, May 2013
How to Cite
Akinyemi, J. A. and Clarke, C. L. A. (2013), Fast and effective soft links. Softw: Pract. Exper., 43: 577–593. doi: 10.1002/spe.2122
- Issue published online: 12 APR 2013
- Article first published online: 10 APR 2012
- Manuscript Accepted: 20 MAR 2012
- Manuscript Revised: 15 MAR 2012
- Manuscript Received: 20 JUL 2011
- link recovery;
- traceable links;
- requirements traceability
Inspired by requirements traceability problems, we present a method for implementing fast and effective hypertext links to specific locations within documents. These soft links do not depend on tags, markup, or closed tool sets, yet they can generally survive extensive edits to a document collection, allowing the targets of these links to be located in real collections after years of ongoing and frequent changes. We base our implementation of soft links on an existing passage retrieval algorithm, originally designed for question answering. The method treats the text surrounding the target of a soft link as a passage to be retrieved, creates a signature for that passage, and resolves the link by searching for the passage. The method is evaluated over a large collection of text and two large collections of source code, one written in the C programming language and one written in Java. Copyright © 2012 John Wiley & Sons, Ltd.