Data entry using a reduced keyboard

• US 20020021311A1
• Filed: 04/09/2001
• Published: 02/21/2002
• Est. Priority Date: 08/14/2000
• Status: Abandoned Application

• Current Assignee: Approxmatch Ltd.
• Original Assignee: Approximatch, Inc.
• Inventors: Bar-Lev, Nir, Birk, Yitzhak, Shechter, Erez
• Application Number:
  US09/827,909
• Publication Number:
  US 20020021311A1
• Time in Patent Office: Days
• US Class Current: 345/864
• CPC Class Codes: G06F 3/0237 using prediction or retrieval techniques

Abstract

An ambiguity resolver having an input for receiving a data string entered using an ambiguous keyboard, a comparator for comparing the data string to be searched against a plurality of prestored words to find at least one closest match to the data string, and an output for outputting a comparison result. An ambiguous keyboard is one in which more than one character is mapped to a single key, a particular example being a telephone keypad used for entering all the alphanumeric characters.

Claims

1. An ambiguity resolver having

an input for receiving a data string entered using an ambiguous data source,

a comparator for comparing the data string to be searched against a plurality of strings to find at least one closest match to the data string,

and an output for outputting a comparison result.

2. An ambiguity resolver according to claim 1, wherein the comparator comprises a distance assessor for assessing a distance of any of the plurality of prestored words to the data string based on a mapping of characters of the word and of the data string to keys of the ambiguous keyboard.

3. An ambiguity resolver according to claim 2, wherein the distance assessor is operable to assign a minimal distance between pairs of characters sharing a single key of the ambiguous keyboard.

4. An ambiguity resolver according to claim 1, wherein the ambiguous data source is any one of a group comprising a graphical data input, an ambiguous keyboard and a speech converter.

5. An ambiguity resolver according to claim 2, wherein the distance assessor comprises a pattern matcher operable to assess the distance based on pattern matching.

6. An ambiguity resolver according to claim 1, wherein the output is data associated with the at least one closest match.

7. An ambiguity resolver according to claim 1, wherein the output is the at least one closest match.

8. An ambiguity resolver according to claim 1, wherein the plurality of words are stored in at least one database.

9. An ambiguity resolver according to claim 1, wherein at least some of the prestored words are user-specific words.

10. An ambiguity resolver according to claim 1, wherein the input data string is a plurality of words and the output is a phrase.

11. An ambiguity resolver according to claim 4, wherein the speech convertor is a speech processor capable of converting speech into either one of a string of phonemes and text string.

12. An ambiguity resolver according to claim 1, wherein the output is connectable to the input of a further approximate search engine.

13. An ambiguity resolver according to claim 1, wherein the database comprises electronic network address information of a plurality of network users.

14. An ambiguity resolver according to claim 13, wherein the electronic network address information is any one of a group comprising

Intranet email addresses, Internet email addresses, IM addressing data, and URL data.

16. The use according to claim 15, wherein the approximate search engine comprises a distance assessor operable to assess a distance of any of a plurality of prestored words to the data string based on a mapping of characters of the word and of the data string to keys of the ambiguous keyboard.

17. The use according to claim 16, wherein the distance assessor comprises a pattern matcher for assessing the distance using pattern matching between the input data string and any one of the prestored words.

18. The use according to claim 16, wherein the plurality of words are stored in at least one database.

19. The use according to claim 16, wherein at least some of the prestored words are user-specific words.

20. The use according to claim 16, wherein the input data string is a plurality of words and wherein the approximate search engine is further operable to match phrases to the plurality of words which have been resolved.

21. The use according to claim 18, wherein the database comprises electronic network address information of a plurality of network users.

22. The use according to claim 21, wherein the electronic network address information is any one of a group comprising

Intranet email addresses, Internet email addresses, IM addressing data, telephone numbers, telephone numbers combined with other address information, and URL data.

24. An approximate search engine according to claim 23, wherein the comparator is operable to assess a distance of any of the plurality of prestored words to the data string based on a mapping of characters of the word and of the data string to keys of the ambiguous keyboard.

25. An approximate search engine according to claim 23, wherein the comparator is operable to assess the distance based on pattern matching.

26. An approximate search engine according to claim 23, wherein the output is usable to obtain data associated with the closest prestored word.

27. An approximate search engine according to claim 23, wherein the plurality of words are stored in at least one database.

28. An approximate search engine according to claim 23, wherein at least some of the prestored words are user-specific words.

29. An approximate search engine according to claim 23, wherein the input data string comprises a plurality of words and the plurality of prestored words are associated with phrases.

30. An approximate search engine according to claim 23, wherein the input data string comprises a plurality of words and the plurality of prestored words are phrases.

31. An approximate search engine according to claim 23, wherein the input is connected to the output of a speech processor operable to convert speech input into text.

32. An approximate search engine according to claim 23, wherein the database comprises electronic network address information of a plurality of network users.

33. An approximate search engine according to claim 23 wherein the electronic network address information is any one of a group comprising

Intranet email addresses, Internet email addresses, telephone numbers, telephone numbers associated with other identifying data, IM addressing data, and URL data.

34. An approximate search engine according to claim 23, wherein the plurality of prestored words is a user directory containing identification and address information of network users and which approximate search engine comprises a voice interface for interfacing with the mobile telephony device.

35. An approximate search engine according to claim 23, operable to receive query data from the mobile telephony device, disconnect from the mobile telephony device, process the query and reconnect to the mobile telephony device to send a result.

37. An approximate search engine according to claim 36, wherein the output is data associated with the at least one closest match.

38. An approximate search engine according to claim 36, wherein the output is the at least one closest match.

39. An approximate search engine according to claim 36, wherein the plurality of prestored words are stored in at least one database.

