Beyond the Failure of Direct-Matching in Keyword Evaluation: A Sketch of a Graph Based Solution
The starting point of this paper is the observation that methods based on the direct match of keywords are inadequate because they do not consider the cognitive ability of concept formation and abstraction. We argue that keyword evaluation needs to be based on a semantic model of language capturing...
Main Authors: | Max Kölbl, Yuki Kyogoku, J. Nathanael Philipp, Michael Richter, Clements Rietdorf, Tariq Yousef |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2022-03-01
|
Series: | Frontiers in Artificial Intelligence |
Subjects: | |
Online Access: | https://www.frontiersin.org/articles/10.3389/frai.2022.801564/full |
Similar Items
-
The Keyword Bank as a tool for finding exclusive keywords in WordSmith Tools
by: Tony Berber Sardinha
Published: (2008-12-01) -
Tensor Affinity Learning for Hyperorder Graph Matching
by: Zhongyang Wang, et al.
Published: (2022-10-01) -
On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number
by: Xiaoling Sun, et al.
Published: (2021-06-01) -
An Efficient Search Method Using Features to Match Joint Keywords on Encrypted Cloud Data
by: Lingbing Tao, et al.
Published: (2022-01-01) -
The Influence of Reference Corpus Size on Wordsmith Tools Keywords Extraction
by: Tony Berber Sardinha
Published: (2012-05-01)