An Application of Relation Algebra to Lexical Databases

Formal Concept Analysis

Old

2010

Self Cite

Abstract. This paper discusses results from an experimental study of concept neighbourhoods in WordNet and Roget's Thesaurus. The general aim of this research is to determine ways in which neighbourhood lattices can be derived in real time from a lexical database and displayed on the web. In order to be readable the lattices must not be too large, not contain overlapping concepts or labels and must be calculated within seconds. Lattices should, furthermore, not be too small and they should contain sufficient complexity to be interesting for the viewer. For these purposes the sizes of the lattices of different types of concept neighbourhoods have been calculated. Using the size information should help with the task of on-line generation of the lattices.

Section: Resultsmentioning

confidence: 95%

“…The corresponding neighbourhood lattices consist of a concept and its neighbours. Roget's Thesaurus (RT) is an example for which the extraction of concept neighbourhoods has been studied in some detail Old, 2004 and2006). An on-line interface at www.roget.org lets users explore concept neighbourhoods of Roget's Thesaurus in realtime.…”

Section: Introductionmentioning

confidence: 99%

Concept Neighbourhoods in Lexical Databases

Formal Concept Analysis

Old

2010

Self Cite

“…A horizontal decomposition of a lattice refers to the components that a lattice falls into after removing the top and bottom concept. If a plus operator is applied until the sets do not change any further, it yields a horizontal decomposition of the original lattice (Priss & Old, 2006). Horizontal decompositions have been used in software analysis (Snelting, 2005) and other applications.…”

Section: Decomposition and General Scalingmentioning

confidence: 99%

“…This is a size that can still be graphically represented. At the other extreme, considering lattices that might be too small, according to Priss & Old (2006) there are about 20,000 words for which the lattice never has more than one concept for any type of neighbourhood. But these words include archaic, foreign and specialist words and phrases, which are unlikely to be entered by users in the on-line interface.…”

Section: Data Weeding Techniques For Roget's Thesaurusmentioning

confidence: 99%

Data Weeding Techniques Applied to Roget’s Thesaurus

Lecture Notes in Computer Science

Old

2011

Self Cite

Abstract. It can be difficult to automatically generate "nice" graphical representations for concept lattices from lexical databases, such as Roget's Thesaurus, because the data sources tend to be large and complex. This paper discusses a variety of "data weeding" techniques that can be applied in order to reduce the size of a concept lattice, first in general, and then with respect to Roget's Thesaurus. The aim is that resulting lattices should display neither too much, nor too little information, independently of which search terms have been entered by a user.

“…Section 5 considers RA for the modelling of lexical databases. Previously, the use of relation algebra for the modelling of lexical databases has been described (Priss & Old, 2006). Because, lexical databases are usually quite large, it is not practical to generate the lattice of a formal context that contains all of the data of the lexical database.…”

Section: Introductionmentioning

confidence: 99%

Relation Algebra Operations on Formal Contexts

Lecture Notes in Computer Science

2009

Self Cite

Abstract. This paper discusses the use of relation algebra operations on formal contexts. These operations are a generalisation of some of the context operations that are described in the standard FCA textbook (Ganter & Wille, 1999). This paper extends previous research in this area with respect to applications and implementations. It also describes a software tool (FcaFlint) which in combination with FcaStone facilitates the application of relation algebra operations to contexts stored in many formats.