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
|
#include "search/ranking_utils.hpp"
#include "std/transform_iterator.hpp"
#include <algorithm>
using namespace strings;
namespace search
{
namespace
{
UniString AsciiToUniString(char const * s) { return UniString(s, s + strlen(s)); }
} // namespace
namespace impl
{
bool FullMatch(QueryParams::Token const & token, UniString const & text)
{
if (token.m_original == text)
return true;
auto const & synonyms = token.m_synonyms;
return find(synonyms.begin(), synonyms.end(), text) != synonyms.end();
}
bool PrefixMatch(QueryParams::Token const & token, UniString const & text)
{
if (StartsWith(text, token.m_original))
return true;
for (auto const & synonym : token.m_synonyms)
{
if (StartsWith(text, synonym))
return true;
}
return false;
}
} // namespace impl
bool IsStopWord(UniString const & s)
{
/// @todo Get all common used stop words and factor out this array into
/// search_string_utils.cpp module for example.
static char const * arr[] = {"a", "de", "da", "la"};
static std::set<UniString> const kStopWords(
make_transform_iterator(arr, &AsciiToUniString),
make_transform_iterator(arr + ARRAY_SIZE(arr), &AsciiToUniString));
return kStopWords.count(s) > 0;
}
void PrepareStringForMatching(std::string const & name, std::vector<strings::UniString> & tokens)
{
auto filter = [&tokens](strings::UniString const & token)
{
if (!IsStopWord(token))
tokens.push_back(token);
};
SplitUniString(NormalizeAndSimplifyString(name), filter, Delimiters());
}
string DebugPrint(NameScore score)
{
switch (score)
{
case NAME_SCORE_ZERO: return "Zero";
case NAME_SCORE_SUBSTRING_PREFIX: return "Substring Prefix";
case NAME_SCORE_SUBSTRING: return "Substring";
case NAME_SCORE_FULL_MATCH_PREFIX: return "Full Match Prefix";
case NAME_SCORE_FULL_MATCH: return "Full Match";
case NAME_SCORE_COUNT: return "Count";
}
return "Unknown";
}
} // namespace search
|
