Instead of NOT, you could also use the minus symbol followed by your … f) providing parenthesis grouping operator symbols; and. We’re here to teach you some of the … Patents. Each expression is a string of symbols and the plus sign designates string concatenation. I recommend a simple step-by-step process that you can use on any technology even if you are not a subject matter expert in the field. Patent Buddy offers a free search of patents, inventors and current patent owners. Fees and payment. Graphical user interface for building Boolean queries and viewing search results Number of patents in Portfolio can not be more than 2000 United States of America Patent. Defines any character not in the user specified set. Grep expressions can be concatenated to form new meaningful expressions whose match is the concatenation of the respective matches—an intuitive result. The PowerFind Pro engine, implemented in Nisus Writer, is an extension of the Unix GREP and includes only one boolean operator: the “OR.” The “AND’ operator can however be simulated by using the “OR” and the other features of PowerFind or PowerFind Pro. . Menu Search Our Apps . Canadian Patents Database / Basic Search Bilingual searches are now possible. This database lets you access 152 years of patent descriptions and images. Patentveröffentlichungen suchen, Patentdokumente maschinell übersetzen lassen, den Fortschritt von neuen Technologien verfolgen, Lösungen für technische Aufgaben finden, die Entwicklungen Ihrer Mitbewerber beobachten. Classification Explorer. If the parentheses sum is non-zero when the scan completes, likewise report an unmatched parenthesis error. For example, when searching for “Nisus Software” the string in quotes is the literal Search Pattern. Searchers have mentioned that the server can be slow and that occasionally patents or pages are missing from the database. Mixed expressions have to be parsed twice: once by the Regular Expression Parser the second time by the Boolean parser. You can then apply the search to all the competitors in the market and create powerful visualizations of the competitive landscape depending on what your search platform supports. Patent Search and Analysis. When searching for any one of a number of Search Patterns defined by such a list, it is possible to optimize the search engine in the following way. There are two useful meanings of AND, for which we shall use two different words. As can be seen the Matched Text for any Search Pattern other than an exact literal one, depends on the found instance. See Patent Center Known Issues for more information. For example, a set of key descriptive words, called categories, can be used to describe a database of textual information. In that case it is relatively easy to create a more optimal search pattern by combining those Search Patterns which have a significant portion of their sub-patterns in common. AB Assignors: CHIDDICK, KELVIN S., FORMOLO, JOSEPH F., SHUTE, BRUCE W. Information retrieval; Database structures therefor; File system structures therefor, Details of database functions independent of the retrieved data types, Query processing by using string matching techniques, GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS, TECHNICAL SUBJECTS COVERED BY FORMER USPC, TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS, Data processing: database and file management or data structures, Query formulation, input preparation, or translation, International Business Machines Corporation. The art of the search is to decide which terms to require by using the Boolean AND, and which terms to make optional by using the Boolean OR so that your massive OR’d query returns the best results at the top of your search results. Contact Us. Looking for a smarter way to search, analyse and collaborate on worldwide innovation data? Any “white” or blank space. The search engine then scans the text database. A paragraph ends on a Return (or new paragraph character) or the end of text and begins after a return or at beginning of text. This expression comprises extended GREP expressions possibly joined with binary boolean operators, possibly modified by the unary operator, and possibly including parentheses which may be Reference Parentheses or Non-Reference. Owners (US) Document Types. Justia Patents Particular Algorithmic Function Encoding US Patent for Converting a boolean masked value to an arithmetically masked value for cryptographic operations Patent (Patent # 10,871,947) Converting a boolean masked value to an arithmetically masked value for cryptographic operations . Erste Schritte; … Shorthand: :E, (xxi) New ¶ The new paragraph character. Use the Boolean OR, particularly with a large set of terms that are likely found, but not necessarily found in every relevant document. As you probably know, there are three common Boolean operators you use when patent searching:  AND, OR and NOT. Boolean to Extended GREP Conversion Table Abstract: In the field of computer text search engines, regular expression text pattern matching is combined with an extended set of Boolean operators. Expressions are evaluated, as usual, from the innermost to the outermost parentheses, and from left to right. Let me prove it to you…. When searching for specific numbers in the Patent Number field, utility patent numbers are entered as one to eight numbers in length, excluding commas … People might use different words to say the same thing. It was developed in the 1850’s, so what could possibly be new? B An example of a text pattern matching engine, implemented as part of a Macintosh word processor, is the PowerFind™ and PowerFind Pro features within the Nisus Writer word processor for the Macintosh, first published as a software product in January of 1989 under the U. S. registered trade name “Nisus” and in more recent versions re-named “Nisus Writer.”. Boolean text search combined with extended regular expression search, Application filed by Kelsan Technologies Corp, Westinghouse Air Brake Co. If you do not select a specific field, the text of the entire patent will be searched. (b) If any Binary or Unary Boolean operator is immediately followed by a closing parenthesis, or ends an expression, report an error. :(A Or B:) :(B%{! However, using Google rather than a job board will return search results not only for candidate profiles, but also for articles, webpages, and reports. FIGS. The operator NOT on its own is a Unary Operator and negates the presence of the Search Pattern that follows it. However, in general, the user should be given the chance to choose to either include all such hybrid patterns or exclude them. This would limit the search results to only those documents containing the two keywords. They are not to be confused with the literal meanings of the characters. Patents can be searched by number, simple text search, Boolean text search in one or two patent fields or advanced text search in any searchable field. AND always narrows your search. Shorthand: {n,m,s}, (xxxix)( The left opening Reference Creating parenthesis. Such a feature is not currently available with search engines on the Internet, though it is available, for example, in a search tool for Eudora Email called “PowerSleuth” distributed by Nisus Software Inc. Other possible extensions of search features include a complete text-pattern description language, allowing users to describe the text pattern without the need to know the specific text. In addition, the invention adds several more boolean search features (such as the user definable NEAR, the FOLLOWED BY, and the NOT FOLLOWED BY binary operators) and extends further some of the already extended Regular Expression features from PowerFind Pro of Nisus Writer. When the resulting ERE is passed to the ERE parser, that distinction is maintained by that parser. Of course, you’ll likely get well over a million documents that contain at least one of the terms in your big OR’ed query, BUT the search engine’s relevancy algorithm will return the best matches first. A single light source is divided into a matrix of light beams using b ... United States Patent 5251052 ... Field of Search: 359/107, 359/108, 385/16, 385/122, 250/214LS, 377/102, 364/256.4, 364/822 For example, we may want to search for documents or web pages of a particular company containing a phone number or a street address without knowing either, or precisely because we do not know them. Additional optimizations are described when users need to search for any one of a list of text patterns. Find exemplary examples of a dozen or more patents in the technological field you are researching. }:) Such a set of boolean operator features gives the user greater control of the text being searched. to form a meaningful boolean expression, except by using one of the binary logical operators, such as either OR or AND, between them. In applications, each of these symbols can be made a distinctive symbol so as not to be confused by the user from any similar characters which are meant to be search literally. (xx) European Includes all special characters and characters with diacriticals. Several different ways to speed-up searching can be devised. where the period “.” stands for any character except the return character (or the return-linefeed combination on Windows systems or the line-feed character on the Unix systems); the “\r” stands for the return character (or its equivalents on the different systems); the plus “+” following the period means any sequence of one or more such characters; the parentheses do not change the Search Pattern, but create a reference to the text, which is matched by the sequence of characters at the beginning of a paragraph. ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHUTE, BRUCE W.;FORMOLO, JOSEPH F.;CHIDDICK, KELVIN S.;REEL/FRAME:010466/0860;SIGNING DATES FROM 19991124 TO 19991213, Owner name: The extended Regular Expressions, a part of the current invention, allow for a Search Pattern description that is as specific or as broad as the user wishes. ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHUTE, BRUCE W.;FORMOLO, JOSEPH F.;CHIDDICK, KELVIN S.;REEL/FRAME:010466/0860;SIGNING DATES FROM 19991124 TO 19991213, WESTINGHOUSE AIR BRAKE COMPANY, PENNSYLVANIA, PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362, System and method for detecting dirty data fields, Apparatus and method for pattern matching in text based protocol, Method for providing a best guess for an intended recipient of a message, Automated World Wide Web navigation and content extraction, Apparatus and method for simulating a trunk gateway in a telecommunications switch test system, Method and apparatus for conditional search operators, Rule generation system adapted for an insurance claim processing system, Page navigation generation system for a customizable application, Container generation system for a customizable application, Keyword expression language for online search and advertising, Conversational question generation system adapted for an insurance claim processing system, Method for performing full-text-based logic operation using hash, Process for producing a molded solid molybdenum disulfide lubricant member, Repeat actuation arrangement for typewriters, Power controlling apparatus using friction material, Apparatus for lubricating railroad vehicle wheel flanges, Intelligent on-board rail lubrication system for curved and tangent track, Solid lubricant with high and positive friction characteristic, Brake element comprising linings secured to backing plates, On-board lubrication system for direct application to curved and tangent railroad track, Automated world wide web navigation and content extraction, The stringdist package for approximate string matching, System and method for hybrid text mining for finding abbreviations and their definitions, System and method for portable document indexing using n-gram word decomposition, Document file group organizing apparatus and method thereof, Very-large-scale automatic categorizer for web content, Apparatus for automatically generating index, Method and system for enhanced data searching, Auto-index method for electronic document files and recording medium utilizing a word/phrase analytical program, Method and apparatus for using label references in spreadsheet formulas, Blinking annotation callouts to highlight cross-language search results, Document alignment systems for legacy document conversions, Search system and method for retrieval of data, and the use thereof in a search engine, System and method for text segmentation and display, Using text search engine for parametric search, Enabling faster full-text searching using a structured data store, Method and apparatus for retrieving text using document signatures, System for categorizing character strings using acceptability and category information contained in ending substrings, Machine translation system, method and program, Content search in complex language, such as Japanese, Method and apparatus for improved tokenization of natural language text, Method and system for searching and for presenting the search results in an attribute that corresponds to the retrieved documents, Lapse for failure to pay maintenance fees, Information on status: patent discontinuation, Expired due to failure to pay maintenance fee. This will enable you to use more terms in your search query and will provide you with a longer list of results. The … Patent Board, consisting of Secretary of State, Secretary of War, and Attorney General, established by the Patent Act of 1790 (1 … Now, I know it may sound like an unexciting topic if you are an experienced patent searcher, but in the following context, it may just blow you away, and possibly change the way you approach your job. AB i) searching for a match to the first sub-expression, noting where within said text data said second sub-expression is also matched; ii) if on completing said search, said target does not contain a match to both said sub-expressions, returning the result of the match to said first sub-expression alone; iii) if on completing said search, there is at least one match to both said sub-expressions, returning the match result to said both sub-expressions. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). If the user chooses to exclude the hybrid matches that are not explicitly in the list (refer to these as the “introduced hybrids”) the search engine would still use the more optimal search pattern but after finding a match, would double check if the match was included in the original list. All parentheses have the usual functionality of grouping the parenthesized Search Patterns into units, and of determining the precedence of the Boolean Operators in a Boolean Search Pattern. It matches any text pattern which is NOT the pattern designated by . d) forming a number of different Boolean RE search patterns for a corresponding plurality of different searches; and. A Boolean search lets you search for multiple keywords in the same document, even if those keywords don't occur together. Just remember, that’s why we patent searchers get paid the big bucks . Patents from 1790 through 1975 are searchable only by Issue Date, Patent Number, and … It is important to note that not all search engines will recognize all Boolean Search Operators. (e) If the Unary operator NOT is immediately followed by any boolean operator except FOLLOWED BY report an error. :*B Or B:. Justia Patents US Patent for Boolean text search combined with extended regular expression search Patent (Patent # 6,681,217) Boolean text search combined with extended regular expression search . This is best done by formally defining the Search Target. Shorthand: (, (xl) ) The right closing Reference Creating parenthesis. This example Search Pattern could not be defined as easily in any currently existing search engine. Construct your query containing 20 or more terms, and OR them together. In what follows, whenever we need to use literally a symbol or symbols which also have a Shorthand special meaning, we preceded it with the backslash “\” If the special meaning combination includes a backslash and we want to designate the backslash literally, we use two backslashes. Shorthand: −, (xxxii) 0 or 1 (shortest) This is the same occurrence designator as the previous one except that the match uses the shortest possible number of occurrence. . The following step-by-step process describes the construction of the Pre-Processor. Inhaber; in welchem Verfahrensstand sich die Anmeldung bzw. Search patents by country [country:US] Search patents by status [status:grant] Search patents by language [language:english] To add new metadata search restricts, click on a box in the "Search Fields" section on the left, or at the top of the screen at lower screen resolutions. Sign up Today! 13. Shorthand: Ò, (x) A-Z a-z This means any alphabetic. As a result, I dish out lots of advice on how to solve specific search problems. Unified's PTAB Portal supports the use of Boolean identifiers when conducting a full-text search. Don’t forget, as technology evolves, and the lexicon changes, you’ll have to update your search to include the newer terms. The equivalent (postfix) Extended Regular Expression operator is designated as % {!}. This process, which leverages the Boolean OR and the relevancy-sorting algorithm, is repeatable for any technology. It would, therefore, definitely be worth reaching out and “pitching” such sites. In other words, it is a very liberal text pattern definition of a phone number but it would hardly ever match any text which was not a phone number. Apparently, “best” matches means those which contain the largest number of the typed words. Check application status. The uppercase letters A, B, C, stand for any Extended Regular Expressions. The user is presented with only one class of parentheses: the GREP type. Shorthand: Ω, (v) Any Long Sentence(20) . In summary, the invention generalizes the Search Pattern description language to combine the existing Extended Regular Expression symbol set with a fully extended Boolean operator set and additionally provides the user with a choice of Search Targets. Therefore a period and a comma can be interior characters of a word if they are surrounded by numbers. Weiterführende Informationen geben Aufschluss darüber, ob ein Patent erteilt wurde und ob es noch in Kraft ist. FIG. Shorthand: \t, (xxv) Space or Tab. ii) accepting a specification of the search target that is less than an entire text document. Shorthand: Σ, (vi) Any Paragraph. OR is particularly useful for synonyms, like ‘bank OR finance OR financial.’ A OR B | A ∪ B NOT. Mit Espacenet können Sie . f) providing, for the step of constructing a plurality of RE terms, a plurality of symbols interpretable to represent a substantially complete set of nonliteral RE operators; and. Shorthand: \r, (xxii) New Line The new line character which does not start a new paragraph. When parentheses do not intervene, the order of precedence of the Boolean Operators in evaluation is as follows: NOT means a negation of the Search Pattern which follows. While performing a search query based on a partial string or with special characters isn’t possible in the Search field, performing a Boolean search with multiple criteria is possible. Pick the top N terms that you discover occurring in the documents with a reasonable frequency, where N is usually between 20 and 30 terms or strings. For example, if the Search Target is a sentence, and the Search Pattern, is: any sentence which contains both the word “Nisus” and the word “Software” without regard to the order of occurrence, would be found as a match. For example, a Boolean search could be "Apple" AND "bluetooth". Shorthand: \v, (xxiii) Space The literal typed space. Candidates who match the exact skills, experience and education required for a position you are looking to fill, live in a commutable … Search patents by country [country:US] Search patents by status [status:grant] Search patents by language [language:english] To add new metadata search restricts, click on a box in the "Search Fields" section on the left, or at the top of the screen at lower screen resolutions. When such a sub-pattern is matched as part of the whole defined Search Pattern, the referenced text match would be used to create a new category (if it did not already exist) and assign it to the found object. (i) Scan UE checking for syntax errors. The last typed number is remembered for all sessions, current and future and is displayed on the menu. Shorthand: [{circumflex over ( )}]. If CE does contain at least one boolean operator, the pre-processor is passed the CE and each of the pre-processing step comprises the following: 1 Identify Boolean Operators and Operands. Shorthand: :*, (xxix) 1+ Means the preceding character, wild card or parenthesized expression is to occur one or more times and assures the largest possible number of occurrences for a match. ‘AND’ – The And operator is used to search a set of words from which each and every word of the query is present in the searched results. Search and read the full text of patents from around the world with Google Patents, and find prior art in our index of non-patent literature. The latter is done using a custom font system where each symbol (possibly including the descriptive text) is a character in that font. represent boolean operators. This is useful when styled text search is used or when it is used as part of a more complex expression. A method of searching text data, in a computer system, including means for specifying a text pattern to be matched to said text data, within a search target said means comprising a language used to compose a search expression describing said text pattern, said language comprising regular expressions and a plurality of boolean operators, said method further comprising user means to specify said search expression, further including methods of an optimized search for said text pattern when said text pattern consists of a boolean search comprising a plurality of text strings disjunctively connected with the OR boolean operator between each pair of said strings, said methods comprising the steps of: i) combining the strings into a single efficient regular expression; ii) carrying out the search using the combined efficient regular expression; iii) once a match is found, checking through the original list, if necessary, to confirm or deny the match. A method of searching text data in a computer system, the method comprising: a) constructing a plurality of regular expression (RE) terms, each RE term using a plurality of different nonliteral RE symbols to describe a class of text patterns; b) modifying the plurality of RE terms by a plurality of different Boolean operators to form a Boolean RE search pattern; and. This is the same as the above but with the shortest possible match. (Usually NEAR means within 10 words of each other, and this number of words is not under users control.). In this website, the user can choose to conduct a country-specific search. In that way, users can easily program the search engine for automated taxonomy of text databases. A Boolean search is particularly helpful after running an initial search. The Referenced Text is defined as that part (or all) of the Matched Text which matches the parenthesized part of the Search Pattern. To use such a notation, we need a menu means to select from, and a display means that distinguishes each symbolic expression from plain text. This is typically not too difficult. . NOT always excludes documents with the specified term. The second alternative speed-up process would use a simple hashing function to reduce each of the listed words to say a 16 bit number. For the latest updates of the database, see the Currency of information page Some of them also provide an “Advanced Search” function. Shorthand: ), (xli) { The left opening NR Parenthesis. Shorthand: \s, (xxiv) Tab The typed tab character. For example, a boolean expression such as (A AND B) concatenated with (C AND D) will give an error in the Boolean interpreter, whereas its intuitive meaning as a GREP expression would be: Although a new design for a unified parser and search engine can be easily developed to better implement the invention, an alternative method of implementing it is described here, which provides the same result through a simple pre-processor, allowing existing code bases for the GREP and Boolean interpreters to be used. DemoOnly Tips Benefits ©2006-2009 SurfWax Inc. Patent Pending. to further develop patent legal status databases and widen the participation of countries in data sharing. WIPO activities for improving worldwide availability, reliability and comparability of patent legal status data, e.g. United States Patent 5842203 . If Op is a unary operator, then split CE=CE1+Op B+CE2. Shorthand: {,n}, (xxxv) From m Times Means the preceding character, wild card or parenthesized expression is to occur “m” or more times and assures the longest possible match. Many such search engines appear to allow for some synonyms of the words typed and are largely word based, that is, unless the text typed by the user is placed in quotes (or designated as literal in some other way) the search assumes a match if the typed words appear in a document in any order and in most search engines, with the implied “OR” between every word and the next one.

Sweet Potato Mushroom Lasagna, Windham Mountain Village Map, Listening Lesson Plan For Grade 7, Ncai 2020 Dc, The Bond Of Love Author, All The Faces Cover, British Airways Holidays, What Countries Can Americans Travel To,