Patent US4740479A successfully refreshed from Google Patents.
Patent US5625814A successfully refreshed from Google Patents.
US5625814A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for processing natural language with a hierarchy of mapping routines
Assignee: Apple Inc
•
Filing: 1995-05-15
•
Granted: 1997-04-29
•
Expires: 2015-05-15
Abstract
Abstract A method and apparatus for processing natural language and deducing meaning from a natural language input characterized by the steps of (a) receiving an ordered string of word objects having a natural language meaning, (b) selecting a word window length, and (c) successively moving the word window along the ordered string and analyzing the meaning of a substring of word objects that fall within the word window. The substring is removed from the ordered string if the substring has a recognized meaning, until all substrings of the ordered string that fit within the window have been analyzed. In a step (d), the word window length is reduced and step (c) is repeated until only an unrecognized residual of the ordered string remains. The meaning of the substring is analyzed by mapping the substring against a database using one or more mapping routines. The mapping routines are preferably arranged in a hierarchy, wherein a successive mapping routine is used to analyze the substring when a previous mapping routine in the hierarchy cannot map the substring. A computer-implemented task is determined from the recognized substrings and performed by the computer system. The apparatus of the present invention implements the method on a pen-based computer system, and the ordered string is preferably received from strokes entered by a stylus on a display screen of the pen-based computer or from a microphone receiving speech input.
Inventors
- 👤 William W. Luciw
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 19:45
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/451; G06F9/453; Y; Y10; Y10S; Y10S707/00; Y10S707/953; Y10S707/955; Y10S707/956; Y10S707/99931; Y10S707/99933; Y10S707/99935
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
122 words
A computer system having the ability to process natural language, the system comprising: a processor; memory for maintaining a database of task-pertinent events, said memory being coupled to said processor; an input device coupled to said processor for receiving natural language from a user; means for developing a string from said natural language coupled to said input device; means for mapping a portion of said string into said database using a plurality of different mapping routines arranged in a hierarchy, wherein a successive mapping routine in said hierarchy is used when a previous different mapping routine in said hierarchy does not map said portion of said string; and means for performing a computer-implemented task based upon said mapped portion of said string.
Claim 2
Dependent Claim
122 words
A computer system having the ability to process natural language, the system comprising: a processor; memory for maintaining a database of task-pertinent events, said memory being coupled to said processor; an input device coupled to said processor for receiving natural language from a user; means for developing a string from said natural language coupled to said input device; means for mapping a portion of said string into said database using a plurality of different mapping routines arranged in a hierarchy, wherein a successive mapping routine in said hierarchy is used when a previous different mapping routine in said hierarchy does not map said portion of said string; and means for performing a computer-implemented task based upon said mapped portion of said string.
Claim 3
Dependent Claim
20 words
A computer system as recited in claim 1 wherein said input device includes a display screen receptive to stylus input.
Claim 4
Dependent Claim
19 words
A computer system as recited in claim 1 wherein said input device includes a microphone receptive to speech input.
Claim 5
Dependent Claim
30 words
A computer system as recited in claim 1 wherein said plurality of different mapping routines includes a phrasal mapping routine, a pattern mapping routine, and a database query mapping routine.
Claim 6
Dependent Claim
21 words
A computer system as recited in claim 1 wherein said computer-implemented task includes executing an application program stored in said memory.
Claim 7
Dependent Claim
45 words
A computer system as recited in claim 1 wherein each of said successive mapping routines in said hierarchy utilizes a different process to map said portion of said string and requires more time to implement by said processor than previous mapping routines in said hierarchy.
Claim 8
Dependent Claim
53 words
A computer system as recited in claim 1 wherein said means for mapping includes a window for selecting said portion of said string mapped into said database, wherein said window has a predetermined size and is moved to select other portions of said string when said portion cannot be mapped into said database.
Claim 9
Independent Claim
228 words
A method for implementing a task input in natural language by a user into a computer system, the method comprising: developing a string including recognized word objects from input received from a user; examining a number of said word objects of said string shown in a word window according to a first mapping routine to map said number of word objects into a database, said word window having a predetermined length; examining said word objects shown in said word window according to a second mapping routine when said number of word objects of said string do not map according to said first mapping routine, said second mapping routine utilizing a different mapping process from said first mapping routine and requiring more time to implement than said first mapping routine when examining said number of word objects; examining said word objects shown in said word window according to a third mapping routine when said number of word objects of said string do not map according to said second mapping routine, said third mapping routine utilizing a different mapping process from said first mapping routine and said second mapping routine and requiring more time to implement than said second mapping routine when examining said number of word objects; and performing a task in accordance with a mapping obtained by said examination of said word objects shown in said word window.
Claim 10
Independent Claim
228 words
A method for implementing a task input in natural language by a user into a computer system, the method comprising: developing a string including recognized word objects from input received from a user; examining a number of said word objects of said string shown in a word window according to a first mapping routine to map said number of word objects into a database, said word window having a predetermined length; examining said word objects shown in said word window according to a second mapping routine when said number of word objects of said string do not map according to said first mapping routine, said second mapping routine utilizing a different mapping process from said first mapping routine and requiring more time to implement than said first mapping routine when examining said number of word objects; examining said word objects shown in said word window according to a third mapping routine when said number of word objects of said string do not map according to said second mapping routine, said third mapping routine utilizing a different mapping process from said first mapping routine and said second mapping routine and requiring more time to implement than said second mapping routine when examining said number of word objects; and performing a task in accordance with a mapping obtained by said examination of said word objects shown in said word window.
Claim 11
Dependent Claim
66 words
A method as recited in claim 8 further comprising examining different word objects of said string by moving said word window along said string when said number of word objects of said string do not map according to said third mapping routine, wherein said length of said word window is fixed such that said word window shows a predetermined number of word objects of said string.
Claim 12
Dependent Claim
31 words
A method as recited in claim 9 wherein said examining different word objects includes decreasing said length of said word window such that less words are shown in said word window.
Claim 13
Dependent Claim
20 words
A method as recited in claim 8 wherein at least one of said mapping routines is a dynamic mapping routine.
Claim 14
Dependent Claim
44 words
A method as recited in claim 8 wherein said first mapping routine is a pattern processor utilizing a phrasal look-up table, said second mapping routine is a PATTERN processor utilizing a pattern look-up table, and said third mapping routine is a database query processor.
Claim 15
Dependent Claim
31 words
A method as recited in claim 8 further comprising examining additional word objects of said string according to said mapping routines until all word objects of said string have been examined.
Claim 16
Dependent Claim
31 words
A method as recited in claim 8 wherein said third mapping routine includes a database query processor and wherein said first and second mapping routines do not include database query processors.
Claim 17
Independent Claim
83 words
A method for recognizing meanings of natural language phrases comprising: attempting to map at least a portion of an ordered string of words into a database according to a phrasal mapping routine; attempting to map said portion into a database according to a pattern mapping routine when said portion does not map according to said phrasal mapping routine; and attempting to map said portion according to a database query mapping routine when said portion does not map according to said pattern mapping routine.
Claim 18
Independent Claim
83 words
A method for recognizing meanings of natural language phrases comprising: attempting to map at least a portion of an ordered string of words into a database according to a phrasal mapping routine; attempting to map said portion into a database according to a pattern mapping routine when said portion does not map according to said phrasal mapping routine; and attempting to map said portion according to a database query mapping routine when said portion does not map according to said pattern mapping routine.
Claim 19
Dependent Claim
31 words
A method as recited in claim 15 wherein said step of attempting to map said portion according to said phrasal mapping routine includes mapping said portion into a phrasal look-up table.
Claim 20
Dependent Claim
31 words
A method as recited in claim 15 wherein said step of attempting to map said portion according to said phrasal mapping routine includes mapping said portion into a pattern look-up table.
Claim 21
Dependent Claim
36 words
A method as recited in claim 15 further comprising attempting to map remaining portions of said ordered string according to said mapping routines until all word objects of said string have been attempted to be mapped.
Claim 22
Dependent Claim
34 words
A method as recited in claim 18 wherein said remaining portions of said ordered string are attempted to be mapped using a window that is moved to show different portions of said ordered string.
Claim 23
Dependent Claim
15 words
A method as recited in claim 15 wherein said mapping routines are dynamic mapping routines.
References Cited (Backward Citations)
US4688195A
Cited
US4736296A
Cited
US4785413A
Cited
US4750122A
Cited
US5109509A
Cited
US4670848A
Cited
US4713775A
Cited
US4945504A
Cited
US4875187A
Cited
US5083268A
Cited
US5123103A
Cited
US4887212A
Cited
US4965763A
Cited
US4974191A
Cited
US4994966A
Cited
US5282265A
Cited
US4918723A
Cited
US4953106A
Cited
US5091790A
Cited
US5175814A
Cited
EP0441089A2
Cited
US5103498A
Cited
US5237502A
Cited
US5369577A
Cited
US5327342A
Cited
US5442780A
Cited
US5477451A
Cited
US5278980A
Cited
US5357431A
Cited
US5369575A
Cited
US5434777A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-04-28 | 2000-10-28 | 2001-04-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-04-28 | 2004-10-28 | 2005-04-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-04-28 | 2008-10-28 | 2009-04-29 | $7700.00 | Window Closed / Lapsed |