Hierarchy in Natural and Social Sciences 2006
DOI: 10.1007/1-4020-4127-6_6
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchy in Lexical Organisation of Natural Languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0
2

Year Published

2010
2010
2020
2020

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 16 publications
0
11
0
2
Order By: Relevance
“…The attracting and repelling forces of each edge are typically modelled using the physical forces of Maxwell's equations of electromagnetic fields or Hooke's Law of springs [92]. Network representations of related words have been demonstrated by connecting words (nodes) by their synonymic and antonymic (edges) relationships [97,98].…”
Section: Methodsmentioning
confidence: 99%
“…The attracting and repelling forces of each edge are typically modelled using the physical forces of Maxwell's equations of electromagnetic fields or Hooke's Law of springs [92]. Network representations of related words have been demonstrated by connecting words (nodes) by their synonymic and antonymic (edges) relationships [97,98].…”
Section: Methodsmentioning
confidence: 99%
“…Properties of lexical small-worlds have been extensively studies by B. Gaume (Gaume 2004, Gaume et al 2006, Gaume 2008, who has demonstrated that it was possible to use their formal properties to identify in them semantic spaces and, to put it in more general terms, to organise the seemingly disorganised lexical knowledge (see section 2.2.2 below).…”
Section: P4mentioning
confidence: 99%
“…Random Walks-Based Models: Random walks are efficient methods for computing similarity between vertices of a graph (see for example Gaume et al, 2005;Gaume and Mathieu, 2008). Graphs can be built from various data sources: they may model a lexical network into which vertices represent lexemes and edges correspond to semantic relations.…”
Section: Cross-lingual Enrichment Of Semantic Resourcesmentioning
confidence: 99%
“…We test various similarity measures, all based on short fixed length random walks. Such approaches are introduced in (Gaume et al, 2005;Gaume and Mathieu, 2008) for measuring topological resemblance in graphs. This kind of methods has also been applied to lexical networks in (Hughes and Ramage, 2007) to compute semantic relatedness.…”
Section: Random Walk-based Similarity Computationmentioning
confidence: 99%