This repository was archived by the owner on Jan 30, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathsearch.html
More file actions
115 lines (109 loc) · 4.55 KB
/
search.html
File metadata and controls
115 lines (109 loc) · 4.55 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<!--
* Copyright © 2003 Sun Microsystems, Inc
* All rights reserved.
* Notice of copyright on this source code
* product does not indicate publication.
*
* RESTRICTED RIGHTS LEGEND: Use, duplication, or disclosure by
* the U.S. Government is subject to restrictions as set forth
* in subparagraph (c)(1)(ii) of the Rights in Technical Data
* and Computer Software Clause at DFARS 252.227-7013 (Oct. 1988)
* and FAR 52.227-19 (c) (June 1987).
* Sun Microsystems, Inc., 4150 Network Circle,
* Santa Clara, California 95054, U.S.A.
*
-->
<html>
<head>
<title>Full-Text Search</title>
<link rel="stylesheet" type="text/css" href="../wizard.css" title="Style">
<link rel="stylesheet" type="text/css" href="../jhug.css" title="Style">
</head>
<body bgcolor="#ffffff">
<h2>Full-Text Search</h2>
<p>
The JavaHelp system full-text search engine uses a natural
language search technology that not only retrieves
documents, but locates specific passages within those
documents where answers to queries are likely to be
found. The technology involves a conceptual indexing engine
that analyzes documents to produce an index of their
content and a query engine that uses this index to find
relevant passages in the material.
<p>
As the help author, you create the search database
that is searched by the JavaHelp system full-text search
engine. The process of creating the search database
is described in <a href="searchdb.html">Creating the Full-Text
Search Database</a>.
<h3>How Searching Works</h3>
<p>
To initiate a search the user enters a natural language
query in the search navigator Find text box. The results
are reported back to the user in the following display:
<p align="center">
<img src="../images/search.gif" width="188" height="304">
</p>
<ul type="circle">
<li>The circle in the first column indicates the <a
href=search.html#ranking>ranking</a> of the matches for that topic. The more filled-in
the circle is, the higher the ranking. There are five possible rankings (from
highest to lowest): <img src="../images/ranks.gif"
align="MIDDLE" width="90" height="24">
<li>The number in the second column indicates the number of times the query
was matched in the listed topic.
<li>The text specifies the name of the topic (as specified in the topic's <code><TITLE></code>
tag) in which matches are found. <br>
<br>
<table width="95%">
<tr valign="top">
<td nowrap width="2%"><img src="../../images/hg_note.gif" width="18" height="13">
<td width="98%">To avoid confusion, ensure that the <code><TITLE></code>
tag corresponds to the title used in the table of contents.
</table>
<p>
</ul>
<h4><a name="ranking">Relaxation Ranking</a></h4>
<p>
The search engine uses a technique called <i>relaxation
ranking</i> to identify and score specific passages of
text that are likely to answer the user's query.
The relaxation ranking algorithm compares the user's
query terms with occurrences of the same or related terms
in the help topics. The search engine attempts to find
passages in the help topics in which as many as possible of
the query terms occur in the same form and the same order.
The search engine automatically relaxes these constraints
to identify passages in which:
<ul type="circle">
<li>Not all of the terms occur
<li>The terms occur in different forms
<li>The terms occur in a different order
<li>The terms occur with intervening words
</ul>
<p>The search engine assigns appropriate penalties (that lower the ranking) to
the passages for these deviations from the specified query. </p>
<table width="95%">
<tr valign="top">
<td nowrap width="2%"><img src="../../images/hg_note.gif" width="18" height="13">
<td width="98%">The ranking process improves as queries become more complex
and include more information.
</table>
<h4>Morphing</h4>
<p>
The JavaHelp search engine uses "morphing" technology to
find words with common roots. For example, when the term
"build" is included in a search string, matches that
contain "built", "builder", "building", and "builds" are
returned.
<p><img src="../../images/hg_see.gif" width="18" height="13"><b>See also:</b>
<dl>
<dd><a href="searchdb.html">Creating the Full-Text Search Database</a>
<dd><a href="jhindexer.html">The <code>jhindexer</code> Command</a>
<dd><a href="jhsearch.html">The <code>jhsearch</code> Command</a>
<dd><a href="../locale/loc_search.html">Localizing the Full-Text Search Database</a>
</dl>
<p>
</body>
</html>