Sharples, M.; Goodley, J.: ¬A comparison of algorithms for hypertext notes network linearization (1994)
0.00
0.0016165356 = product of:
0.0048496067 = sum of:
0.0048496067 = product of:
0.024248032 = sum of:
0.024248032 = weight(_text_:2 in 8635) [ClassicSimilarity], result of:
0.024248032 = score(doc=8635,freq=4.0), product of:
0.10473217 = queryWeight, product of:
2.4695914 = idf(docFreq=10170, maxDocs=44218)
0.042408705 = queryNorm
0.2315242 = fieldWeight in 8635, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.4695914 = idf(docFreq=10170, maxDocs=44218)
0.046875 = fieldNorm(doc=8635)
0.2 = coord(1/5)
0.33333334 = coord(1/3)
- Abstract
- A new computer-based writing environment is being developed which combines a hypertext 'ideas organizer' with a text editor. Compares 2 algortihms which could be used in such environments for turning networks of notes indicating ideas into linear draft documents. The algorithms are designed to produce a linear ordering of the notes which is acceptable to the writer as a first draft of the document. Reports on experiments to test their effectiveness. Subject were asked to create notes networks which were then linearized by the 2 algorithms. The resulting linearization created by hand, were assessed for textual organization. The experiments indicate that both algorithms produce linearizations which are acceptable as draft texts, that the best first algortihm is marginally superior to the hill climbing one, and that providing information to the algorithms about link types had little effect on their effectiveness. Concludes by describing an implementation of the best first algorithm as part of the Writer's Assistant writing environment
