-
Tracking issue for:
- [x] https://github.com/ubiquity/ubiquity-dollar/security/code-scanning/11
-
微博内容精选
-
We have a `maxDeterminizedStates = 10000` limit designed to keep regexp-type queries from blowing up.
But we have an adversary that will run for 268s on my laptop before hitting exception, first rep…
-
Hello!
I'm working on a project and use Pynini/OpenFST to build (in general, non-deterministic) WFSTs. Then I apply input strings to them by using composition operation and then get top-n matches.
…
-
This module adds a class for
- finite state machine,
- finite automaton,
- finite transducer.
Apply only [attachment: trac_15078_fsm_automata_transducers.8.patch](https://github.com/sagemath/sage-…
-
Heya,
Looking though the code today I noticed that the calls to `regexp.MustCompile()` are inline.
Compiling the regular expressions represents a significant cost of a match, this is why the `co…
-
Prior to #16539, a (more or less) random path was chosen in case of ambiguity
in `FiniteStateMachine.process`. In #16539, this undesired behaviour is replaced by a `NonImplementedError`.
However, i…
-
Since we added shortest-path wFSA search in #4788, and generified the comparator in #4874,
I think we should look at implementing suggesters that have more capabilities than just basic prefix matching…
-
Attached is a patch for an AutomatonQuery/Filter (name can change if its not suitable).
Whereas the out-of-box contrib RegexQuery is nice, I have some very large indexes (100M+ unique tokens) where q…
-
we can optimize fuzzyquery by using AutomatonTermsEnum. The idea is to speed up the core FuzzyQuery in similar fashion to Wildcard and Regex speedups, maintaining all backwards compatibility.
The adv…