word-representable graphs
New results on word-representable graphs
... is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if (x, y) ∈ E for each x 6= y ...of word-representable ...
8
Solving computational problems in the theory of word-representable graphs
... non-word-representable graphs of each size, i.e. graphs containing no non-word-representable strict induced ...non-word-representable graphs of each size. ...
18
Semi-transitive orientations and word-representable graphs
... Circle graphs. Circle graphs are those whose vertices can be rep- resented as chords on a circle in such a way that two nodes in the graph are adjacent if and only if the corresponding chords ...a ...
14
Solving computational problems in the theory of word representable graphs
... non-word-representable graphs of each size, i.e. graphs containing no non-word-representable strict induced ...non-word-representable graphs of each size. ...
18
A comprehensive introduction to the theory of word-representable graphs
... If we change “3-representable” by “word-representable” in Theo- rem 12 we would obtain a weaker, but clearly still true statement, which is not hard to prove directly via semi-transitive ...
37
Representing graphs via pattern avoiding words
... of word-representable graphs As it is mentioned in Section 2, apart from our main generalization, given in Definition 1, of the notion of a word-representable graph, we have another ...
23
Existence of μ-representation of graphs
... 12-rerpesentable graphs is properly contained in the class of compa- rability graphs, which, in turn, is properly contained in the class of word-representable graphs corresponding to ...
9
Word-representability of face subdivisions of triangular grid graphs
... on word-representable graphs were obtained in the literature; for example, see [1], [3], [5], [7], [9], [11], and ...is word- representable if and only if it admits a semi-transitive ...
17
Word-representability of triangulations of grid-covered cylinder graphs
... non-word-representable graphs that can appear in triangulations of GCCGs with three sectors (see Figure ...these graphs is ...six graphs in Figure ...be ...
19
On k-11-representable graphs
... study word-representable graphs include the fact exposed in [10] that these graphs generalize several important classes of graphs such as circle graphs [3], 3-colourable ...
19
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
... syntactic graphs perform better than logical graphs in Table ...logical graphs gave superior performance in comparison with other contexts (Sentence context window, syntactic ...logical graphs ...
7
Co-occurrence graphs for word sense disambiguation in the biomedical domain
... Regardless of whether we refer to general or specific domains, such as the biomedical one, it is commonly accepted in the literature [5, 6, 1] that most WSD algorithms fall into one of the fol- lowing categories: ...
22
Multi Sentence Compression: Finding Shortest Paths in Word Graphs
... What properties are characteristic of a good com- pression? It should neither be too long, nor too short. It should go through the nodes which rep- resent important concepts but should not pass the same node several ...
9
Word Sense Induction & Disambiguation Using Hierarchical Random Graphs
... Another graph-based method is presented in (Dorow and Widdows, 2003). They extract only noun neighbours that appear in conjunctions or dis- junctions with the target word. Additionally, they extract second-order ...
11
Relation Prediction for Unseen Entities Using Entity Word Graphs
... The word “manga” also appears in the description of Entity3, which is a Japanese movie, and this de- scription also contains words specific to Japanese works such as “Japanese animated” and “Hayao Miyazaki” who is ...
6
Essentia: Mining Domain specific Paraphrases with Word Alignment Graphs
... Future work involves various directions. One direction is to derive domain-specific sentence templates from corpora. These templates can be useful for natural language generation in question- answering systems or ...
6
Words are Vectors, Dependencies are Matrices: Learning Word Embeddings from Dependency Graphs
... on word-meaning has been focusing on developing Dis- tributional Semantic Models (DSMs), based on the hypothesis that a word’s sense can be inferred from the contexts it appears in (Harris, ...each word ...
12
Regional Cricket Identities: The construction of class narratives and their relationship to contemporary supporters
... Microsoft Word StoneBolton presentation with graphs University of Huddersfield Repository Stone, Duncan Regional Cricket Identities The construction of class narratives and their relationship to conte[.] ...
30
Using Domain Knowledge about Medications to Correct Recognition Errors in Medical Report Creation
... the word graph for each path matching one of the generated spoken forms of the medications data ...the word graph from Figure 1 with an in- serted concept edge (in ...
7
The Relevance of Computational Techniques for Literary Interpretations on a Micro-Level
... single word, four lists of words would have to be made ...that graphs are indeed not as objective as they seem, as well as to always combine a close reading with a distant reading, even if just to check if ...
101