scholarly journals The shapes of collocation

2016 ◽  
Vol 21 (2) ◽  
pp. 139-164 ◽  
Author(s):  
Paul Baker
Keyword(s):  
Graph Theory ◽  
Corpus Analysis ◽  
Different Types ◽  
Reference Corpus

The tool GraphColl (Brezina et al. 2015) allows collocational networks to be identified within corpora, enabling corpus analysis to go beyond two-way collocation. This paper aims to illustrate the types of linguistic relationships that can appear when more than two words are considered, using graph theory to account for the different types of collocational “shapes” that can be formed within GraphColl networks. Using the reference corpus, the BE06, examples of different types of graphs were obtained and analysed in order to form an understanding of the sorts of relationships between words that occur in particular shapes. The analysis indicates that concepts from graph theory can be usefully integrated into corpus analysis of collocation as well as showing the potential for a more sophisticated understanding of the company that words keep.

scholarly journals Body Mass Index in Human Walking on Different Types of Soil Using Graph Theory

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 47935-47942
Author(s):  
Washington Velasquez ◽  
Manuel S. Alvarez-Alvarado ◽  
Joaquin Salvachua
Keyword(s):  
Body Mass Index ◽  
Graph Theory ◽  
Body Mass ◽  
Human Walking ◽  
Different Types

scholarly journals Interval-Valued Fuzzy Soft Graphs

2017 ◽  
Vol 5 (1) ◽  
pp. 19-27 ◽  
Author(s):  
Onur Zihni ◽  
Yıldıray Çelik ◽  
Güven Kara
Keyword(s):  
Graph Theory ◽  
Cartesian Product ◽  
Soft Sets ◽  
Strong Product ◽  
Different Types ◽  
Fuzzy Soft Sets ◽  
Interval Valued

Abstract In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs. We also present several different types operations including cartesian product, strong product and composition on interval-valued fuzzy soft graphs and investigate some properties of them.

scholarly journals Vertex Antimagic Edge Labeling of Cube of a Path Graph

2019 ◽  
Vol 9 (2) ◽  
pp. 1952-1955
Keyword(s):  
Graph Theory ◽  
Graph Theoretic ◽  
Path Graph ◽  
Different Types ◽  
Different Characteristics ◽  
Edge Labeling

There are many concepts in science that are very hard to understand and to make use of them in a effective way, it is atmost important to have a tool that best explains these complex concepts in a simpler way. Graph theory is one of the most interesting topics in mathematics that was used to explain many complicated concepts in a simpler and easier way. Graph theory is not just about points and lines and above all, there are many interesting topics in graph theory which has motivated many scholars to pursue research in different areas. One of the most interesting and elite topics in graph theory is the path. The researchers have discovered different types of concepts using paths and have proved different characteristics. Cube of a path graphs are one of those fascinating graphs that have evolved from paths and has been proved to admit a variety of properties. Like paths, labeling is also an area where graph theoretic researchers have shown great interest and have come up with different types of labeling. With the discovery of a spate of labeling, it has motivated and kindled the researchers to apply these labeling to a variety of graphs and check the admittance of different types of properties. One such intriguing type of labeling is the vertex antimagic edge labeling. In this paper, we will show that the cube of a path graph admits vertex antimagic edge labeling.

scholarly journals On Bi-gram Graph Attributes

2021 ◽  
Vol 14 (3) ◽  
pp. 78
Author(s):  
Thomas Konstantinovsky ◽  
Matan Mizrachi
Keyword(s):  
Graph Theory ◽  
Graph Coloring ◽  
Semantic Analysis ◽  
Large Datasets ◽  
Corpus Analysis ◽  
Graph Representation ◽  
New Approach ◽  
Graph Density ◽  
Coloring Graph ◽  
Basic Graph

We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as unique insights or against other corpus graphs, attributes such as the graph chromatic number and the graph coloring, graph density and graph K-core. We observe a vast domain of tools and algorithms that can be developed on top of the graph representation; creating such a graph proves to be computationally cheap, and much of the heavy lifting is achieved via basic graph calculations. Furthermore, we showcase the different use-cases for the bi-gram graphs and how scalable it proves to be when dealing with large datasets.

