Ambiguous Search Query Processing on Overloaded Keyboards
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Text input on devices with small, overloaded keypads is cumbersome and inefficient for search queries due to the need for multiple keystrokes and additional disambiguation steps, especially in search applications where vocabulary-based word completion systems are not effective.
Innovation Solution
A method and system that processes ambiguous search queries by dynamically identifying matching items as each character is entered, using a many-to-many mapping from alphanumeric to numeric strings, allowing incremental retrieval of results without explicit term termination, and ordering results by relevance to reduce the number of steps needed for search queries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If vocabulary-based word completion systems are used for text input on overloaded keypads, then word completion choices are provided, but the number of steps needed to get to the result increases due to additional disambiguation steps
Solution Approach 1:
The system pre-generates multiple possible word completions and their corresponding numeric codes in advance, so that when a user enters a partial query, the system can immediately retrieve and display relevant results without requiring additional disambiguation steps. This preliminary preparation eliminates the time-consuming back-and-forth of traditional vocabulary-based completion systems.
Solution Approach 2:
The system dynamically adjusts the display of search results based on the user's input progress. As the user enters more characters, the system updates the displayed results in real-time, showing the most relevant matches without requiring the user to complete the entire query first. This dynamic approach reduces the perceived number of steps by providing immediate feedback.
2Ease of operation
If multi-press interface is used for text entry on overloaded keypads, then text can be entered, but too many key strokes are needed
Solution Approach 1:
The system allows users to enter only a partial query (fewer keystrokes than required by traditional systems) and still retrieves relevant results. By accepting incomplete input and providing multiple possible matches, the system reduces the number of required keystrokes while maintaining search effectiveness through smart result ranking and display.
Solution Approach 2:
The system introduces an intermediary processing layer that translates ambiguous partial queries into meaningful search results. Instead of requiring direct one-to-one mapping between keystrokes and complete words, the intermediary system interprets partial input and retrieves relevant results, effectively reducing the keystroke burden while maintaining search accuracy.
3Area of stationary object
If overloaded keypads are used in small devices, then device size is reduced, but text input becomes cumbersome
Solution Approach 1:
The system makes the overloaded keypad universally effective for search operations by implementing intelligent query processing that works regardless of the specific keypad layout. The system handles the complexity of overloaded keys transparently, allowing the same compact keypad to serve both space-saving and ease-of-input functions through software intelligence.
Solution Approach 2:
The system automatically disambiguates and processes queries without requiring additional user actions beyond the initial keystrokes. The intelligent processing layer self-corrects for the ambiguities introduced by overloaded keypads, eliminating the need for users to perform extra disambiguation steps and making the compact device as easy to use as larger devices with full keyboards.
Data Source
AI summary
In accordance with one or more embodiments of the invention, a method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has one or more associated descriptors. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query is a prefix substring of each of at least two words relating to the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more descriptors matching the search query as the user enters each character of the search query. The system outputs identification of the one or more items of the identified group to be displayed on the device operated by the user.