On 12 Jul 2011, at 15:38, BPJ wrote:
>
> Does \XeTeXinputnormalization=1 normalize to NFC or NFD?
http://lmgtfy.com/?q=XeTeXinputnormalization
(e.g. see the XeTeX Reference Guide)
JK
--
Subscriptions, Archive, and List information, etc.:
http
2011-07-08 23:13, Dominik Wujastyk skrev:
Unicode normalization was discussed on this list a couple of
months ago. Phil Taylor provided a small program to do the job,
and other utilities were referred to. There's also a command
within XeTeX that normalizes unicode before passing it to TeX's
di
Many, thanks, all, and sorry for missing the earlier discussion.
But back to my original question, is there a way to get \hyphenation to
require only one form and the rest come for free?
On Fri, Jul 8, 2011 at 5:37 PM, Jonathan Kew wrote:
> On 8 Jul 2011, at 23:24, maxwell wrote:
>
> > I found \
On 8 Jul 2011, at 23:24, maxwell wrote:
> I found \XeTeXinputnormalization in XeTeX documentation, but I'm not
> familiar with the other two commands. I guess \tracingonline=1 means to
> output errors to stdout (or stderr?), but where is the effect of
> \tracinglostchars described?
See The TeXbo
This is a better answer than mine, so disregard my noise. But I do have a
question below:
On Fri, 8 Jul 2011 23:13:41 +0200, Dominik Wujastyk
wrote:
> ...
> There's also a command within XeTeX that normalizes unicode
> before passing it to TeX's digestion. Try this in your header:
>
> % Norma
On Fri, 8 Jul 2011 15:50:07 -0500, Joshua and Amy
wrote:
> So, I guess I was foolish to hope that Google has figured out how to
return
> results that have non-identical but equivalent strings?
I'm sure google has figured this out, and some programs to an automatic
conversion to composed or decomp
Unicode normalization was discussed on this list a couple of months ago.
Phil Taylor provided a small program to do the job, and other utilities were
referred to. There's also a command within XeTeX that normalizes unicode
before passing it to TeX's digestion. Try this in your header:
% Normali
So, I guess I was foolish to hope that Google has figured out how to return
results that have non-identical but equivalent strings?
I hope it's not too off-topic for this list, but can you point me to any
good resources on normalization (is there a straightforward automation for
someone who doesn'
On Fri, 8 Jul 2011 15:00:42 -0500, Joshua and Amy
wrote:
> I'm creating some hyphenation rules for Jarai texts that I'm
> interlinearizing. Here's the problem: In various texts, a complex
character
> such as LATIN SMALL LETTER A WITH BREVE might be encoded as a single
code
> point (U+0103) or as a
I'm creating some hyphenation rules for Jarai texts that I'm
interlinearizing. Here's the problem: In various texts, a complex character
such as LATIN SMALL LETTER A WITH BREVE might be encoded as a single code
point (U+0103) or as a combination of code points (LATIN SMALL LETTER A:
U+0061 plus COM
10 matches
Mail list logo
