US6202064B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Linguistic search system
Assignee: Xerox Corp
•
Filing: 1998-06-18
•
Granted: 2001-03-13
•
Expires: 2018-06-18
Abstract
Abstract A method of searching for information in a text database, comprising: receiving (s1) at least one user input, the user input(s) defining a natural language expression, converting (s2, s3) the natural language expression to a tagged form ( 50, 51 ) including part-of-speech tags, applying (s4) to the tagged form ( 51 ) one or more grammar rules of the language of the natural language expression ( 49 ), to derive a regular expression ( 52 ), and analyzing (s5) the text database to determine whether there is a match between said regular expression ( 52 ) and a portion of said text database. An apparatus for carrying out this techniques is also disclosed. Users may find portions of a text which match multiword expressions given by the user. Matches include possible variations that are relevant with the initial criteria from a linguistic point of view including simple inflections like plural/singular, masculine/feminine or conjugated verbs and even more complex variations like the insertion of additional adjectives, adverbs, etc. in between the words specified by the user.
Inventors
- 👤 Laurent Julliard
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 10:41
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/30; G06F16/33; G06F16/3331; G06F16/334; G06F16/3344; G06F16/3332; G06F16/3334; G06F16/3335; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99933; Y10S707/99934; Y10S707/99935
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
142 words
A method of searching for information in a text database, comprising: (a) receiving at least one user input, the at least one user input being a natural language expression including at least one word; (b) converting the natural language expression to a tagged form of the natural language expression, the tagged form of the natural language expression including the at least one word and a part-of-speech tag associated with each word of the natural language expression; (c) applying to the tagged form of the natural language expression one or more grammar rules of a language of the natural language expression, to derive a regular expression based on the at least one word and the part of speech tag; and (d) analyzing a text database to determine whether there is a match between said regular expression and a portion of said text database.
Claim 2
Independent Claim
142 words
A method of searching for information in a text database, comprising: (a) receiving at least one user input, the at least one user input being a natural language expression including at least one word; (b) converting the natural language expression to a tagged form of the natural language expression, the tagged form of the natural language expression including the at least one word and a part-of-speech tag associated with each word of the natural language expression; (c) applying to the tagged form of the natural language expression one or more grammar rules of a language of the natural language expression, to derive a regular expression based on the at least one word and the part of speech tag; and (d) analyzing a text database to determine whether there is a match between said regular expression and a portion of said text database.
Claim 3
Dependent Claim
62 words
The method of claim 1 , wherein converting the natural language expression to the tagged form of the natural language expression comprises tagging the natural language expression comprising, for each word in said natural language expression: converting that word to a root form; and p 1 applying the part-of-speech tag to the root form of that word to generate a complex form.
Claim 4
Dependent Claim
55 words
The method of claim 2 , wherein the part-of speech tag includes a syntactic category marker and a morphological feature marker, and converting the natural language expression to the tagged form of the natural language expression further comprises simplifying said complex tagged form by removing each morphological feature marker to generate a simplified tagged form.
Claim 5
Dependent Claim
26 words
The method of claim 1 , 2 or 3 , further including determining the location within said text database of the match with said regular expression.
Claim 6
Dependent Claim
162 words
A programmable data processing apparatus, the apparatus including a program storage device operatively connected to a user interface for performing a method of searching, said method comprising: (a) receiving at least one user input, the at least one user input being a natural language expression including at least one word; (b) converting the natural language expression to a tagged form of the natural language expression, the tagged form of the natural language expression including the at least one word and a part of speech tag associated with each word of the at least natural language expression; (c) applying to the tagged form of the natural language expression one or more grammar rules of a language of the natural language expression to derive a regular expression based on the at least one word and the part of speech tag; and (d) analyzing a text database to determine whether there is a match between said regular expression and a portion of said text database.
Claim 7
Dependent Claim
162 words
A programmable data processing apparatus, the apparatus including a program storage device operatively connected to a user interface for performing a method of searching, said method comprising: (a) receiving at least one user input, the at least one user input being a natural language expression including at least one word; (b) converting the natural language expression to a tagged form of the natural language expression, the tagged form of the natural language expression including the at least one word and a part of speech tag associated with each word of the at least natural language expression; (c) applying to the tagged form of the natural language expression one or more grammar rules of a language of the natural language expression to derive a regular expression based on the at least one word and the part of speech tag; and (d) analyzing a text database to determine whether there is a match between said regular expression and a portion of said text database.
References Cited (Backward Citations)
US4688195A
Cited
US4674066A
Cited
EP0268367A2
Cited
US5418716A
Cited
US5559693A
Cited
EP0522591A2
Cited
US5278980A
Cited
US5625554A
Cited
EP0597630A1
Cited
US5715468A
Cited
US5717913A
Cited
US5794050A
Cited
US5995922A
Cited
US5937422A
Cited
US5999664A
Cited
US5983221A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-03-12 | 2004-09-11 | 2005-03-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-03-12 | 2008-09-11 | 2009-03-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-03-12 | 2012-09-11 | 2013-03-13 | $7700.00 | Window Closed / Lapsed |