Trotman, A.: Searching structured documents (2004)
0.03
0.027640268 = product of:
0.055280536 = sum of:
0.055280536 = sum of:
0.011600202 = weight(_text_:a in 2538) [ClassicSimilarity], result of:
0.011600202 = score(doc=2538,freq=12.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.21843673 = fieldWeight in 2538, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=2538)
0.043680333 = weight(_text_:22 in 2538) [ClassicSimilarity], result of:
0.043680333 = score(doc=2538,freq=2.0), product of:
0.16128273 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046056706 = queryNorm
0.2708308 = fieldWeight in 2538, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=2538)
0.5 = coord(1/2)
- Abstract
- Structured document interchange formats such as XML and SGML are ubiquitous, however, information retrieval systems supporting structured searching are not. Structured searching can result in increased precision. A search for the author "Smith" in an unstructured corpus of documents specializing in iron-working could have a lower precision than a structured search for "Smith as author" in the same corpus. Analysis of XML retrieval languages identifies additional functionality that must be supported including searching at, and broken across multiple nodes in the document tree. A data structure is developed to support structured document searching. Application of this structure to information retrieval is then demonstrated. Document ranking is examined and adapted specifically for structured searching.
- Date
- 14. 8.2004 10:39:22
- Type
- a
