Identifying the Focus Word in Natural Language Questions Based on Association Rules.
Saved in:
| Title: | Identifying the Focus Word in Natural Language Questions Based on Association Rules. |
|---|---|
| Authors: | Hu, Xin1 (AUTHOR), Ren, Xiaofeng1 (AUTHOR), Zheng, Jian2 (AUTHOR), Duan, Jiangli1 (AUTHOR) duanjl@yznu.edu.cn, Zhang, Sulan1 (AUTHOR), Murray, Richard (AUTHOR) rmurray@wiley.com |
| Source: | International Journal of Intelligent Systems. 5/9/2026, Vol. 2026, p1-13. 13p. |
| Subjects: | Association rule mining, Indexes, Natural language processing, Question answering systems |
| Abstract: | Knowledge base‐based intelligent question‐answering systems have insufficient understanding of the questions. In the early stages of research, it is effective in most cases that the existing natural language question‐understanding methods can answer questions by connecting entities and relationships when ignoring the identification of focus words. However, as research deepens, ignoring focus words has become a shortcoming. To address this, we propose identifying focus words, enabling more precise understanding of user focus. We define focus itemset, frequent focus itemset, focus association rule, and strong focus association rule to express focus‐related information better. Given the unique nature of focus association rules, we propose a prefix tree structure and an algorithm for mining association rules aimed at identifying focus words. We also introduce an inverted index specifically designed for focus association rules and propose an efficient algorithm for identifying focus words based on this index. Experiments verify the effectiveness of our algorithm and the efficiency of the inverted index, with a focus word identification rate exceeding 90%. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Intelligent Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Knowledge base‐based intelligent question‐answering systems have insufficient understanding of the questions. In the early stages of research, it is effective in most cases that the existing natural language question‐understanding methods can answer questions by connecting entities and relationships when ignoring the identification of focus words. However, as research deepens, ignoring focus words has become a shortcoming. To address this, we propose identifying focus words, enabling more precise understanding of user focus. We define focus itemset, frequent focus itemset, focus association rule, and strong focus association rule to express focus‐related information better. Given the unique nature of focus association rules, we propose a prefix tree structure and an algorithm for mining association rules aimed at identifying focus words. We also introduce an inverted index specifically designed for focus association rules and propose an efficient algorithm for identifying focus words based on this index. Experiments verify the effectiveness of our algorithm and the efficiency of the inverted index, with a focus word identification rate exceeding 90%. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 08848173 |
| DOI: | 10.1155/int/4126368 |
