![使用 pdfmanagement 和 lualatex 读取反斜杠](https://linux22.com/image/469521/%E4%BD%BF%E7%94%A8%20pdfmanagement%20%E5%92%8C%20lualatex%20%E8%AF%BB%E5%8F%96%E5%8F%8D%E6%96%9C%E6%9D%A0.png)
我已经使用TeXLive 2023
。LuaLaTeX Version 1.17.0
成功创建了 PDF 文件,但通过Acrobat Reader
PDF 文件打开 PDF 文件时正在读取backslash
。如何停用此功能?
我的 MWE 是:
\DocumentMetadata{testphase={phase-III,math},pdfstandard=UA-1,pdfversion=2.0,debug=pdfmanagement,debug={xmp-export=test}}
\documentclass{article}
\usepackage{fontspec}
\usepackage{unicode-math}
\setmainfont{STIX Two Text}
\setmathfont{STIX Two Math}
\begin{document}
In order to learn a bilingual mapping that connects two embeddings into one space, the mapping matrix $W_{X}$ makes $Y_{t} = W_{X} X_{s}$, we employ an adversarial training to learn the mapping. In particular, the generator $G$ tries to make a mapping matrix to confuse the discriminator. In order to get orthogonal parameterization, we note that transforming the source word embedding into the target, its transpose should also transform the target to the source. The $G$ tries to learn a mapping $W_{X}$ to maximize a source representation $W_{X} X_{s}$ to mapping into a target embedding $Y_{t}$. The discriminator D is a binary classifier which aims to enhance its ability to distinguish $Y_{t}$ and $W_{X} X_{s}$. To achieve this goal, we maximize the ability of the discriminator and minimize the probability of generator.\vspace*{-3pt}
\begin{equation}
score_{L_{s},L_{t}} = ∑_{i=1}^{max length(L_{s},L_{t})} ± CSCL(x_{s}^{i},y_{t}^{j})
\end{equation}
\end{document}
或者需要更改上述 LaTeX 命令?请提供意见。
在终端中我使用了以下命令:
lualatex-dev test1.tex
日志报告截图:
答案1
这有点脆弱,但是
\DocumentMetadata{testphase={phase-III,math},pdfstandard=UA-1,pdfversion=2.0,debug=pdfmanagement,debug={xmp-export=test},uncompress}
\documentclass{article}
\usepackage{fontspec}
\usepackage{unicode-math}
\setmainfont{STIX Two Text}
\setmathfont{STIX Two Math}
\begin{document}
\ExplSyntaxOn
\makeatletter
\def\@kernel@math@begin {
% space after every token so $abc$" voiced as "a b c" not "ab-ca"
% \mathrm{thing} voiced as thing
\regex_replace_all:nnN{((\c{mathrm}|\c{mathit}|\c{text})\{(.*?)\}|(.))\ *}{\3\4\ }\g__math_grabbed_math_tl
% detokenize so \alpha is 6 characters not one cs token
\tl_gset:Nx\g__math_grabbed_math_tl{\tl_to_str:V\g__math_grabbed_math_tl}
% voice _ as sub (space already addded above)
\regex_replace_all:nnN{\_}{sub}\g__math_grabbed_math_tl
% voice ^ as sup (space already addded above)
\regex_replace_all:nnN{\^}{sup}\g__math_grabbed_math_tl
% lose & (you might want to voice this alignment cell separator but...)
\regex_replace_all:nnN{\&}{\ }\g__math_grabbed_math_tl
% voice \cr (which should not have been there) or \\ as newline
\regex_replace_all:nnN{\x{5c}cr|\x{5c}\x{5c}}{\ newline\ }\g__math_grabbed_math_tl
% lose \
\regex_replace_all:nnN{\x{5c}}{\ }\g__math_grabbed_math_tl
% debug
\typeout{\meaning\g__math_grabbed_math_tl}
\tl_gset:Nx\tmpmathcontent
{
\exp_not:V\g__math_grabbed_math_tl
\space
}
\tagstructbegin{tag=Formula,
AFinline-o=\tmpmathcontent,
title-o=\g__math_grabbed_env_tl,
actualtext=\tmpmathcontent
}
\grabaformulapartandstart
}
\makeatother
\ExplSyntaxOff
$\mathrm{thing}+thing + \mathit{thing} + \text{otherthing}$ % voiced as: thing plus t h i n g plus plus thing plus other thing
In order to learn a bilingual mapping that connects two embeddings
into one space, the mapping matrix $W_{X}$ makes $Y_{t} = W_{X}
X_{s}$, we employ an adversarial training to learn the mapping. In
particular, the generator $G$ tries to make a mapping matrix to
confuse the discriminator. In order to get orthogonal
parameterization, we note that transforming the source word embedding
into the target, its transpose should also transform the target to the
source. The $G$ tries to learn a mapping $W_{X}$ to maximize a source
representation $W_{X} X_{s}$ to mapping into a target embedding
$Y_{t}$. The discriminator D is a binary classifier which aims to
enhance its ability to distinguish $Y_{t}$ and $W_{X} X_{s}$. To
achieve this goal, we maximize the ability of the discriminator and
minimize the probability of generator.\vspace*{-3pt}
\begin{equation}
\mathrm{score}_{L_{s},L_{t}} = ∑_{i=1}^{\mathrm{max\ length}(L_{s},L_{t})} ± CSCL(x_{s}^{i},y_{t}^{j})
\end{equation}
align
\begin{align*}
\alpha + \beta &= \gamma\\
2. α + β &1= γ\\
& {κ}_{j=1}\\
& K^{a+1}
\end{align*}
\end{document}
这根本没有添加\begin{equation}...\end{equation}
,它会删除任何其他内容\
并_
在由 Acrobat 读取的 AltText 中逐步sub
替换。^
sup
它读取初始
\mathrm{thing}+thing
作为
“事物加事物”