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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
|
Unit SearchUnit;
{$mode objfpc}{$H+}
{ TODO: Possible speed improvement here is to populate the DictionaryWords
array with already UTF8 text encoded words. That way we don't need
to do conversions each time for each word we search for. This should
be a nice speed impromevent.
}
Interface
// Contains code to search help files.
uses
Classes,
HelpFile,
TextSearchQuery,
IPFFileFormatUnit;
const
// match weightings
mwOnlyTitleWord = 200;
mwFirstTitleWord = 50;
mwTitleWord = 20;
mwOnlyIndexWord = 100;
mwFirstIndexWord = 20;
mwIndexWord = 10;
mwTopicTextWord = 1;
// best case match weighting of a word
mwExactWord = 20;
// note on weightings. The title/index weightings
// are multipled by word weightings.
// Topic text matches are equal to word weighting
// times word weighting.
procedure SearchHelpFile( HelpFile: THelpFile;
Query: TTextSearchQuery;
Results: TList;
WordSequences: TList );
// clear a lsit of word sequences (as produced by above)
procedure ClearWordSequences( WordSequences: TList; DictionaryCount: longint );
Implementation
uses
SysUtils
,HelpTopic
,CompareWordUnit
,nvUtilities
,ACLStringUtility
,fpg_stringutils
;
type
TSearchType = ( stGeneral, stStarts, stExactMatch, stEnds );
procedure ClearWordSequence( WordSequence: TList;
DictionaryCount: longint );
var
StepIndex: longint;
DictionaryRelevances: UInt32ArrayPointer;
begin
for StepIndex := 0 to WordSequence.Count - 1 do
begin
DictionaryRelevances := WordSequence[ StepIndex ];
FreeUInt32Array( DictionaryRelevances, DictionaryCount );
end;
WordSequence.Clear;
end;
procedure ClearWordSequences( WordSequences: TList; DictionaryCount: longint );
var
SequenceIndex: longint;
lWordSequence: TList;
begin
for SequenceIndex := 0 to WordSequences.Count - 1 do
begin
lWordSequence := TList(WordSequences[ SequenceIndex ]);
ClearWordSequence( lWordSequence, DictionaryCount );
lWordSequence.Destroy;
end;
WordSequences.Clear;
end;
// given a Search word which is known to match the Reference word,
// return the relevance
function MatchedWordRelevance( const SearchWord: string;
const ReferenceWord: string ): longint;
begin
Result := mwExactWord
* Length( SearchWord )
div Length( ReferenceWord );
if Result = 0 then
Result := 1;
end;
// Compares the given search word against the given
// reference word. Returns a value indicating how well the
// search word matches, 0 = not at all.
function CompareWord( const SearchWord: string;
const ReferenceWord: string ): longint;
var
OccurrencePos: longint;
begin
Result := 0;
OccurrencePos := CaseInsensitivePos( SearchWord, ReferenceWord );
if OccurrencePos = 0 then
begin
// no match
exit;
end;
Result := MatchedWordRelevance( SearchWord, ReferenceWord );
end;
// Search the help file dictionary for words that match
// the given search word. Partial matches are considered.
// Results returns the matching word indexes.
procedure SearchDictionary( HelpFile: THelpFile;
SearchWord: string;
Results: UInt32ArrayPointer );
var
DictIndex: integer;
DictWord: string;
begin
for DictIndex := 0 to HelpFile.DictionaryCount - 1 do
begin
DictWord := HelpFile.DictionaryWords[ DictIndex ];
// apply encoding conversion
DictWord := ConvertTextToUTF8(HelpFile.Encoding, DictWord);
Results^[ DictIndex ] := CompareWord( SearchWord, DictWord );
end;
end;
// Search the help file dictionary for words that
// match the given search word exactly (except for case-insensitive)
procedure SearchDictionaryExact( HelpFile: THelpFile;
SearchWord: string;
Results: UInt32ArrayPointer );
var
DictIndex: integer;
DictWord: string;
begin
FillUInt32Array( Results, HelpFile.DictionaryCount, 0 );
for DictIndex := 0 to HelpFile.DictionaryCount - 1 do
begin
DictWord := HelpFile.DictionaryWords[ DictIndex ];
// apply encoding conversion
DictWord := ConvertTextToUTF8(HelpFile.Encoding, DictWord);
if SameText( SearchWord, DictWord ) then
Results^[ DictIndex ] := mwExactWord;
end;
end;
// Search the help file dictionary for words that
// start with the given word
procedure SearchDictionaryStarts( HelpFile: THelpFile;
SearchWord: string;
Results: UInt32ArrayPointer );
var
DictIndex: integer;
DictWord: string;
begin
FillUInt32Array( Results, HelpFile.DictionaryCount, 0 );
for DictIndex := 0 to HelpFile.DictionaryCount - 1 do
begin
DictWord := HelpFile.DictionaryWords[ DictIndex ];
// apply encoding conversion
DictWord := ConvertTextToUTF8(HelpFile.Encoding, DictWord);
if StrStartsWithIgnoringCase(DictWord, SearchWord) then
Results^[ DictIndex ] := MatchedWordRelevance( SearchWord, DictWord );
end;
end;
// Search the help file dictionary for words that
// end with the given word
procedure SearchDictionaryEnds( HelpFile: THelpFile;
SearchWord: string;
Results: UInt32ArrayPointer );
var
DictIndex: integer;
DictWord: string;
begin
FillUInt32Array( Results, HelpFile.DictionaryCount, 0 );
for DictIndex := 0 to HelpFile.DictionaryCount - 1 do
begin
DictWord := HelpFile.DictionaryWords[ DictIndex ];
// apply encoding conversion
DictWord := ConvertTextToUTF8(HelpFile.Encoding, DictWord);
if StrEndsWithIgnoringCase( SearchWord, DictWord ) then
Results^[ DictIndex ] := MatchedWordRelevance( SearchWord, DictWord );
end;
end;
// Search titles of topics for given searchword
procedure SearchTopicTitles( HelpFile: THelpFile;
SearchWord: string;
Results: UInt32ArrayPointer );
var
TopicIndex: longint;
Title: string;
TitleWord: string;
Topic: TTopic;
TitleWordIndex: longint;
WordRelevance: longint;
TitleWordRelevance: longint;
tmpTitleWords : TStrings;
i : integer;
begin
tmpTitleWords := TStringList.Create;
// Search topic titles
for TopicIndex := 0 to HelpFile.TopicCount - 1 do
begin
Topic := HelpFile.Topics[ TopicIndex ];
Title:= Topic.Title;
TitleWordIndex := 0;
tmpTitleWords.Clear;
StrExtractStringsQuoted(tmpTitleWords, Title);
for i := 0 to tmpTitleWords.count-1 do
begin
TitleWord := tmpTitleWords[i];
WordRelevance := CompareWord( SearchWord,
TitleWord );
if WordRelevance > 0 then
begin
if TitleWordIndex = 0 then
begin
// matching the first word is best
if i = tmpTitleWords.count-1 then
begin
// in fact it's the only word
TitleWordRelevance := mwOnlyTitleWord * WordRelevance
end
else
TitleWordRelevance := mwFirstTitleWord * WordRelevance
end
else
begin
TitleWordRelevance := mwTitleWord * WordRelevance;
end;
inc( Results^[ Topic.Index ], TitleWordRelevance );
end;
inc( TitleWordIndex );
end;
end;
tmpTitleWords.Free;
end;
// Search index entries for given searchword
procedure SearchIndex( HelpFile: THelpFile; SearchWord: string; Results: UInt32ArrayPointer );
var
IndexIndex: longint;
IndexEntry: string;
IndexEntryWord: string;
tmpTopic: TTopic;
IndexEntryWordIndex: longint;
WordRelevance: longint;
IndexEntryWordRelevance: longint;
tmpIndexWords : TStrings;
i : integer;
begin
tmpIndexWords := TStringList.Create;
for IndexIndex := 0 to HelpFile.Index.Count - 1 do
begin
IndexEntry := HelpFile.Index.GetLabels[IndexIndex];
IndexEntryWordIndex := 0;
tmpIndexWords.Clear;
StrExtractStringsQuoted(tmpIndexWords, IndexEntry);
for i := 0 to tmpIndexWords.count-1 do
begin
IndexEntryWord := tmpIndexWords[i];
WordRelevance := CompareWord( SearchWord, IndexEntryWord );
if WordRelevance > 0 then
begin
if IndexEntryWordIndex = 0 then
begin
// matching the first word is best
if i = tmpIndexWords.count-1 then
begin
// in fact it's the only word
IndexEntryWordRelevance := mwOnlyIndexWord * WordRelevance
end
else
IndexEntryWordRelevance := mwFirstIndexWord * WordRelevance
end
else
begin
IndexEntryWordRelevance := mwIndexWord * WordRelevance;
end;
tmpTopic := HelpFile.Index.getTopic(IndexIndex);
inc( Results^[ tmpTopic.Index ], IndexEntryWordRelevance );
end;
inc( IndexEntryWordIndex );
end;
end;
tmpIndexWords.Free;
end;
// ------------------------------------------------------
// Master search function. Given a search query,
// searches topic text, titles, index entries.
// Matching topics are added to TList, with their
// SearchRelevance set appropriately.
procedure SearchHelpFile( HelpFile: THelpFile;
Query: TTextSearchQuery;
Results: TList;
WordSequences: TList );
var
TopicCount: longint;
Topic: TTopic;
TopicIndex: longint;
TermIndex: longint;
Term: TSearchTerm;
DictionaryRelevances: UInt32ArrayPointer;
TopicsMatchingDictWord: UInt32ArrayPointer; // flags
TopicsMatchingTermPart: UInt32ArrayPointer; // flags
TopicsMatchingTerm: UInt32ArrayPointer; // flag then relevances
TopicRelevances: UInt32ArrayPointer;
TopicsExcluded: UInt32ArrayPointer;
TopicRelevanceForTerm: longint;
WordRelevance: longint;
DictIndex: longint;
TermPartIndex: longint;
TermPart: string;
s: string;
TermWordSequence: TList;
begin
if HelpFile.SearchTable = nil then
begin
exit;
end;
// Reset flags per topic
TopicCount := HelpFile.TopicCount;
// Get memory for topic relevance arrays
AllocUInt32Array( TopicsMatchingDictWord,
TopicCount );
AllocUInt32Array( TopicsMatchingTermPart,
TopicCount );
AllocUInt32Array( TopicsMatchingTerm,
TopicCount );
AllocUInt32Array( TopicRelevances, // functions as a flag and a cumulative relevance
TopicCount );
AllocUInt32Array( TopicsExcluded, // Exclusions are treated as boolean only
TopicCount );
ClearUInt32Array( TopicRelevances, TopicCount );
ClearUInt32Array( TopicsExcluded, TopicCount );
for TermIndex := 0 to Query.TermCount - 1 do
begin
Term := Query.Term[ TermIndex ];
LogEvent(LogSearch, 'Searching for term "'
+ Term.Text
+ '", '
+ IntToStr( Term.Parts.Count )
+ ' parts' );
// look thru all parts of the term. eg. CAKE_SAUSAGE
TermWordSequence := TList.Create;
if WordSequences <> nil then
if Term.CombineMethod <> cmExcluded then
// this term is an inclusive one, so we want to remember the matches
WordSequences.Add( TermWordSequence );
for TermPartIndex := 0 to Term.Parts.Count - 1 do
begin
TermPart := Term.Parts[ TermPartIndex ];
LogEvent(LogSearch, ' Searching for [' + TermPart + ']' );
AllocUInt32Array( DictionaryRelevances,
HelpFile.DictionaryCount );
TermWordSequence.Add( DictionaryRelevances );
// Search the dictionary for matches.
// alpha numeric match
if Term.Parts.Count = 1 then
// general match allowing all kinds of partial matches
SearchDictionary( HelpFile,
TermPart,
DictionaryRelevances )
else if TermPartIndex = 0 then
// first term part: word must match end of a topic word e.g. must end in "cake"
SearchDictionaryEnds( HelpFile,
TermPart,
DictionaryRelevances )
else if TermPartIndex = Term.Parts.Count - 1 then
// last term part: word must match start of a topic word e.g. must start with "sausage"
SearchDictionaryStarts( HelpFile,
TermPart,
DictionaryRelevances )
else
// intermediate term part: word must match exactly e.g. must be "_"
SearchDictionaryExact( HelpFile,
TermPart,
DictionaryRelevances );
// For each word in the dictionary that matches
// this search term part, search topic texts
LogEvent(LogSearch, ' Dictionary search done' );
ClearUInt32Array( TopicsMatchingTermPart, TopicCount );
for DictIndex := 0 to HelpFile.DictionaryCount - 1 do
begin
WordRelevance := DictionaryRelevances^[ DictIndex ];
if WordRelevance > 0 then
begin
// Search for occurrences of this word
// within the text of topics
HelpFile.SearchTable.Search(DictIndex, TopicsMatchingDictWord);
// debug
s := HelpFile.DictionaryWords[ DictIndex ];
// TopicRelevancesForDictWord now contains 1
// for topics that contain this word.
OrUInt32Array( TopicsMatchingDictWord,
TopicsMatchingTermPart,
TopicCount );
end
end;
LogEvent(LogSearch, 'Topic searches done' );
if TermPartIndex = 0 then
// first part, just copy
CopyUInt32Array( TopicsMatchingTermPart,
TopicsMatchingTerm,
TopicCount )
else
// and with previous term part results
AndUInt32Array( TopicsMatchingTermPart,
TopicsMatchingTerm,
TopicCount );
// loop for next term part (IPF word)
end;
// Now we have searched the dictionary and worked out matching topics
// for all parts of the term. Now combine all together
LogEvent(LogSearch, 'Checking for sequences' );
for TopicIndex := 0 to TopicCount - 1 do
begin
if TopicsMatchingTerm^[ TopicIndex ] > 0 then
begin
Topic := HelpFile.Topics[ TopicIndex ];
// Topic text contained a match for the all the parts
// of the term.
// Now we need to:
// - verify that they actually occur all in a sequence (if it's a multi-part term)
// - count occurrences for relevance.
TopicRelevanceForTerm :=
Topic.SearchForWordSequences( TermWordSequence,
false ); // don't stop at first match
TopicRelevanceForTerm :=
TopicRelevanceForTerm div Term.Parts.Count; // divide to bring back into scale
TopicsMatchingTerm^[ TopicIndex ] := TopicRelevanceForTerm;
end;
end;
if WordSequences = nil then
begin
// we don't need to keep the sequence
ClearWordSequence( TermWordSequence, HelpFile.DictionaryCount );
TermWordSequence.Free;
end;
// Search titles and index
LogEvent(LogSearch, ' Searching titles' );
SearchTopicTitles( HelpFile, Term.Text, TopicsMatchingTerm );
LogEvent(LogSearch, ' Searching index' );
SearchIndex( HelpFile, Term.Text, TopicsMatchingTerm );
LogEvent(LogSearch, ' Combining' );
case Term.CombineMethod of
cmOptional:
AddUInt32Array( TopicsMatchingTerm,
TopicRelevances,
TopicCount );
cmRequired:
begin
// if zero then add to exclusions
NotOrUInt32Array( TopicsMatchingTerm,
TopicsExcluded,
TopicCount );
AddUInt32Array( TopicsMatchingTerm,
TopicRelevances,
TopicCount );
end;
cmExcluded:
OrUInt32Array( TopicsMatchingTerm,
TopicsExcluded,
TopicCount );
end;
// Term.ClearMatches;
// loop for next term...
end;
LogEvent(LogSearch, 'Search completed, converting to list' );
// Now convert to list form.
for TopicIndex := 0 to TopicCount - 1 do
begin
if TopicsExcluded^[ TopicIndex ] = 0 then
begin
Topic := HelpFile.Topics[ TopicIndex ];
Topic.SearchRelevance := TopicRelevances^[ TopicIndex ];
if Topic.SearchRelevance > 0 then
begin
Results.Add( Topic );
end;
end;
end;
LogEvent(LogSearch, 'Freeing arrays' );
FreeUInt32Array( TopicRelevances, TopicCount );
FreeUInt32Array( TopicsExcluded, TopicCount );
FreeUInt32Array( TopicsMatchingTerm, TopicCount );
FreeUInt32Array( TopicsMatchingTermPart, TopicCount );
FreeUInt32Array( TopicsMatchingDictWord, TopicCount );
LogEvent(LogSearch, 'Done' );
end;
End.
|