On bipolar fuzzy soft graphs

2018 ◽  
Vol 27 (2) ◽  
pp. 123-132
Author(s):  
Yildiray Çelik ◽  
Keyword(s):  
Graph Theory ◽  
Cartesian Product ◽  
Soft Sets ◽  
Strong Product ◽  
Different Types ◽  
Fuzzy Soft Sets

In this paper, we combine the concepts of bipolar fuzzy soft sets and graph theory. Then we introduce notations of bipolar fuzzy soft graph and strong bipolar fuzzy soft graph. We also present several different types of operations including cartesian product, strong product and composition on bipolar fuzzy soft graphs and investigate some properties of them.

Factoring Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Graph Theory ◽  
Bipartite Graphs ◽  
Petersen Graph ◽  
Different Types ◽  
Bridgeless Graph ◽  
Hall's Theorem ◽  
Hall’S Theorem

This chapter focuses on Hall's Theorem, introduced by British mathematician Philip Hall, and its connection to graph theory. It first considers problems that ask whether some collection of objects can be matched in some way to another collection of objects, with particular emphasis on how different types of schedulings are possible using a graph. It then examines one popular version of Hall's work, a statement known as the Marriage Theorem, the occurrence of matchings in bipartite graphs, Tutte's Theorem, Petersen's Theorem, and the Petersen graph. Peter Christian Julius Petersen introduced the Petersen graph to show that a cubic bridgeless graph need not be 1-factorable. The chapter concludes with an analysis of 1-factorable graphs, the 1-Factorization Conjecture, and 2-factorable graphs.

scholarly journals Adjacency Matrix of Product of Graphs

10.29007/fqlw ◽  
2018 ◽  
Author(s):  
Urvashi Acharya ◽  
Himali Mehta
Keyword(s):  
Graph Theory ◽  
Tensor Product ◽  
Adjacency Matrix ◽  
Incidence Matrix ◽  
Cartesian Product ◽  
Laplacian Matrix ◽  
New Product ◽  
Different Types ◽  
Product Of Graphs

In graph theory, different types of matrices associated with graph, e.g. Adjacency matrix, Incidence matrix, Laplacian matrix etc. Among all adjacency matrix play an important role in graph theory. Many products of two graphs as well as its generalized form had been studied, e.g., cartesian product, 2−cartesian product, tensor product, 2−tensor product etc. In this paper, we discuss the adjacency matrix of two new product of graphs G H, where = ⊗2, ×2. Also, we obtain the spectrum of these products of graphs.

Role of Graph Theory in Computational Neuroscience

2022 ◽  
pp. 86-97
Author(s):  
Hitesh Marwaha ◽  
Anurag Sharma ◽  
Vikrant Sharma
Keyword(s):  
Graph Theory ◽  
Human Brain ◽  
Computational Neuroscience ◽  
Cognitive Functions ◽  
Special Focus ◽  
Meaningful Information ◽  
Different Types ◽  
The Brain ◽  
Vertex Centrality

Neuroscience is the study of the brain and its impact on behavior and cognitive functions. Computational neuroscience is the subfield that deals with the study of the ability of the brain to think and compute. It also analyzes various electrical and chemical signals that take place in the brain to represent and process the information. In this chapter, a special focus will be given on the processing of signals by the brain to solve the problems. In the second section of the chapter, the role of graph theory is discussed to analyze the pattern of neurons. Graph-based analysis reveals meaningful information about the topological architecture of human brain networks. The graph-based analysis also discloses the networks in which most nodes are not neighbors of each other but can be reached from every other node by a small number of steps. In the end, it is concluded that by using the various operations of graph theory, the vertex centrality, betweenness, etc. can be computed to identify the dominant neurons for solving different types of computational problems.

The semantics of demonyms in English

2017 ◽  
Author(s):  
Michael Roberts
Keyword(s):  
English Language ◽  
Corpus Analysis ◽  
Different Types

