Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 2 years ago.
Improve this question
TL;DR - Silly OCD question looking for better words.
I have a list of callback labels similar to:
ingest_before
ingest_after
pre_parse
post_parse
before_notify
after_notify
This is all well and good...those names convey the context succinctly and accurately.
BUT! It bugs me that "pre" sorts after "post" alphabetically, and that "before" comes after "after" when sorted.
Note - I'm not looking to control the order my callbacks are called in this way. Their callback points are hard-coded and never sorted. I would just feel better if they sorted better when I report events or write documentation if they sorted better. I'm not interested in all the reasons why depending on this ordering is a bad idea. This is not to satisfy any sort of system requirements...just my own hangups.
So the real question is:
What is a pair of words that indicates a relative sequence between two things, that just happens to alphabetically sort in the same order?
What about First/Last, First/Then, Begin/End, Start/Stop? Are initial numbers allowed, then 1st/2nd/3rd/last. You can also make any of your pairs sort the way you want if you allow case to differ, e.g. in ASCII and Unicode, Before < after, Pre < post.
Related
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 1 year ago.
Improve this question
I have different strings for searching the related data but due to unnecessary words, retrieved results are not good. For example, "Working of genetic algorithm", so the words "working of" are not important in here. I can remove "of" by considering it as a stop word. But how about "working"? I can do stemming but it will just remove "ing", which doesn't solve the problem. Similarly another string "Determination of.....", I consider that other words in the string are important and "Determination of" are not important, so I want to remove them before proceeding further. Any ideas or hints how I can remove these words, since there are a lot of these types of words and I cannot hardcode them.
Well, instead of removing such terms, I would suggest to focus on ngrams. Using the ngrams you can make different combination of search strings, and it could help you find the related information efficiently. Now it depends upon you to what number of combinations you want to make i.e. bigrams or trigrams. To do this, you can use python nltk library.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 4 years ago.
Improve this question
I have some code in Haskell that is using pattern matching. However, I think that I can use folds and filters. For me this would be more readable, but I want to know it there is any advantage in terms of complexity.
The main reason to use higher-order functions instead of pattern matching and manual recursion is that it makes your code more concise and way easier to read.
Once you get the hang of them, you'll find that reading source code suddenly became way easier as those functions are amongst the most popular in all of Haskell.
It's also considered a good practice, and many people appreciate that you abstract your code.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 5 years ago.
Improve this question
I would like to know about simple problems that can be naturally solved using stacks with the usual interface (emptyS, isEmptyS, push, pop, top).
The complexity asociated to the context of the problem should be null. I can't touch topics like parsing, compiling or search algorithms at this moment. This discards many classical examples.
The most beautiful example I found so far is checking for balanced parenthesis in strings. In very few lines, without any other background, the exercise shows the utility of the data structure:
Another good example is procesing a string where the asterisk means to pop an item from the stack and a letter means to push it into the stack. The function must return the stack after the operations described in the string are applied to an empty stack.
If you can share some others problems, I will apreciate it very much.
Thank you in advance.
Though this question is too broad, I am going to give some other applications. Some of other common applications are -
Parsing
Recursive Function
Calling Function
Expression Evaluation
Expression Conversion
Infix to Postfix
Infix to Prefix
Postfix to Infix
Prefix to Infix
Towers of Hanoi
Some details can be found here.
Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 6 years ago.
Improve this question
which one is best for parsing between Left corner Parsing algorithm and CYK parsing algorithm ? and Why ?
Generally speaking, CYK is a maximum-likelihood parse tree. It never gives you the best performance because of this reason and the fact that it ignores contextual information when assigns the probabilities. You need to modify it to consider more contexts, or integrate it into something else. For example, Left-Corner parser can use a CYK procedure, inside. So the answer to your question is, LC is more powerful than CYK, though it's computationally more expensive. Have a look at Mark Johnson's paper.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 4 years ago.
Improve this question
What are the effects of multiplication of two different sound? An neither of them are constant, like two different songs, or one track of instrumental and one of vocals.
A simple Google search came up with this:
http://crca.ucsd.edu/~msp/techniques/v0.11/book-html/node77.html
Did you search for it at all?
But basically what happens is you end up creating an envelope where the second acts as a "coefficient" of sorts.
You also end up with a reduction of sound levels (since a decimal times a decimal is less both of them), so you'll need to amplify the signal a bit to retain volume.
The page I linked gives a lot more explanation and has a lot of the algebra needed to write up a code to implement it. Look there if you have any more questions.