Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I want to match regular expressions very fast, low overhead. And I want to be able to choose between multiple expressions.
E.g.
AB* -> case A
XXX -> case B
etc
So I want to name all of which cases matched.
The problem is very similar to a lexical analyzer but the patterns are dynamic. That is, a user could change them at any time. So I don't have the luxuary of re-running Lex. Plus, I could have any number of different matchers.
I don't need any of the subpattern identification/capture stuff in Java or the overhead.
Just need to know which cases matched.
I could write software to do this efficiently...but it would almost be like re-writing lex.
Are there any tools that can do this?
Are there any more efficient regular expression libraries than the built in ones in java? Thread safe, etc.
thanks.
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 3 years ago.
Improve this question
I was reading about Garbage Collector performance and found the term max-jOPS and critical jOPS.
Link: http://openjdk.java.net/jeps/333
Can someone tell the full form and explain what is it?
These (jOPS, max-jOPS and critical-jOPS) are not GC terms.
I believe that you are referring to the terminology used in the SPECjbb2015 Benchmark; e.g. https://www.spec.org/jbb2015/docs/userguide.pdf. (This is confirmed by your update.)
The documents about the benchmark that I read don't specifically say what jOPS stands for. However the Glossary says that OPS stands for Operations Per Second, and I infer from the context that the j refers to jbb2015.
In other words, jOPS represents the rate at which a "unit of work" is performed by the jbb2015 benchmark. The unit is artificial, and is not designed to directly map to any real world measures ... though there will often be a correlation.
And the max-jOPS and critical-jOPS are specific points in the RT (Response-Throughput) curve that the benchmark captures.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 5 years ago.
Improve this question
I am trying to implement a application to recognized human facial expressions(happiness,sadness,boring, etc,) then after automatically selecting a song which suitable for current emotion of the person, if he is sad system playing enjoyable song, how can i do this thing, if any API's already have? any examples for me?
According to my understanding，your core need is facial expression recognition.there is an API ready for you ,emotion API by Microsoft https://azure.microsoft.com/zh-cn/services/cognitive-services/emotion/.Which Can detect emotions including anger, contempt, disgust, fear, happiness, neutral, sadness and surprise. You can think of these emotions across cultural boundaries, usually by certain facial expressions.
example:you can refer to How-old, a popular APP which Can measure the characters of age and Gender through photos.the different is:it's a light application Supported by another Microsoft API(Project Oxford),But I think you can get some inspiration from it.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
Say I have the following bits of XML:
<string>&</string>
<string>&</string>
Is there a Java XML parsing API that will preserve them as is when reading them?
I've explored SAX, DOM, and am currently on StAX. They all convert the references before they feed me the character data.
Thanks!
To the best of my knowledge the answer is no (though proving the non-existence of a piece of software is difficult).
If this is really a requirement (and I'm sceptical), then I would suggest preprocessing the input to replace &# by, say, §#, perhaps choosing § from the Unicode private use area if you want to be ultra-cautious.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I'm trying to solve the following problem:
I have some expensive work to do which I then cache the result of
The work is keyed by a string
Many requests may arrive simultaneously for the same key
I'd like to avoid doing the work more than once per key
I'd like to add callbacks against the key which will be invoked when the work is completed; not all of these are known when the work is first submitted.
This feels like a problem which ought to have been solved already; does anybody know of a Java framework or library which covers it?
I can imagine a wrapper around guava's LoadingCache but I'm not aware of a library which does everything out of the box.
While LoadingCache#get is synchronous, it does get you 1-4 and there may be some mileage in using refresh which can return a ListenableFuture (although to get all the features you list it might become a fairly chunky wrapper?)
For Reference:
http://docs.guava-libraries.googlecode.com/git/javadoc/com/google/common/cache/LoadingCache.html#refresh(K)
http://www.theotherian.com/2013/11/non-blocking-cache-with-guava-and-listenable-futures.html
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 2 years ago.
Improve this question
I have a list of words in a text file. What I want is for an input word a list of words that are similar to the input word. So the program should work similar to a spell checker API with only thing that the dictionary is limited to my list of words.
I can write my own code if I get some pointers to Spell Checker algorithm or regular expressions.
Take a look at Apache Commons Lang StringUtils.getLevenshteinDistance. The Levenshtein algorithm gives the "edit distance" between two words, that is, how similar they are. Their implementation is quite fast - I tested it against another implementation I found online and it was about 1/3 faster if I remember correctly.
I highly recommend taking a look at Peter Norvig's article on How to Write a Spelling Corrector. It's worth reading. And it doesn't involve too much of a complexity. If you scroll down the page, you can see links to Java implementations. Then, you can customize it to your own needs.
http://en.wikipedia.org/wiki/Levenshtein_distance