mlsanityData to 7 Oct 2026

Reducing Formal Context Extraction: A Newly Proposed Framework from Big Corpora

arXiv 2504.06285 ↗First posted 1 Apr 2025cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Automating the extraction of concept hierarchies from free text is advantageous because manual generation is frequently labor- and resource-intensive. Free result, the whole procedure for concept hierarchy learning from free text entails several phases, including sentence-level text processing, sentence splitting, and tokenization. Lemmatization is after formal context analysis (FCA) to derive the pairings. Nevertheless, there could be a few uninteresting and incorrect pairings in the formal context. It may take a while to generate formal context; thus, size reduction formal context is necessary to weed out irrelevant and incorrect pairings to extract the concept lattice and hierarchies more quickly. This study aims to propose a framework for reducing formal context in extracting concept hierarchies from free text to reduce the ambiguity of the formal context. We achieve this by reducing the size of the formal context using a hybrid of a WordNet-based method and a frequency-based technique. Using 385 samples from the Wikipedia corpus and the suggested framework, tests are carried out to examine the reduced size of formal context, leading to concept lattice and concept hierarchy. With the help of concept lattice-invariants, the generated formal context lattice is compared to the normal one. In contrast to basic ones, the homomorphic between the resultant lattices retains up to 98% of the quality of the generating concept hierarchies, and the reduced concept lattice receives the structural connection of the standard one. Additionally, the new framework is compared to five baseline techniques to calculate the running time on random datasets with various densities. The findings demonstrate that, in various fill ratios, hybrid approaches of the proposed method outperform other indicated competing strategies in concept lattice performance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 44 references that are in the map. First posted on arXiv 1 Apr 2025.

Builds on

9 of 44 references.

References · 9

  1. 2020CSCF: a chaotic sine cosine firefly Algorithm for practical application problemscited by 7
  2. 2021An Optimized Framework to Adopt Computer Laboratory Administrations for Operating System and Application Installationscited by 5
  3. 2021Evaluating e-Government Services in Kurdistan Institution for Strategic Studies and Scientific Research Using the EGOVSAT Modelcited by 5
  4. 2021A New Framework to Adopt Multidimensional Databases for Organizational Information System Strategiescited by 5
  5. 2021Towards Semantic Web: Challenges and Needscited by 4
  6. 2021Formal context reduction in deriving concept hierarchies from corpora using adaptive evolutionary clustering algorithm starcited by 4
  7. 2021Artificial Intelligence Algorithms for Natural Language Processing and the Semantic Web Ontology Learningcited by 3
  8. 2023Neural Lattice Reduction: A Self-Supervised Geometric Deep Learning Approachcited by 3
  9. 2023Ontology Learning Using Formal Concept Analysis and WordNetcited by 3

Built on by

Not cited yet.