Spaces:
Running
Running
File size: 8,157 Bytes
125276b | 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 | /**
* Absolute anchors for the relative time words a search query can carry.
*
* "明年的wrestlemania在哪里举办" reaches the retrieval layer with no year in it,
* so it matches undated pages and the answer flips between guesses. Appending
* the resolved year is enough to bring the official announcement into reach.
*
* The clock is a parameter and never `Date.now()`, so a caller can anchor a
* whole batch of queries to one instant and the tests stay deterministic.
*
* Only month and year words get an anchor. A day word would need an ISO date
* ("2026-11-04"), which is not how pages write dates, and many queries use
* those words as names ("usa today", "the day after tomorrow").
*/
export type RelativeDateReplacement = { phrase: string; anchor: string };
/** Past two anchors a query gains digits without gaining meaning. */
const MAX_REPLACEMENTS = 2;
const MONTH_NAMES = [
"January",
"February",
"March",
"April",
"May",
"June",
"July",
"August",
"September",
"October",
"November",
"December",
] as const;
interface Rule {
/** Matched case-insensitively, which is a no-op for the Chinese phrases. */
phrase: string;
/**
* English triggers only match on word boundaries: "this yearly" and
* "next monthly" are not time references.
*/
wordBounded: boolean;
anchor: (asOf: Date) => string;
}
interface Occurrence {
start: number;
end: number;
}
interface Hit extends Occurrence {
/** The matched text spelled as the query spells it, kept for the caller. */
phrase: string;
anchor: string;
}
/**
* Month arithmetic in local calendar terms: December plus one month is January
* of the next year, not a wrapped month inside the same one.
*/
function shiftMonths(
asOf: Date,
months: number,
): { year: number; monthIndex: number } {
const absoluteMonth = asOf.getMonth() + months;
const year = asOf.getFullYear() + Math.floor(absoluteMonth / 12);
// `%` keeps the sign of its left operand, so a December-bound negative
// offset needs the extra lap before it becomes a month index.
const monthIndex = ((absoluteMonth % 12) + 12) % 12;
return { year, monthIndex };
}
function chineseMonthAnchor(asOf: Date, months: number): string {
const { year, monthIndex } = shiftMonths(asOf, months);
return `${year}年${monthIndex + 1}月`;
}
function englishMonthAnchor(asOf: Date, months: number): string {
const { year, monthIndex } = shiftMonths(asOf, months);
return `${MONTH_NAMES[monthIndex]} ${year}`;
}
const RULES: readonly Rule[] = [
{
phrase: "明年",
wordBounded: false,
anchor: (asOf) => `${asOf.getFullYear() + 1}年`,
},
{
phrase: "今年",
wordBounded: false,
anchor: (asOf) => `${asOf.getFullYear()}年`,
},
{
phrase: "去年",
wordBounded: false,
anchor: (asOf) => `${asOf.getFullYear() - 1}年`,
},
{
phrase: "下个月",
wordBounded: false,
anchor: (asOf) => chineseMonthAnchor(asOf, 1),
},
{
phrase: "下月",
wordBounded: false,
anchor: (asOf) => chineseMonthAnchor(asOf, 1),
},
{
phrase: "上个月",
wordBounded: false,
anchor: (asOf) => chineseMonthAnchor(asOf, -1),
},
{
phrase: "上月",
wordBounded: false,
anchor: (asOf) => chineseMonthAnchor(asOf, -1),
},
{
phrase: "这个月",
wordBounded: false,
anchor: (asOf) => chineseMonthAnchor(asOf, 0),
},
{
phrase: "本月",
wordBounded: false,
anchor: (asOf) => chineseMonthAnchor(asOf, 0),
},
{
phrase: "next year",
wordBounded: true,
anchor: (asOf) => `${asOf.getFullYear() + 1}`,
},
{
phrase: "this year",
wordBounded: true,
anchor: (asOf) => `${asOf.getFullYear()}`,
},
{
phrase: "last year",
wordBounded: true,
anchor: (asOf) => `${asOf.getFullYear() - 1}`,
},
{
phrase: "next month",
wordBounded: true,
anchor: (asOf) => englishMonthAnchor(asOf, 1),
},
{
phrase: "last month",
wordBounded: true,
anchor: (asOf) => englishMonthAnchor(asOf, -1),
},
{
phrase: "this month",
wordBounded: true,
anchor: (asOf) => englishMonthAnchor(asOf, 0),
},
];
/**
* Titles and longer words that contain a trigger but are not time references.
* "登上月球" (landing on the Moon) holds 上月, "next year's" is the possessive
* of titles and headlines, and "the last year of college" is the final year,
* not 2025.
*/
const BLACKLIST_PHRASES: readonly string[] = [
"明年今日",
"去年冬天",
"去年夏天",
"上月球",
"next year's",
"last month of",
"last year of",
];
function isAsciiLetter(char: string): boolean {
return (char >= "A" && char <= "Z") || (char >= "a" && char <= "z");
}
function findOccurrences(
text: string,
phrase: string,
wordBounded: boolean,
): Occurrence[] {
const haystack = text.toLowerCase();
const needle = phrase.toLowerCase();
const occurrences: Occurrence[] = [];
let from = 0;
while (from + needle.length <= haystack.length) {
const start = haystack.indexOf(needle, from);
if (start === -1) break;
const end = start + needle.length;
const touchesWord =
wordBounded &&
(isAsciiLetter(haystack.charAt(start - 1)) ||
isAsciiLetter(haystack.charAt(end)));
if (touchesWord) {
from = start + 1;
continue;
}
occurrences.push({ start, end });
from = end;
}
return occurrences;
}
function overlaps(occurrence: Occurrence, ranges: readonly Occurrence[]) {
return ranges.some(
(range) => occurrence.start < range.end && range.start < occurrence.end,
);
}
export function normalizeRelativeDates(
query: string,
asOfDate: Date,
options?: { maxLength?: number },
): { searchQuery: string; replacements: RelativeDateReplacement[] } {
const unchanged = {
searchQuery: query,
replacements: [] as RelativeDateReplacement[],
};
if (query.trim() === "") return unchanged;
const blacklistRanges = BLACKLIST_PHRASES.flatMap((phrase) =>
findOccurrences(query, phrase, false),
);
const hits: Hit[] = [];
for (const rule of RULES) {
for (const occurrence of findOccurrences(
query,
rule.phrase,
rule.wordBounded,
)) {
// A trigger inside a title or a longer word is a false positive; the
// blacklist owns that run of text.
if (overlaps(occurrence, blacklistRanges)) continue;
hits.push({
...occurrence,
phrase: query.slice(occurrence.start, occurrence.end),
anchor: rule.anchor(asOfDate),
});
}
}
if (hits.length === 0) return unchanged;
hits.sort(
(left, right) =>
left.start - right.start ||
right.end - right.start - (left.end - left.start),
);
const selected: Hit[] = [];
const usedAnchors = new Set<string>();
for (const hit of hits) {
if (selected.length === MAX_REPLACEMENTS) break;
if (usedAnchors.has(hit.anchor)) continue;
if (selected.some((chosen) => overlaps(hit, [chosen]))) continue;
// An anchor the query already spells out is not worth repeating: the
// search engine has that year already, and a doubled anchor only dilutes
// the query.
if (query.toLowerCase().includes(hit.anchor.toLowerCase())) continue;
usedAnchors.add(hit.anchor);
selected.push(hit);
}
if (selected.length === 0) return unchanged;
const replacements = selected.map(({ phrase, anchor }) => ({
phrase,
anchor,
}));
// The search endpoint rejects an over-long query, so an anchor that would
// push it past the limit is dropped rather than turning a search into a
// failed request. No anchor left over means the query goes out untouched.
const limit = options?.maxLength ?? Number.POSITIVE_INFINITY;
const appended: RelativeDateReplacement[] = [];
let searchQuery = query.trimEnd();
for (const replacement of replacements) {
const candidate = `${searchQuery} ${replacement.anchor}`;
if (candidate.length > limit) break;
searchQuery = candidate;
appended.push(replacement);
}
if (appended.length === 0) return unchanged;
return { searchQuery, replacements: appended };
}
|