40. An approximate search engine according to claim 36, wherein at least some of the prestored words are user-specific words.

41. An approximate search engine according to claim 36, wherein the input data string comprises a plurality of words and the plurality of prestored words are associated with phrases.

42. An approximate search engine according to claim 36, wherein the input data string comprises a plurality of words and the plurality of prestored words are phrases.

43. An approximate search engine according to claim 36, wherein the input is connected to the output of a speech processor operable to convert speech input into text.

44. An approximate search engine according to claim 36, wherein the database comprises electronic network address information of a plurality of network users.

45. An approximate search engine according to claim 36 wherein the electronic network address information is any one of a group comprising

Intranet email addresses, Internet email addresses, telephone numbers, telephone numbers associated with other identification information, IM addressing data, and URL data.

46. An approximate search engine according to claim 36, further comprising a voice interface for interfacing with a telephony device.

47. An approximate search engine according to claim 36, operable to receive query data from the telephony device, disconnect from the telephony device, process the query and reconnect to the telephony device to deliver a result.

50. A method according to claim 49, wherein the approximate searching method is any one of a group comprising neural network algorithms, pattern matching, and a combination thereof.

51. A method according to claim 49, wherein the data is a word.

52. A method according to claim 49, wherein the data is a phrase.

53. A method according to claim 52, wherein the phrase is part of the lyrics of a song.

54. A method according to claim 49, wherein data input is carried out at a mobile data processing device and approximate searching is carried out remotely.

55. A method according to claim 49, wherein data input and approximate searching are carried out at a mobile data processing device.

56. A method according to claim 49, wherein the database is any one of a group comprising a dictionary of a predetermined language, a database of address information, a phrase dictionary, an index of documents, an index of websites, an index of song lyrics, an index of identification information and a graphical index of identification information.

58. An interactive television system comprising an ambiguity resolver according to claim 57, wherein the comparator comprises a distance assessor for assessing a distance of any of the plurality of prestored words to the data string based on a mapping of characters of the word and of the data string to keys of the ambiguous keyboard.

59. An interactive television system comprising an ambiguity resolver according to claim 58, wherein the distance assessor is operable to assign a minimal distance between pairs of characters sharing a single key of the ambiguous keyboard.

60. An interactive television system comprising an ambiguity resolver according to claim 57, wherein the ambiguous data source is any one of a group comprising a graphical data input, an ambiguous keyboard and a speech converter.

61. An interactive television system comprising an ambiguity resolver according to claim 58, wherein the distance assessor comprises a pattern matcher operable to assess the distance based on pattern matching.

62. An interactive television system comprising an ambiguity resolver according to claim 57, wherein the output is data associated with the at least one closest match.

63. An interactive television system comprising an ambiguity resolver according to claim 57, wherein the output is the at least one closest match.

64. An interactive television system comprising an ambiguity resolver according to claim 57, wherein the plurality of words are stored in at least one database.

65. An interactive television system comprising an ambiguity resolver according to claim 57, wherein at least some of the prestored words are user-specific words.

66. An interactive television system comprising an ambiguity resolver according to claim 57, wherein the input data string is a plurality of words and the output is a phrase.

68. A reduced keyboard according to claim 67, wherein one group comprises the numeric characters and another group comprises the alphabetic characters.

70. An automated call center according to claim 69, further comprising a speech to text engine for converting user speech into an incoming string.

15. The use of an approximate search engine on data strings entered using an ambiguous keyboard, to resolve key ambiguities of the ambiguous keyboard.

23. An approximate search engine having

an input for receiving a data string from a mobile telecommunication device,

an approximate string comparator for comparing the input data string against a plurality of prestored words to find at least one prestored word being closest to the input data string, and

an output for outputting the at least one closest prestored word.

36. An approximate search engine having

an input for receiving a data string to be searched,

a comparator for comparing the data string to be searched against a plurality of prestored words to find at least one closest match to the data string,

and an output for outputting a comparison result,

wherein the comparator comprises a pattern matcher for obtaining the at least one closest match by pattern matching.

48. A mobile data processing device having

an ambiguous keyboard for entering a number of input characters via a smaller number of input keys, wherein at least one key has a plurality of the input characters mapped thereto,

an approximate searching, engine, and

a database of expected strings,

wherein distances are predefined between input characters based on respective keys to which they are mapped, and wherein the approximate searching engine is operable to match a given input string against the expected strings to produce at least one candidate string having a minimal distance to the input string.

49. A method of entering precise data into a system via an ambiguous keyboard, comprising the steps of:

entering the data ambiguously via the ambiguous keyboard,

comparing the data against a database of likely inputs using an approximate search engine until at least one closest match is determined, and selecting the at least one closest match as precise input.

57. An interactive television system comprising

an ambiguity resolver having

an input for receiving a data string entered using an ambiguous data source,

a comparator for comparing the data string to be searched against a plurality of strings to find at least one closest match to the data string,

and an output for outputting a comparison result.

67. A reduced keyboard having a first number of input keys representing a second number of input characters wherein the second number is greater than the first number such that a plurality of characters are mapped to at least some input keys, wherein the characters are divided into groups and wherein the reduced keyboard has a mode switch for switching the input keys between each group of characters.

69. An automated call center comprising an approximate search engine and a database and wherein incoming strings serve to interrogate the database using the approximate search engine to output subscriber contact data.

71. An automated call center wherein the approximate search engine is operative to compensate for data entered via an ambiguous keyboard.

72. An electronic network address verifier comprising a database of addresses on the electronic network, a message address checker and an approximate search engine, and wherein the checker is operable to identify an address in a message for the network and to use the address to interrogate the database using the approximate search engine.

73. An electronic network address verifier according to claim 72, operable to identify closest matches to the address, and wherein, when the closest match is not an exact match, to identify the closest match as a correction.