로그인시 본인확인과정이 필요할 수 있습니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기
| 국가/구분 | United States(US) Patent 등록 |
|---|---|
| 국제특허분류(IPC7판) |
|
| 출원번호 | US-0854690 (2013-04-01) |
| 등록번호 | US-9177081 (2015-11-03) |
| 발명자 / 주소 |
|
| 출원인 / 주소 |
|
| 대리인 / 주소 |
|
| 인용정보 | 피인용 횟수 : 0 인용 특허 : 746 |
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
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.
1. A user-interface method for searching a relatively large set of content items in response to unresolved keystroke entry by a user from a keypad with overloaded keys in which a given key is in fixed association with a plurality of alphabetical and numerical symbols and the entry has relatively few
1. A user-interface method for searching a relatively large set of content items in response to unresolved keystroke entry by a user from a keypad with overloaded keys in which a given key is in fixed association with a plurality of alphabetical and numerical symbols and the entry has relatively few keystrokes so that a subset of targeted content item results is quickly presented, the method comprising: using an ordering criteria to rank and associate subsets of content items with corresponding strings of one or more unresolved keystrokes for overloaded keys so that the subsets of content items are directly mapped to the corresponding strings of unresolved keystrokes;subsequent to ranking and associating the content items with strings of unresolved keystrokes, receiving a first unresolved keystroke from a user, wherein one of the plurality of alphabetical and numerical symbols in fixed association with the first unresolved keystroke is a symbol the user is using to search for desired content items;selecting and presenting the subset of content items that is associated with the first unresolved keystroke based on the direct mapping of unresolved keystrokes to the subsets of content items;subsequent to receiving the first unresolved keystroke, receiving subsequent unresolved keystrokes from the user and forming a string of unresolved keystrokes including the first unresolved keystroke and the subsequent unresolved keystrokes in the order received; andselecting and presenting the subset of content items that is associated with the string of unresolved keystrokes received based on the direct mapping of unresolved keystrokes to the subsets of content items.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.