Fabio Lima

Results 72 comments of Fabio Lima

This comment contains commands to reproduce the bug. ### Precomposed Characters Test a sequence of [precomposed characters](https://en.wikipedia.org/wiki/Precomposed_character). ```bash printf "\u00C4\u00D6\u00DC\u00E4\u00F6\u00FC\n" | xxd 00000000: c384 c396 c39c c3a4 c3b6 c3bc 0a...

> i guess a simple replacement of that two-characters with there more common single character-encoding would fix that. That's correct. It worked for me using the `.replace` keyword in `de_rules`....

You all probably already know, but just in case, RFC 9562 was published a few days ago (May 7, 2024). RFC 4122 is obsolete and UUIDv7 is now official. https://www.rfc-editor.org/rfc/rfc9562...

Writing phonemes mnemonics and translation trace to standard output, using `-X` option: ``` espeak-ng "alpharetrovirus" -X ``` ``` Translate 'alpharetrovirus' 61 _) al (p [al] 99 alpha [alf@] 59 _)...

This issue is related to https://github.com/espeak-ng/espeak-ng/issues/1933. A workaround is possible by using the `.replace` keyword in `de_rules`. This problem is not limited to umlaut. It affects any Unicode character followed...

Hi! ULID uses [MOD](https://en.wikipedia.org/wiki/Modulo) operation to encode to Crockford's base-32, which produces a different result than RFC-4648. See this comment: https://github.com/ulid/spec/issues/73#issuecomment-1247445322 Best regards!

That's right. It's fixed in 1.52-dev. In 1.51: ```bash espeak-ng -v de "wurde" --ipa vˈ??də ``` In 1.52-dev: ```bash espeak-ng -v de "wurde" --ipa vˌʊɐdə ``` The "ʊɐ" IPA was...

Thank you for the suggestion! The scenario you described is indeed valid, and I understand the need for certain IDs to be reserved. However, implementing built-in support for "avoid-these-values" in...

Very good example! I also came up with a solution using a factory builder, but it's very limited to timestamp. ```java TsidFactory factory = TsidFactory.builder().withTimeFunction(() -> { final long startTime...

If checksum is really needed by an application, one could use the [Luhn Mod N Algorithm](https://en.wikipedia.org/wiki/Luhn_mod_N_algorithm), which is an extension to the [Luhn algorithm](https://en.wikipedia.org/wiki/Luhn_algorithm), which in turn "is used to...