File List Sorting by Keyword Similarity and Multi-Dimensional Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current electronic file listing techniques sort files based on a single keyword, leading to poor relativity between adjacent files, making it difficult for users to find specific files, especially in large collections, as they do not account for similarity in string-type keywords or allow for combined sorting across multiple criteria.
Innovation Solution
A method and system that determine a string-type keyword and a similarity value to group and sort electronic files based on similarity degrees, allowing for inter-group and intra-group sorting, enabling more accurate and relevant file organization by analyzing and removing irrelevant characters from keyword information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If electronic files are sorted based on a single keyword in conventional order, then the sorting process is simple and fast, but the relativity between adjacent files is poor and users cannot accurately find specific files
Solution Approach 1:
The patent segments the sorting process into multiple independent sorting dimensions (e.g., sender, subject, time, size) that can be combined in various ways. Each dimension can be sorted separately and then combined through Cartesian product, allowing precise file location while maintaining manageable system complexity through modular design
Solution Approach 2:
The patent introduces multiple sorting dimensions beyond the conventional single keyword approach. By adding dimensions such as sender, subject, time, and size as independent sorting criteria, the system transforms one-dimensional sorting into multi-dimensional sorting, significantly improving file search accuracy without requiring complex reevaluation of each file
2Measurement precision
If string-type keywords are sorted based on the whole string from the beginning, then the sorting implementation is simple, but irrelevant characters at the head of the string prevent accurate grouping of related files
Solution Approach 1:
The patent extracts and removes irrelevant prefix characters (such as 'Re:', 'Fwd:', 'Forward:') from the beginning of string-type keywords before sorting. By taking out these unnecessary characters, the sorting algorithm can focus on the essential content of the keyword, improving precision in grouping related files while maintaining relatively simple implementation through string processing
Solution Approach 2:
The patent applies different processing rules to different parts of the keyword string. Specifically, it treats the beginning of the string (where irrelevant characters usually appear) differently from the rest of the string. By applying local quality differentiation, the system improves sorting precision for the critical part (the meaningful keyword content) without requiring complete redesign of the sorting mechanism
3Adaptability or versatility
If only single keyword sorting is allowed, then the user interface is simple and operation is easy, but users cannot perform combined sorting according to multiple criteria to accurately find files
Solution Approach 1:
The patent implements a universal sorting mechanism that can handle multiple sorting criteria simultaneously. The system allows users to specify any combination of sorting dimensions (sender, subject, time, size, etc.) and automatically performs multi-keyword sorting by combining the results of individual sorting operations through Cartesian product, providing versatile functionality while maintaining ease of use through standardized interface
Solution Approach 2:
The patent performs preliminary sorting actions for each individual keyword criterion before combining them. By pre-sorting files according to each criterion separately and then combining the results, the system achieves complex multi-criteria sorting without requiring real-time complex calculations, thereby maintaining ease of operation while providing flexible adaptability
Data Source
AI summary
An embodiment of the present invention provides a method and system for displaying and processing an electronic file list. The method includes: determining a keyword used for sorting in the electronic file list, retrieving keyword information of each electronic file in the electronic file list; and displaying the electronic file list in which electronic files are sorted.