← Back to Patent Explorer
US5608624A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for processing natural language

Assignee: Apple Inc
•
Filing: 1995-05-15
•
Granted: 1997-03-04
•
Expires: 2015-05-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

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-31 09:53
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: 31
Claim 1
Independent Claim 170 words
A computer-readable medium containing program instructions for deducing meaning from a natural language input, said program instructions performing steps comprising: (a) receiving an ordered string of separate word objects of a selected language, where each of said word objects includes at least one alphanumeric character and is delimited from an adjacent word object, said ordered string having a length equal to the number of said word objects and having a natural language meaning; (b) selecting a word window length that is initially at least two and that is no greater than said length of said ordered string; (c) successively moving said word window along said ordered string, and removing a substring of word objects that fall within said word window from said ordered string when said substring has a recognized meaning, until all substrings of said ordered string that fit within said window have been analyzed; and (d) adjusting said word window length and repeating step (c) until only an unrecognized residual of word objects of said ordered string remains.
Claim 2
Dependent Claim 170 words
A computer-readable medium containing program instructions for deducing meaning from a natural language input, said program instructions performing steps comprising: (a) receiving an ordered string of separate word objects of a selected language, where each of said word objects includes at least one alphanumeric character and is delimited from an adjacent word object, said ordered string having a length equal to the number of said word objects and having a natural language meaning; (b) selecting a word window length that is initially at least two and that is no greater than said length of said ordered string; (c) successively moving said word window along said ordered string, and removing a substring of word objects that fall within said word window from said ordered string when said substring has a recognized meaning, until all substrings of said ordered string that fit within said window have been analyzed; and (d) adjusting said word window length and repeating step (c) until only an unrecognized residual of word objects of said ordered string remains.
Claim 3
Dependent Claim 38 words
A computer-readable medium as recited in claim 1 wherein said step of receiving an ordered string of word objects includes receiving said ordered string from strokes entered by a stylus on a display screen of a pen-based computer.
Claim 4
Dependent Claim 31 words
A computer-readable medium as recited in claim 1 wherein said step of receiving an ordered string of word objects includes receiving said ordered string from a microphone receiving audible speech input.
Claim 5
Dependent Claim 30 words
A computer-readable medium as recited in claim 1 wherein said step of selecting a word window length includes setting said word window length to said length of said ordered string.
Claim 6
Dependent Claim 24 words
A computer-readable medium as recited in claim 4 wherein said adjusting said word window length step reduces said word window length by one word.
Claim 7
Dependent Claim 55 words
A computer-readable medium as recited in claim 1 wherein said ordered string includes a left end and a right end, and wherein said step of successively moving said window includes moving said window from an initial position on said left end of said string to a final position at said right end of said string.
Claim 8
Dependent Claim 34 words
A computer-readable medium as recited in claim 6 wherein said step of analyzing the meaning of a substring of word objects that fall within said word window includes mapping said substring against a database.
Claim 9
Dependent Claim 49 words
A computer-readable medium as recited in claim 7 wherein said step of mapping said substring includes using a plurality of mapping routines arranged in a hierarchy, wherein a successive mapping routine is used to analyze said substring when a previous mapping routine in said hierarchy cannot map said substring.
Claim 10
Dependent Claim 30 words
A computer-readable medium as recited in claim 1 wherein said program instructions further perform a step of determining a computer-implemented task specified by said ordered string using said recognized substrings.
Claim 11
Dependent Claim 21 words
A computer-readable medium as recited in claim 9 wherein said program instructions further perform a step of performing said computer-implemented task.
Claim 12
Dependent Claim 167 words
A computer apparatus with natural language recognition capabilities comprising: a digital processor; read/write memory coupled to said digital processor; an input device coupled to said digital processor, said input device being receptive to an ordered string of separate word objects, where each of said word objects is delimited from an adjacent word object, said ordered string having a length equal to the number of said word objects and having a natural language meaning; means for selecting a word window length that is initially at least two and that is no greater than said length of said ordered string; and means for (a) successively moving said word window along said ordered string, analyzing the meaning of a sub-string of word objects that fall within said word window, removing said substring from said ordered string if said sub-string has a recognized meaning, until all sub-strings of said ordered string that fit within said window have been analyzed, (b) adjusting said word window length and (c) repeating (a) and (b).
Claim 13
Dependent Claim 167 words
A computer apparatus with natural language recognition capabilities comprising: a digital processor; read/write memory coupled to said digital processor; an input device coupled to said digital processor, said input device being receptive to an ordered string of separate word objects, where each of said word objects is delimited from an adjacent word object, said ordered string having a length equal to the number of said word objects and having a natural language meaning; means for selecting a word window length that is initially at least two and that is no greater than said length of said ordered string; and means for (a) successively moving said word window along said ordered string, analyzing the meaning of a sub-string of word objects that fall within said word window, removing said substring from said ordered string if said sub-string has a recognized meaning, until all sub-strings of said ordered string that fit within said window have been analyzed, (b) adjusting said word window length and (c) repeating (a) and (b).
Claim 14
Dependent Claim 54 words
A computer apparatus with natural language recognition capabilities as recited in claim 11 wherein said input device comprises a stylus and a tablet of a pen-computer system, wherein said ordered string of word objects having a natural language meaning is entered into said computer apparatus by the engagement of said stylus with said tablet.
Claim 15
Dependent Claim 49 words
A computer apparatus with natural language recognition capabilities as recited in claim 11 wherein said input device comprises a microphone, wherein said ordered string of word objects having a natural language meaning is entered into said computer apparatus by the conversion of sound received by said microphone into words.
Claim 16
Dependent Claim 29 words
A computer apparatus with natural language capabilities as recited in claim 11 further comprising a word recognizer for recognizing the meaning of word objects entered by said input device.
Claim 17
Dependent Claim 27 words
A computer apparatus with natural language capabilities as recited in claim 11 further comprising a substring recognizer for recognizing the meaning of substrings of said ordered string.
Claim 18
Dependent Claim 23 words
A computer apparatus with natural language capabilities as recited in claim 15 wherein said substring recognizer comprises a plurality of hierarchically arranged recognizers.
Claim 19
Dependent Claim 123 words
A computer-readable medium containing program instructions for processing natural language input into a computer system by a user, the program instructions performing steps comprising: (a) developing a string of separate recognized words from a natural language user input, where each word is delimited from an adjacent word; (b) selecting a substring word length that is greater than one but no greater than a total number of recognized words of said string: (c) mapping a substring of said string of said substring word length into a database using a mapping routine; (d) decreasing said substring word length when said mapping routine does not map said substring; and (e) repeating step (c) and step d until said mapping routine is able to map said substring.
Claim 20
Dependent Claim 123 words
A computer-readable medium containing program instructions for processing natural language input into a computer system by a user, the program instructions performing steps comprising: (a) developing a string of separate recognized words from a natural language user input, where each word is delimited from an adjacent word; (b) selecting a substring word length that is greater than one but no greater than a total number of recognized words of said string: (c) mapping a substring of said string of said substring word length into a database using a mapping routine; (d) decreasing said substring word length when said mapping routine does not map said substring; and (e) repeating step (c) and step d until said mapping routine is able to map said substring.
Claim 21
Dependent Claim 35 words
A computer-readable medium as recited in claim 17 wherein said step of developing a string includes developing a string from natural language inputted as strokes by a stylus on a display screen of a computer.
Claim 22
Dependent Claim 29 words
A computer-readable medium as recited in claim 17 wherein said step of developing a string includes developing a string from natural language inputted as audible speech into a microphone.
Claim 23
Dependent Claim 72 words
A computer-readable medium as recited in claim 17 further comprising the steps of: examining a different substring including at least one different word object when said mapping routine does not map said substring; and mapping said different substring into a database using said mapping routine, wherein said steps of examining a different substring and mapping said different substring are accomplished before said step of decreasing said number of words in said substring.
Claim 24
Dependent Claim 28 words
A computer-readable medium as recited in claim 20 wherein said step of decreasing said number of words includes decreasing said number of words in said substring by one.
Claim 25
Dependent Claim 17 words
A computer-readable medium as recited in claim 20 wherein said mapping routine is a dynamic mapping routine.
Claim 26
Dependent Claim 21 words
A computer-readable medium as recited in claim 22 wherein said mapping routine includes a pattern processor utilizing a pattern look-up table.
Claim 27
Dependent Claim 17 words
A computer-readable medium as recited in claim 22 wherein said mapping routine includes a database query processor.
Claim 28
Dependent Claim 21 words
A computer-readable medium as recited in claim 20 wherein said mapping routine includes a phrasal processor utilizing a phrasal look-up table.
Claim 29
Dependent Claim 48 words
A computer-readable medium as recited in claim 17 wherein said mapping routine is a first mapping routine, and said method further comprises a step of developing a mapping of said substring into a database using a second mapping routine when said first mapping routine cannot map said substring.
Claim 30
Dependent Claim 21 words
A computer-readable medium as recited in claim 17 wherein said program instructions further perform a computer-implemented task based upon said mapping.
Claim 31
Dependent Claim 32 words
A computer-readable medium as recited in claim 27 wherein said step of performing a computer-implemented task includes mapping said mapped substring to a task template to determine how to implement said task.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-03-03 2000-09-02 2001-03-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-03-03 2004-09-02 2005-03-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-03-03 2008-09-02 2009-03-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag