An Applied Study of English Sentence Fast Retrieval Algorithm Based on Choquet Expectation

In this paper, the basic structure of fuzzy integral-based multi-classifier fusion model is used as a reference to construct Choquet integral vectors, measure the similarity of English sentences, and construct a fast retrieval algorithm for English sentences based on Choquet expectation.Determine the algorithm threshold and compare the running time of similar retrieval algorithms.Deploy the algorithm into the English sentence retrieval model for dataset training and comparison experiments.Verify the model robustness and determine the chosen K value for the model.Further use the test set to compare the retrieval effectiveness of the model with the traditional semantic retrieval model.The algorithm threshold is set to 6 to improve English sentence recall.The running time consumption of the algorithm is 0.827s and 1.941s, which is lower than the other three similar retrieval algorithms.In the dataset comparison experiments, the algorithmic model of this paper scores better than the comparison model in all 5 evaluation metrics.The model has the best robustness when k takes the value of 15.The model check accuracy and check completeness are higher than the semantic retrieval model LM by nearly 8 percentage points.The fast retrieval algorithm for English sentences based on Choquet expectation can improve sentence retrieval timeliness and retrieval accuracy, and reduce retrieval energy consumption.

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-04-18
DOI
https://doi.org/10.61091/jcmcc127b-158
Primary Topic
Educational Technology and Assessment
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Applied Study of English Sentence Fast Retrieval Algorithm Based on Choquet Expectation

Journal of Combinatorial Mathematics and Combinatorial Computing
Educational Technology and Assessment
article

An Applied Study of English Sentence Fast Retrieval Algorithm Based on Choquet Expectation

article en

Abstract

In this paper, the basic structure of fuzzy integral-based multi-classifier fusion model is used as a reference to construct Choquet integral vectors, measure the similarity of English sentences, and construct a fast retrieval algorithm for English sentences based on Choquet expectation.Determine the algorithm threshold and compare the running time of similar retrieval algorithms.Deploy the algorithm into the English sentence retrieval model for dataset training and comparison experiments.Verify the model robustness and determine the chosen K value for the model.Further use the test set to compare the retrieval effectiveness of the model with the traditional semantic retrieval model.The algorithm threshold is set to 6 to improve English sentence recall.The running time consumption of the algorithm is 0.827s and 1.941s, which is lower than the other three similar retrieval algorithms.In the dataset comparison experiments, the algorithmic model of this paper scores better than the comparison model in all 5 evaluation metrics.The model has the best robustness when k takes the value of 15.The model check accuracy and check completeness are higher than the semantic retrieval model LM by nearly 8 percentage points.The fast retrieval algorithm for English sentences based on Choquet expectation can improve sentence retrieval timeliness and retrieval accuracy, and reduce retrieval energy consumption.

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 127b
Quality Education
Openalex Percentile: Top 90%
Educational Technology and Assessment
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.