This chapter explores the semantics of demonyms, as they are used in the English language, and demonstrates using the Natural Semantic Metalanguage (NSM) that demonyms can be divided into a number of categories. Using ‘semantic templates’, it shows that the demonyms Germans, Queenslanders, and Londoners can be separated into categories based on their relationship to the semantic molecule ‘country’, and that without this semantic molecule, subtle differences in the use of the demonyms cannot be fully explained. For instance, corpus analysis reveals that the terms used refer to people from countries (Australians, Germans, Danes) do not occur with terms that refer to people from cities or town (Melbournians, Londoners, Parisians). Conceptually, people seem to understand that all demonyms are not the same, and that there are different types of demonyms. Therefore, this study focuses on identifying the types of demonyms, by exploring both their use and their semantic characteristics.

scholarly journals Tunnekausatiivilauseen argumenttirakenne II

Virittäjä ◽  
2019 ◽  
Vol 123 (4) ◽  
Author(s):  
Saara Huhmarniemi
Keyword(s):  
Argument Structure ◽  
Corpus Analysis ◽  
Syntactic Analysis ◽  
Generative Syntax ◽  
Lower Position ◽  
Express Emotion ◽  
Different Types ◽  
Complement Clause ◽  
Embedded Clause ◽  
Finite Clause

Suomen tunnekausatiivilause muodostuu tunnetta ilmaisevasta verbistä, johon liittyy tyypillisesti partitiivimuotoinen kokija, aiheuttaja tai kumpikin. Aiheuttaja voi olla paitsi nominatiivimuotoinen NP myös lausemainen, kuten ­A-infinitiivi, kun-lause, että-lause tai alisteinen kysymyslause. Tämän artikkelin tavoitteena on osoittaa generatiivisen syntaksin työkaluja käyttäen, että A-infinitiivi ja että-lause sijoittuvat tunnekausatiivi­lauseen argumenttirakenteessa komplementti­positioon, kun taas aiheut­tajana toimiva kun-lause voi sijoittua joko adjunkti- tai komplementti­positioon. Lisäksi artikkelissa esitetään Suomi24-korpusaineiston perusteella, että tunne­kausatiivien luokittelu tunne- ja tuntemusverbeihin korreloi lausemaisen aiheuttaja-argumentin yleisyyden kanssa. Artikkeli on toinen osa kahden artikkelin sarjasta. Ensimmäisessä osassa esitettiin, että aiheuttajana toimiva NP asettuu rakenteessa tyypillisesti ylemmäs kuin kokija. Koska lausemainen aiheuttaja asettuu välttämättä komplementtiin ja alemmas kuin kokija, tunnekausatiivilauseen argumenttirakenne näyttää siis vaihtelevan ainakin aiheuttaja-­argumentin tyypin mukaan.   The argument structure of the Finnish experiencer construction II: An embedded clause as a causer argument This paper investigates the Finnish experiencer construction, which involves a psychological predicate and two optional arguments: the nominative causer and the partitive experiencer. The causer argument can be clausal, such as the A infinitive, the kun clause, a finite clause headed by the complementizer että, or an embedded interrogative clause. Mua    jännittää                      kertoa   tämä         sulle. (colloquial) I.par   excite.caus.pres.3sg   tell.inf   this.nom   you.to ‘I’m excited to tell you about this.’ The aim of this paper is to show within the framework of generative syntax that the A infinitive and the finite complement clause occupy the complement position in the experiencer construction, while the kun clause may occupy either the adjunct or complement position. The syntactic analysis is complemented with a corpus analysis of a corpus taken from the Suomi24 online messaging site. The comprehensive Finnish grammar divides experiencer verbs into two classes: those that express emotion and those that express sensation. The corpus analysis shows that verb type correlates with the frequency of a clausal causer. This article is the second in a series of two. The first article investigated constructions in which the causer argument was an NP. It demonstrated that the causer NP -occupies a higher position in the argument structure than the experiencer NP. In this -article, the author argues that a clausal causer occupies a lower position than the experiencer. This means that the experiencer construction has alternating argument structures for different types of causers.

Sign in / Sign up

Export Citation Format

Share Document