The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
This article describes a method for the on-line replacement of abbreviated typing entered at e keyboard by the full version on a screen.
English (United States)
This text was extracted from a PDF file.
This is the abbreviated version, containing approximately
56% of the total text.
Page 1 of 1
Abbreviated Typing For Word Processing
This article describes a method for the on-line replacement of abbreviated
typing entered at e keyboard by the full version on a screen.
The method uses an algorithm to define abbreviations of all words in a
dictionary; there is no need to enter a special table of abbreviations.
The algorithm is such that various abbreviations may be used, and none are
required. Thus, a user can gradually learn to make better use of the
abbreviations available. The Method ---------- All words have a short form defined by: 1) leave out all vowels 2) remove adjacent identical letters.
Thus fail => fl, fall => fl, parallel => prl. (A word is identified as a contiguous
string of alphabetic characters).
A dictionary is stored, indexed by the short forms of the word.
The words within a short form are stored in decreasing order of use.
For each word entered, the short form is found. The dictionary entry for that
short form is then scanned for a match with the entered word. A match is a
dictionary word containing all the characters of the entered word in the same
order. Thus, the word 'fall' with short form 'fl' can be matched by entering 'fl',
'fal', 'fll', or 'fall'. These four are called the valid forms of 'fall'. There are three
cases: 1) no match is found (or the short form is not in the dictionary) 2) one
match is found 3) more than one match is found. In case 1, the entered word
will be inserted i...