Output details
11 - Computer Science and Informatics
University of Westminster
Output title
Text segments as constrained formal concepts
Type
E - Conference contribution
Name of conference/published proceedings
12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Timisoara, Romania, 23-26 September 2010
Volume number
-
Issue number
-
First page of article
223
ISSN of proceedings
-
Year of publication
2010
Number of additional authors
3
Additional information
<17> Originality: The paper discusses a new approach to the problem of text segmentation in natural language processing and text analytics, via the lenses of Formal Concept Analysis (FCA), a theory descending from Lattice Theory in Mathematics.
Significance: The paper proposes that FCA based text segmentation is as efficient as other related algorithms, however, with better descriptions of text and topics. This insight affected practices related with Web Governance in a London based company (TSB/KTP: 007326 grant).
Rigour: Algorithmic analysis and comparisons with related algorithms verify the stated hypothesis that FCA-based text segmentation is efficient.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
