text stringlengths 81 47k | source stringlengths 59 147 |
|---|---|
Question: <p>Which natural language processing problems are NP-Complete or NP-Hard?</p>
<p>I've searched the <a href="/questions/tagged/natural-lang-processing" class="post-tag" title="show questions tagged 'natural-lang-processing'" rel="tag">natural-lang-processing</a> and <a href="/questions/tagged/complexi... | https://cs.stackexchange.com/questions/32276/complexity-of-natural-language-processing-problems |
Question: <p>I wonder about cases in which knowing several languages can lead a researcher to interesting results in natural language processing.</p>
<p>For example, knowledge of foreign languages can without doubt contribute to better machine translation, it's the most obvious example.</p>
<p>In what other fields o... | https://cs.stackexchange.com/questions/13833/advantages-of-knowing-foreign-languages-for-natural-language-processing |
Question: <p>What aspects of linguistics are necessary or good to know for natural language processing? What references do you recommend for studying those aspects? Thanks!</p>
Answer: <p>NLP is a big place, you might want to be more specific.</p>
<p>Within information retrieval, <a href="https://en.wikipedia.org/wik... | https://cs.stackexchange.com/questions/21334/what-aspects-of-linguistics-are-necessary-or-good-for-natural-language-processin |
Question: <p>I am trying to implement a natural language query preprocessing module which would, given a query formulated in natural language, extract the keywords from that query and submit it to an IR (information retrieval system) system.</p>
<p>At first, I thought about using some training set to compute <a href="... | https://cs.stackexchange.com/questions/33430/natural-language-query-processing |
Question: <p>My question is - <strong>is there a semantic natural language processing that tries to understand the meaning of the texts and that tries to derive the consequences of the understood meaning? Is there a universal knowledge base that can be used for the "grounding" of the texts?</strong></p>
<p>I have hear... | https://cs.stackexchange.com/questions/68398/semantic-natural-language-processing-from-texts-to-logical-expressions-univer |
Question: <p>I have just started learning about CSP and NLP, for which I have to write a review paper of some research articles.</p>
<p>The problem is that when a searched for research articles on some trusted digital libraries with the keywords CSP and NLP, there weren't many results that were related to both.</p>
<p>... | https://cs.stackexchange.com/questions/157042/constraint-satisfaction-problems-in-natural-language-processing |
Question: <p>I wonder which one of the two needs a larger input to achieve a decent accuracy:
<br>
programming language detection or natural language detection?</p>
<hr>
<p>More details:</p>
<p>Definition of <a href="http://en.wikipedia.org/wiki/Language_identification" rel="nofollow">Language detection</a>: </p>
<... | https://cs.stackexchange.com/questions/28668/does-programming-language-detection-need-more-input-than-natural-language-detect |
Question: <p>I am reading the following paper: <a href="https://papers.nips.cc/paper/5021-distributed-representations-of-words-and-phrases-and-their-compositionality.pdf" rel="nofollow noreferrer">https://papers.nips.cc/paper/5021-distributed-representations-of-words-and-phrases-and-their-compositionality.pdf</a></p>
... | https://cs.stackexchange.com/questions/94228/question-on-word-probability-for-hierarchical-softmax-used-in-natural-language-p |
Question: <p>I need to know how many different values the frequency of a certain word in a corpus can there be for a natural language processing problem. Is there any study or site that has such estimation?</p>
Answer: <p>What you're asking directly refers to <a href="http://en.wikipedia.org/wiki/Information_retrieval... | https://cs.stackexchange.com/questions/33631/where-can-i-find-a-study-on-the-amount-of-different-word-frequencies-in-a-corpus |
Question: <p>I've been reading the <a href="https://en.wikipedia.org/wiki/Probabilistic_context-free_grammar" rel="nofollow noreferrer">wikipedia article</a> about probabilistic context-free grammars (PCFGs), and they state that</p>
<blockquote>
<p>PCFGs have application in areas as diverse as natural language processi... | https://cs.stackexchange.com/questions/167192/how-are-pcfgs-used-in-programming-language-design |
Question: <p>I was reading about the history of computers where i came by <a href="https://en.wikipedia.org/wiki/Machine_code" rel="nofollow">machine code</a></p>
<blockquote>
<p>A Machine code or machine language is a set of instructions executed directly by a computer's central processing unit (CPU). Each instruct... | https://cs.stackexchange.com/questions/48157/what-is-the-natural-language-of-computers-mathematics-or-logic |
Question: <p>A common Natural Language Processing (NLP) task is to determine semantic similarity between two sentences. Has the question of agreement/disagreement between two sentences been covered in NLP or other literature? I tried searching on Google Scholar but didn't get any relevant results.</p>
Answer: <p>I wou... | https://cs.stackexchange.com/questions/56828/how-to-determine-agreement-between-two-sentences |
Question: <p>It is possible (using formal semantics) to translate natural language sentences into lambda expressions. So, is it possible to translate those lambda expressions into some logic, e.g. into first-order logic or into modal logic?</p>
<p>I am aware of the Curry-Howard correspondence, but I have not found act... | https://cs.stackexchange.com/questions/82878/how-to-translate-lambda-calculus-into-first-order-modal-logic-is-it-possible |
Question: <p>For a while, all classification tasks in natural language processing were based on simple RNN's, which operate in a very word-by-word order. Adding gating mechanisms increased ability to "look back", and the newer addition of context vectors which can train attention to different words during the task hav... | https://cs.stackexchange.com/questions/99987/are-there-any-neural-nlg-systems-which-dont-generate-in-left-to-right-order |
Question: <p>From <a href="http://en.wikipedia.org/wiki/Information_retrieval" rel="noreferrer">Wikipedia</a> </p>
<blockquote>
<p><strong>Information retrieval</strong> is the activity of obtaining information resources relevant to an information need from a collection of information resources. Searches can be base... | https://cs.stackexchange.com/questions/7181/relation-and-difference-between-information-retrieval-and-information-extraction |
Question: <p>I am attempting to write a Finite State Transducer module in OCaml, because I think it's a good exercise, which is because I have been teaching myself Natural Language Processing.</p>
<p>You typically construct finite automata using regular expressions, for example (a | b).</p>
<p>What language does one ... | https://cs.stackexchange.com/questions/28175/language-to-construct-finite-state-transducer |
Question: <p>I'm learning natural language processing and I can't understand the difference between <a href="https://en.wikipedia.org/wiki/Shift-reduce_parser" rel="nofollow noreferrer">Shift-Reduce parser</a> and <a href="https://en.wikipedia.org/wiki/LR_parser" rel="nofollow noreferrer">LR parser</a>. </p>
<p>As I'v... | https://cs.stackexchange.com/questions/68278/difference-between-lr-parsing-and-shift-reduce-parsing |
Question: <p>I have some background in natural language processing and I know that all parsers (top down or bottom up, or mix), at least when I studied just about a few years ago, cannot handle any error. A small error like a grammatical one or a spelling one will result in unexpected parsed tree.</p>
<p>This is unacc... | https://cs.stackexchange.com/questions/33514/natural-language-parser-that-can-handle-syntactic-and-lexical-errors |
Question: <p>I should prepare some paper for a colloquium (kinda student-task) and it should cover the following points:</p>
<p>(1) at least one notable discovery in theoretical informatics (or computer science)</p>
<p>(2) at least one open problems in theoretical informatics</p>
<p>(3) an example of short notable p... | https://cs.stackexchange.com/questions/112399/what-are-open-problems-in-computer-science |
Question: <p>I am an undergraduate student in mathematics. I have a fair bit of experience with deep learning in computer vision research and am willing to dabble into Natural Language Processing (NLP). I hope that things won't be very disjointed and some of the knowledge can be transferred.</p>
<p>I wanted to know if ... | https://cs.stackexchange.com/questions/157606/resources-to-learn-nlp |
Question: <p>I am taking a course on natural language processing that assumes the students have some background on theory of computation. I dont, but have read up till chapter 3 of the book "Speech and Language Processing by Jufrasky".</p>
<p>I therefore understand the following</p>
<ul>
<li>regular expressions and r... | https://cs.stackexchange.com/questions/89191/operations-on-regular-languages |
Question: <p>Microsoft is committed to the building of the scalable, industrial size topological quantum computer, Visual Studio integrated programming language and SDK will be released by the end of this year (2017). From the other side, logical/symbolic methods in computer science (natural language processing, infere... | https://cs.stackexchange.com/questions/81752/quantum-algorithms-for-logical-inference-reference-request |
Question: <p>What is the difference between a <strong>Residual</strong> Neural Net and a <strong>Recurrent</strong> Neural Net?</p>
<p>As I understand,</p>
<p><a href="https://arxiv.org/pdf/1512.03385v1.pdf" rel="noreferrer">Residual Neural Networks</a> are very deep networks that implement 'shortcut' connections acr... | https://cs.stackexchange.com/questions/63541/difference-between-residual-neural-net-and-recurrent-neural-net |
Question: <p>I'm introducing to the Natural Language Processing field and it's application. I'm planning to build a question answering system for a project, but some approaches are making me a bit confuse about the use of ontologies and it's application on the architecture of the system. I understand that an Ontology i... | https://cs.stackexchange.com/questions/74514/combining-ontology-and-relational-databases-in-question-answering-system |
Question: <p>Suppose I have $n$ independent observations $x_1,\dots,x_n$ from some unknown distribution over a known alphabet $\Sigma$, and I want to estimate the entropy of the distribution. I can count the frequency $f_s$ of each symbol $s \in \Sigma$ among the observations; how should I use them to estimate the Sha... | https://cs.stackexchange.com/questions/15010/estimate-entropy-based-upon-observed-frequency-counts |
Question: <p>I am developing a new IR system in a specialized context. I understand that a traditional IR system (like a search engine) should rank documents in terms of their relevance for a query. The most relevant documents should come first and the least relevant (perhaps: least relevant above some threshold) shoul... | https://cs.stackexchange.com/questions/41578/how-do-ir-researchers-evaluate-the-ranks-of-documents |
Question: <p>One can define the semantics of one definite word using the references to real world entities, relationships with the other words and other concepts and represent all this knowledge about this one word using logical symbolic expressions. And then one can encode all this set of symbolic expressions into vec... | https://cs.stackexchange.com/questions/98067/how-to-represent-symbolic-knowledge-using-real-numbers-theory-about-neural-net |
Question: <p>The wiki pages about chabots mention that statistical methods, keyword search and precompiled answers are used for the chatbots. But I feel that there should exist different - semantical approach for constructing chatbots. There are formal semantics of natural language (recent results in <a href="http://ww... | https://cs.stackexchange.com/questions/82575/semantic-drt-methods-for-conversational-agents-chatbots-dialogue-systems-r |
Question: <p>There is a famous <a href="http://en.wikipedia.org/wiki/Part-of-speech_tagging" rel="nofollow">part-of-speech tagging problem</a> in Natural Language Processing. The popular solution is to use <a href="http://en.wikipedia.org/wiki/Hidden_Markov_model" rel="nofollow">Hidden Markov Models</a>.</p>
<p>So tha... | https://cs.stackexchange.com/questions/20185/solving-the-part-of-speech-tagging-problem-with-hmm |
Question: <p>One of my future goals is to know in depth about building a text-based dialog system to answer questions about a specific topic (say, Tolkien's legendarium), assume that I have a large body of article-formed facts about that topic (say, Wikipedia). Excluding the "Computer Engineering" part of the problem, ... | https://cs.stackexchange.com/questions/63423/which-fields-of-computer-science-are-involved-in-knowledge-based-and-text-based |
Question: <h2>Context</h2>
<p>I am a final year Bachelor of Mathematics student and next semester I will write my Bachelor thesis.<br />
My interests are in Machine Learning (ML) and I will do a master in ML next year. More specific sub-fields I like are</p>
<ul>
<li>Deep Learning</li>
<li>Computer Vision</li>
<li>Natu... | https://cs.stackexchange.com/questions/133808/can-you-suggest-a-topic-for-a-bachelor-thesis-in-mathematics-that-is-related-to |
Question: <p>I'm looking for a "safe" representation of DAGs. With "safe" representation I mean that it can be described by a context-free grammar. Ideally, this grammar would be suitable for a simple LR parser.</p>
<p>The same problem for trees instead of DAGs is already solved: Just use one of the many well-known tr... | https://cs.stackexchange.com/questions/55109/context-free-grammar-for-dags |
Question: <p>I do not have a formal computer science background here so I am looking for pointers.</p>
<p>How would you advice I go about describing a formal way to describe procedures like cooking recipes, manufacturing process, driving to a location etc.</p>
<p>Given the fact that these types of process does feel lik... | https://cs.stackexchange.com/questions/142868/how-to-define-a-formal-language-for-describing-procedural-activities |
Question: <p>Several papers(<a href="http://www.iro.umontreal.ca/%7Elisa/pointeurs/hierarchical-nnlm-aistats05.pdf" rel="nofollow noreferrer">1</a> (originator), <a href="http://arxiv.org/pdf/1310.4546.pdf" rel="nofollow noreferrer">2</a>, <a href="http://dx.doi.org/10.1007/978-3-662-45924-9_16" rel="nofollow noreferre... | https://cs.stackexchange.com/questions/43912/what-is-the-activation-function-label-and-loss-function-for-hierachical-softmax |
Question: <p>Are there efforts to automatically discover new logics? Logics are simple structures - they have formal language, deduction rules, semantics and certain properties that are proved or discarded for every new logic. In fact, each logic can be put into framework of institutions (by Diaconescu et al).</p>
<p>... | https://cs.stackexchange.com/questions/85749/automatic-learning-discovery-of-logics |
Question: <p>We know that any "effectively computable" process is computable by a Turing machine (Turing-Church thesis).</p>
<p>Although it seems that "effectively computable" is still open to discussion, the intuitive interpretation is that any process that is "mechanical enough" can be computed by a Turing machine.<... | https://cs.stackexchange.com/questions/62607/if-we-spoke-in-tm-computable-english-what-would-it-look-like |
Question: <p>In Lambda Calculus, natural numbers, boolean values, list processing functions, recursion, if function are defined in terms of lambda terms. For example, natural numbers are defined as Church numerals, and recursion is defined in terms of a fixed point of a function.</p>
<p>Functional languages are said t... | https://cs.stackexchange.com/questions/112384/are-the-definitions-of-constructs-in-terms-of-lambda-terms-issues-in-implementat |
Question: <p>Speaking about multiagent systems (MAS) is about as fuzzy as talking about artificial intelligence systems (AI). They are in essence the distributed counterpart of AI.</p>
<p>While there are no so-called "AI theorem", AI research had given rise to many subfields, algorithms and scores of theorems (e.g. ga... | https://cs.stackexchange.com/questions/49957/what-are-the-theoretical-and-practical-contributions-of-multiagent-systems-to-sc |
Question: <p>The focus of this question is on natural language processing, specifically matching names between 2 lists. I am looking at employees that work in the same organization, however I obtained data from two different databases. Unfortunately, there is no unique key or ID that matches the users between lists, so... | https://cs.stackexchange.com/questions/171466/string-matching-algorithm-question-for-matching-approximately-similar-names-betw |
Question: <h2>Program Synthesis</h2>
<p>To borrow from Microsoft: </p>
<blockquote>
<p><a href="https://homes.cs.washington.edu/~bornholt/post/synthesis-for-architects.html" rel="nofollow">Program synthesis</a> is the task of automatically discovering an executable piece of code given user intent expressed using va... | https://cs.stackexchange.com/questions/63242/are-there-any-examples-of-programming-synthesis-in-vulnerability-research |
Question: <p>Representing numeric values using <a href="http://en.wikipedia.org/wiki/Positional_notation">positional notation</a> is one of the milestones in the history of arithmetic. Babylons used a base 60 system, Maya a base 20 system; base 10 system became "the standard" used by modern civilizations; digital compu... | https://cs.stackexchange.com/questions/4906/numeral-systems-other-than-unary-used-in-nature-or-in-animal-and-human-behaviour |
Question: <p>I wish to find the CFG for a language on two symbols (say <em>a</em> and <em>b</em>) whose words begin and terminate with the same symbol, and have equal quantities of <em>a</em>'s and <em>b</em>'s. What is the thought process I should use for finding such a grammar? What is the most natural or simplest ... | https://cs.stackexchange.com/questions/52324/language-of-words-that-begin-and-end-with-same-symbol-and-have-equal-numbers-of |
Question: <p>I am trying to do the formal semantics (Montague grammar, abstract categorial grammar) of natural language and encode the sentence <code>John is boss</code>. The type system has to primitive types - <code>e</code> for entity and <code>t</code> for Boolean type. <code>John</code> has type <code>e</code>, <c... | https://cs.stackexchange.com/questions/96533/how-to-transform-lambda-function-to-multi-argument-lambda-function-and-how-to-re |
Question: <p>You have a Turing machine that only processes input on the form $0^*$. If it is given an input without 0's, it will simply halt without accepting or do anything else. Is it Turing Complete?</p>
<p>The set $0^*$ is countably infinite, since you can make the bijective function $f(x) : 0^* → \mathbb{N} $:</p... | https://cs.stackexchange.com/questions/24125/is-a-turing-machine-that-only-takes-strings-of-the-form-0-turing-complete |
Question: <p>I took a tangent from a <a href="https://github.com/davidkitfriedman/segment_fusion/blob/master/cs_stackexchange_question.md" rel="nofollow noreferrer">student
project</a>
I had done a number of years ago and spent some time studying distance
functions.</p>
<p>(please note that the above link contains the... | https://cs.stackexchange.com/questions/80327/specific-examples-with-explanation-of-similarities-and-differences-of-how-distan |
Question: <p>The formula, in the old way of using it, can contain symbols in order and a mixture that does not meet the criteria of correctness (i.e. arbitrary symbols do not form a well-formed formula (WFF) and do not conform to the grammar).</p>
<p>Also, a sentence written in a natural language could be in such a fo... | https://cs.stackexchange.com/questions/107244/what-is-the-minimum-type-of-logical-system-that-recognizes-if-a-formalized-sente |
Question: <p>I'm interested in knowing things about the computability of concurrent programs. If you had a Turing complete language that also let you branch off new programs but had no means of communication between them there would be programs that you couldn't write. Namely those that required communication between c... | https://cs.stackexchange.com/questions/64153/how-does-lack-of-deadlock-relate-to-computability-in-process-calculi |
Question: <p>I remember when my dad explained to me for the first time how a certain model of computer he had came with a "math coprocessor" which made certain math operations much faster than if they were done on the main CPU without it. That feels a lot like the situation we are in with GPUs today.</p>
<p>I... | https://cs.stackexchange.com/questions/130289/what-roadblocks-are-there-to-hsa-becoming-standard-similar-to-floating-point-un |
Question: <p>I understand how one can generate a latent vector space from a collection of words or documents, using something like Glove, word2vec, doc2vec, etc. I don't understand how this representation can be turned into features for something generating these documents at a "higher level", like a user or a product.... | https://cs.stackexchange.com/questions/70136/word-embeddings-with-documents-and-users |
Question: <p>In most articles that compare word embeddings they use cosine distance to determine if words are similar. Why?</p>
<p>I guess that euclidean distance should work too. So, my question is: it doesn't?
And why cosine distance doesn't fail?</p>
Answer: <p>Those are two different measures of similarity. You c... | https://cs.stackexchange.com/questions/147713/why-word-embeddings-are-compared-with-cosine-distance-and-not-euclidean |
Question: <p>How were the <a href="https://openai.com/blog/better-language-models/" rel="nofollow noreferrer">GPT-2</a> token embeddings constructed? </p>
<p>The authors mention that they used Byte Pair Encoding to construct their vocabulary. But BPE is a compression algorithm that returns a list of subword tokens tha... | https://cs.stackexchange.com/questions/116184/question-about-word-embeddings-in-a-specific-language-model-gpt-2 |
Question: <p>I'm currently doing a small-time project where I have to deliver a model which can classify specific elements on a web-page using the HTML code.</p>
<p>For this, I have considered using the HTML tags for each specific element (which I can extract using some other code) and then transforming it to a vector ... | https://cs.stackexchange.com/questions/143225/how-should-i-create-a-word-embedding-an-nlp-model-recognizing-html-elements |
Question: <p>This question is about de paper <a href="https://arxiv.org/pdf/2103.15330.pdf" rel="nofollow noreferrer">Extending Multi-Sense Word Embedding to Phrases and Sentences for Unsupervised Semantic Applications</a>, depicted in the following picture:</p>
<p><a href="https://i.sstatic.net/1Taan.jpg" rel="nofollo... | https://cs.stackexchange.com/questions/144405/how-do-i-find-the-most-similar-phrase-in-extending-multi-sense-word-embedding-t |
Question: <p>This question is about de paper <a href="https://arxiv.org/pdf/2103.15330.pdf" rel="nofollow noreferrer">Extending Multi-Sense Word Embedding to Phrases and Sentences
for Unsupervised Semantic Applications</a>.</p>
<p>I am interested in the transformer part of the paper and the main structures of the algor... | https://cs.stackexchange.com/questions/144325/how-can-i-modify-this-detail-in-the-article-extending-multi-sense-word-embeddi |
Question: <p><a href="https://i.sstatic.net/plIou.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/plIou.png" alt="questions from cohen"></a></p>
<p>consider this question of finding words with no self embedded nonterminal in their derivation.
The author(cohen) says that If CFG is in CNF then all the wor... | https://cs.stackexchange.com/questions/97252/self-embedded-nonterminal-in-derivation-of-a-word |
Question: <p>I have a question on the node2vec algorithm described in <a href="https://arxiv.org/pdf/1607.00653.pdf" rel="nofollow noreferrer">this paper</a>.</p>
<p>Node2vec is a deep learning algorithm that word2vec to graphs to learn embeddings. The authors claim that it can help find nodes with similar "roles", or... | https://cs.stackexchange.com/questions/95458/how-can-node2vec-help-find-similar-roles-within-a-graph-nodes-whose-connectio |
Question: <p><strong>Seeking an indexing data structure that is smaller than quadratic in space.</strong></p>
<p>As part of an NLP algorithm using word embeddings of 300-dimensions, I am trying to improve the speed of <a href="http://proceedings.mlr.press/v37/kusnerb15.pdf" rel="nofollow noreferrer">Word Mover's Distan... | https://cs.stackexchange.com/questions/160119/space-efficient-data-structure-to-store-precomputed-all-nearest-neighbors-in-hig |
Question: <p>In machine learning literature, when handling words or text inputs, the strings are often mapped onto a vector space using techniques such as word2vec.</p>
<p>The terminology in this is that the individual word vectors are 'embeddings' and the embeddings together are a distributed representation of the in... | https://cs.stackexchange.com/questions/68714/in-what-sense-do-we-mean-distributed-when-talking-about-a-distributed-represen |
Question: <p>One can define the semantics of one definite word using the references to real world entities, relationships with the other words and other concepts and represent all this knowledge about this one word using logical symbolic expressions. And then one can encode all this set of symbolic expressions into vec... | https://cs.stackexchange.com/questions/98067/how-to-represent-symbolic-knowledge-using-real-numbers-theory-about-neural-net |
Question: <p>So my question is about when we want to find the total derivative of the NLL Loss function <span class="math-container">$L$</span> w.r.t. <span class="math-container">$w_i$</span>.</p>
<p>So the "pipeline" is often expressed as:
<span class="math-container">$$\frac{\partial L}{\partial w_i} = \fr... | https://cs.stackexchange.com/questions/163325/confusion-on-the-use-of-the-chain-rule-for-the-total-derivative-of-the-nll-loss |
Question: <p>I am working on a task embedding sentences into a lower-dimensional space according to style, both grammatical and lexical. As such, I want to have as input the linear ordering of tokens in each sentence, together with its dependency parse as provided by spacy. </p>
<p>In particular, I'd like to find a w... | https://cs.stackexchange.com/questions/96814/how-to-represent-sentences-with-their-dependency-parses-as-input-to-an-rnn |
Question: <p>I've been using multiprocessing and parallelisation for the first time this week on a very large data set using 32 CPUs. I decided to explore it for a smaller task just to see if I could learn anything, just on the 4 CPUs of my Mac.</p>
<p>I created a task to add 100 to every element in a 500,000 element ... | https://cs.stackexchange.com/questions/95896/why-does-parallelising-slow-down-this-simple-problem-against-looping-through-all |
Question: <p>If I copy a picture and paste it into Microsoft Word, would there be the difference if I embedded the same picture into another Word file ? Are they both object embedding?(As the object is saved in the document?)</p>
Answer: | https://cs.stackexchange.com/questions/151679/is-copying-and-pasting-a-sort-of-object-embedding |
Question: <p>I <a href="http://www.math.vanderbilt.edu/~msapir/ftp/pub/survey/survey.pdf" rel="nofollow">believe</a> that the <a href="https://en.wikipedia.org/wiki/Word_problem_for_groups" rel="nofollow">word problem</a> is the problem to decide whether two different expressions denote the same element of a suitably d... | https://cs.stackexchange.com/questions/55413/what-is-the-name-of-the-word-problem-for-free-groups-under-straight-line-program |
Question: <p>I have two regular languages <em>A</em> and <em>B</em>, and I want to determine whether there is any pair of strings, <em>a</em> in <em>A</em> and <em>b</em> in <em>B</em>, such that (<em>a</em> <em>b</em>) is a prefix of a string in (<em>A</em> <em>B</em>) and the left-most match of <em>B</em> i... | https://cs.stackexchange.com/questions/10852/for-regular-languages-a-and-b-determine-whether-b-might-match-early-in-a-b |
Question: <p><a href="https://users.ece.cmu.edu/~koopman/roses/dsn04/koopman04_crc_poly_embedded.pdf" rel="nofollow noreferrer">Koopman, P., & Chakravarty, T. (2004, June). Cyclic redundancy code (CRC) polynomial selection for embedded networks. In Dependable Systems and Networks, 2004 International Conference on (... | https://cs.stackexchange.com/questions/69262/numerically-validate-crc-performance |
Question: <p>I'm designing a communication protocol for 24 to 52 bits (typically 32 bits) data including the CRC-8 for error detection. I'm trying to select the best polynomial for this kind of application.</p>
<p>In the paper <a href="http://users.ece.cmu.edu/~koopman/roses/dsn04/koopman04_crc_poly_embedded.pdf" rel=... | https://cs.stackexchange.com/questions/51758/why-is-hamming-weight-in-the-crc-context-independent-from-the-data |
Question: <p>There is a controversy about Monad implementation in S.O .</p>
<p>The original question is,</p>
<p><a href="https://stackoverflow.com/questions/53109889/whats-so-special-about-monads-in-kleisli-category#">What's so special about Monads in Kleisli category?</a></p>
<blockquote>
<p>Is there any counterexampl... | https://cs.stackexchange.com/questions/99516/join-is-the-heart-of-the-monad-because-it-encompasses-everything-a-monad-can-do |
Question: <p>I have a very generic question to ask. It is related to
research. I'm interested in Graph theory. I have done a course in
it. I have done some topics related to both graph theory as a point
of view of doing it as a mathematics student and also studied some
graph algorithms. I'm going for research inte... | https://cs.stackexchange.com/questions/25847/research-in-graph-theory-versus-graph-algorithms |
Question: <p>I need a book recommendation for graph theory which supposes background in set theory. I want to cover those questions first as graph theory is part of combinatorics. Can you recommend me a book which is beginner-friendly without going much into combinatorics?</p>
<p>I heard about Harris and West but these... | https://cs.stackexchange.com/questions/148733/graph-theory-book-for-beginners |
Question: <p>Is there research or are there results that discuss graph isomorphism in the context of spectral graph theory?</p>
<p>Two known theorems of spectral graph theory are:</p>
<ol>
<li><p>Two graphs are called isospectral or cospectral if the adjacency matrices of the graphs have equal multisets of eigenvalue... | https://cs.stackexchange.com/questions/25988/does-spectral-graph-theory-say-anything-about-graph-isomorphism |
Question: <p>In graph theory, can a cycle contain repeated nodes/vertices not including the first and last ones? If so, can you please give an example?</p>
Answer: <p>Usually cycles are assumed not to have any repeating vertices (other than the first and last vertices being identical). If repeating vertices are allowe... | https://cs.stackexchange.com/questions/150806/repeated-vertices-in-cycles-graph-theory |
Question: <p>My basic problem includes a graph where each node <span class="math-container">$i$</span> is associated with a weight <span class="math-container">$c_i$</span>, and the problem is to find a minimum (or maximum) weighted independent set with a fixed cardinality <span class="math-container">$p$</span>. This ... | https://cs.stackexchange.com/questions/129198/is-this-a-known-problem-in-graph-theory |
Question: <p>I am looking for a reference text on applied graph theory and graph algorithms. Is there a standard text used in most computer science programs? If not, what are the most respected texts in the field? I have Cormen et al.</p>
Answer: <p>For digraphs in particular, there's Band-Jensen & Gutin's <a hr... | https://cs.stackexchange.com/questions/2845/standard-or-top-text-on-applied-graph-theory |
Question: <p>So I'm sure this is an unusual question for this type of site, but I am to give a talk on algorithms for discrete graphs in a few weeks. It has been specified that the talk is to be on some algorithm which will be unfamiliar for those attending. It it to be some graph traversal algorithm at about the junio... | https://cs.stackexchange.com/questions/106743/looking-for-an-esoteric-graph-theory-algorithm |
Question: <p>I am working on an algorithm that ranks a set of nodes in a graph with respect to how relative this node is to other predefined nodes (I call them query nodes). The way how the algorithm works is similar to recommendation algorithms. For instance, if i want to buy an item from an online store, the algorith... | https://cs.stackexchange.com/questions/32203/relative-importance-in-graph-theory |
Question: <p>A follow-up on <a href="https://stackoverflow.com/questions/15037679/what-do-the-absolute-value-bars-mean-in-graph-theory">https://stackoverflow.com/questions/15037679/what-do-the-absolute-value-bars-mean-in-graph-theory</a></p>
<p>What is the difference between single bar <span class="math-container">$|G|... | https://cs.stackexchange.com/questions/167412/graph-theory-single-bar-vs-double-bar-size-notation |
Question: <p>Can someone recommend a graph theory textbook that covers treewidth thoroughly?</p>
<p>Something that focuses on the graph-theoretic structure of bounded treewidth graphs rather than solving problems on them. Don't need the strongest/newest results but would prefer something that</p>
<p>Preferably somethi... | https://cs.stackexchange.com/questions/132289/is-there-a-graph-theory-textbook-that-covers-treewidth-thoroughly |
Question: <p>So I have recently ran into a graph theory problem and was unable to find a matching algorithm for the problem or reword the problem to match some existing algorithm.</p>
<p>The problem is pretty straightforward - given a weighted directed graph, pick edges to maximize the sum of all weights of the chosen... | https://cs.stackexchange.com/questions/109576/approporiate-algorithm-for-a-graph-theory-problem |
Question: <p>I'm currently studying a paper which uses extensively the term '<code>min-max theorems</code>' in graph theory, and claims to present a tool allowing to generalize these theorems. (here is the <a href="http://acta.bibl.u-szeged.hu/38618/1/math_041_fasc_001_002.pdf#page=65" rel="nofollow noreferrer">link</a... | https://cs.stackexchange.com/questions/99039/what-is-a-min-max-theorem-in-graph-theory |
Question: <p>I am working on some time series problems where the Fourier representation of the signal in the frequency domain is also important. I am wondering if there is any connection between time series signals consisting of sinusoidal/inherently periodic functions (functions that can be cleanly represented by a su... | https://cs.stackexchange.com/questions/140083/is-there-a-good-analogy-between-spectral-representation-of-a-signal-and-graph-th |
Question: <p>Suppose I have a number of airports which have a set number of routes. Large airports have 7, medium airports have 4, and small airports have 1.</p>
<p>First of all, what would I call a graph of this type where it is undirected, has no parallel edges, no loops, and every edge is connected to another (that... | https://cs.stackexchange.com/questions/77119/graph-theory-airline-schedule |
Question: <p>I have a directed graph with the following properties:</p>
<ol>
<li>Except for a few special progenitor nodes, every node has two parent nodes</li>
<li>Any node can have any whole number of child nodes</li>
<li>The graph is generated such that no node is a descendant of itself in the following way: I star... | https://cs.stackexchange.com/questions/88597/what-graph-theory-algorithms-would-help-solve-this-problem |
Question: <p>I need to determine all the trees on 25 vertices for which there exists an integer m ≥ 2, such
that the degree of each vertex gives the same remainder when divided by m.</p>
<p>Can somebody help ?</p>
Answer: <p>Suppose <span class="math-container">$G = (V, E)$</span> is a tree with 25 vertices such that... | https://cs.stackexchange.com/questions/126596/graph-theory-trees |
Question: <p>Fix an optimal solution G∗ to k-Cycle-Free Subgraph. Partition the vertex set V of G randomly into two subsets, A and B, each of size n/2, and remove edges internal to A or B. In expectation, the fraction of edges in G∗ that remain after this process is 1/2. <strong><em>With probability at least 2/3 the fr... | https://cs.stackexchange.com/questions/96407/markov-inequality-in-graph-theory |
Question: <p>I was requested to prove or disprove the following statement
if a graph is conncted does it necessarily means that E>(V-1)(V-2)/2
v represents vertex and E the edges
I think I need to disprove it with overall disproval but how?</p>
Answer: <p>If you think it's false, the easiest way to disprove it would... | https://cs.stackexchange.com/questions/118141/graph-theory-proof-or-disproving |
Question: <p>Frankly speaking I have many problem with symbols in graph such as (s:s') or v\S or some symbols such as those that I mentioned . Can anyone suggest a good resource or a good tutorial on the net that has been discussed about these symbols and have clarified these symbols ?</p>
Answer: | https://cs.stackexchange.com/questions/116444/good-resource-for-graph-theory |
Question: <p>I am looking for a simple layman's term explanation on how do programs like Apache Airflow or Luigi (or any Task/ETL schedulers) determine the shortest path to complete a certain task and make it possible to parallelize it? And how does that, if any, relate to graph theory?</p>
Answer: | https://cs.stackexchange.com/questions/119602/how-do-programs-like-apache-airflow-luigi-determine-shortest-path-and-how-does |
Question: <p>Graphs are usually defined as a set of vertices $V$ together with a set of edges $E$ consisting of elements $V \times V$. I'm interested in a slight generalization of this, where instead one has two sets $V$, $W$ and the edges are taken from $V \times W$. The adjacency matrix of such an object would be rec... | https://cs.stackexchange.com/questions/47092/graph-theory-analogue-of-rectangular-matrix |
Question: <p>Mr. and Mrs. Smith, a married couple, invited 9 other married couples to a party. (So the party consisted of 10
couples.) There was a round of handshaking, but no one shook hand with his or her spouse. Afterwards, Mrs.
Smith asked everyone except herself, “how many persons have you shaken hands with?” All ... | https://cs.stackexchange.com/questions/27507/graph-theory-handshaking-problem |
Question: <p>In Haskell you find <a href="http://www.cs.ox.ac.uk/duncan.coutts/papers/recursive_data_structures_in_haskell.pdf" rel="nofollow noreferrer">graphs defined like this</a>:</p>
<pre><code>data Graph a = GNode a (Graph a)
</code></pre>
<p><a href="https://hackage.haskell.org/package/algebraic-graphs" rel="n... | https://cs.stackexchange.com/questions/94003/dependent-type-theory-implementation-of-a-graph |
Question: <p>Consider this example, I did my pseudocode in python</p>
<pre><code>findCycle(G):
for each edge e in E(G):
if isThereCycle(G-e):
G = G - e
return G
</code></pre>
<p>assume isthereCycle returns whether the graph <span class="math-container">$G$</span> has a cycle. </p>
<p>Inp... | https://cs.stackexchange.com/questions/112054/graph-theory-conventions-difference-between-a-path-and-a-graph |
Question: <p>You are playing with boxes on a <span class="math-container">$K_{1, n}$</span>-<span class="math-container">$\textbf{subdivision}$</span> graph <span class="math-container">$G:=(V, E)$</span> whose number of vertices is odd, i.e., <span class="math-container">$|V| \equiv 1$</span> (mod <span class="math-co... | https://cs.stackexchange.com/questions/153291/playing-with-boxes-np-hard-graph-theory |
Question: <p>An equivalence relation on a finite vertex set can be represented by an undirected graph that is a disjoint union of cliques. The vertex set represents the elements and an edge represents that two elements are equivalent.</p>
<p>If I have a graph $G$ and graphs $G_1,\dots,G_k$, we say that $G$ is covered ... | https://cs.stackexchange.com/questions/27828/the-equivalence-relations-cover-problem-in-graph-theory |
Question: <p>Could most categories , or a finite part of them be represented on a subset of a complete graph of N vertices (Kn) which is connected. and partly directed? Could all the axioms of category theory be written for such graphs?</p>
Answer: <p>A category consists of:</p>
<ul>
<li><p>Objects.</p></li>
<li><p>D... | https://cs.stackexchange.com/questions/23875/category-theory-and-graphs |
Question: <p>For Christmas my brother got me this puzzle:
<img src="https://i.sstatic.net/OqSnc.jpg" alt="puzzle"></p>
<p>The premise is that you have a metal medallion with a series of holes in it and a metal ring with a slit just large enough to slide it from hole to hole, barring obstacles, like the edge of the map... | https://cs.stackexchange.com/questions/85965/graph-theory-applied-to-a-physical-logic-puzzle |
Question: <p>$n$ people want to have dinner together around a table for $k$ nights so that no person has the same neighbor twice.</p>
<ol>
<li>How big can $k$ be in terms of $n$?</li>
<li>Does everybody get to sit next to everybody else?</li>
<li>How many seating arrangements are there?</li>
</ol>
Answer: <p><em>Poin... | https://cs.stackexchange.com/questions/44212/graph-theory-n-people-sitting-around-table |
Question: <p>Based on the question below, can someone please explain to me the reasoning behind why the maximum number of edge is 5/2|V|? I don't find the particular reasoning in the solution to be that helpful for why the maximum number is 5/2|V|. </p>
<p><a href="https://i.sstatic.net/OUIeL.png" rel="nofollow norefe... | https://cs.stackexchange.com/questions/101199/graph-theory-determining-maximum-number-of-edges |
Question: <p><a href="https://www.zama.ai/" rel="nofollow noreferrer">Homomorphic encryption</a> allows to store data on a blockchain encrypted, but a smart contract is a program that is executed on a node on the blockchain, therefore the "source code" of the contract is not private; therefore it is desirable... | https://cs.stackexchange.com/questions/170640/is-homomorphic-computation-possible-using-graph-theory |
Question: <p>Suppose we have a conjecture on graph theory that can be (dis)proved by means of a counter example, then, is it true that every alternative (dis)proof of the conjecture can be mapped to a counter example? </p>
<p>This is in the general case, but for instance, can any proof that the hadwiger's conjecture i... | https://cs.stackexchange.com/questions/27529/if-disproving-a-conjecture-on-graph-theory-can-be-done-just-by-a-counter-examp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.