LOOKBIB(1) UNIX Programmer's Manual LOOKBIB(1)
indxbib, lookbib - build inverted index for a bibliography,
find references in a bibliography
S
\bSY
\bYN
\bNO
\bOP
\bPS
\bSI
\bIS
\bS
i
\bin
\bnd
\bdx
\bxb
\bbi
\bib
\bb database ...
l
\blo
\boo
\bok
\bkb
\bbi
\bib
\bb [ -
\b-n
\bn ] database
D
\bDE
\bES
\bSC
\bCR
\bRI
\bIP
\bPT
\bTI
\bIO
\bON
\bN
_
\bI_
\bn_
\bd_
\bx_
\bb_
\bi_
\bb makes an inverted index to the named _
\bd_
\ba_
\bt_
\ba_
\bb_
\ba_
\bs_
\be_
\bs (or
files) for use by _
\bl_
\bo_
\bo_
\bk_
\bb_
\bi_
\bb(1) and _
\br_
\be_
\bf_
\be_
\br(1). These files con-
tain bibliographic references (or other kinds of informa-
tion) separated by blank lines.
A bibliographic reference is a set of lines, constituting
fields of bibliographic information. Each field starts on a
line beginning with a ``%'', followed by a key-letter, then
a blank, and finally the contents of the field, which may
continue until the next line starting with ``%''.
_
\bI_
\bn_
\bd_
\bx_
\bb_
\bi_
\bb is a shell script that calls /usr/lib/refer/mkey and
/usr/lib/refer/inv. The first program, _
\bm_
\bk_
\be_
\by, truncates
words to 6 characters, and maps upper case to lower case.
It also discards words shorter than 3 characters, words
among the 100 most common English words, and numbers (dates)
< 1900 or > 2000. These parameters can be changed; see page
4 of the _
\bR_
\be_
\bf_
\be_
\br document by Mike Lesk. The second program,
_
\bi_
\bn_
\bv, creates an entry file (.ia), a posting file (.ib), and
a tag file (.ic), all in the working directory.
_
\bL_
\bo_
\bo_
\bk_
\bb_
\bi_
\bb uses an inverted index made by _
\bi_
\bn_
\bd_
\bx_
\bb_
\bi_
\bb to find sets
of bibliographic references. It reads keywords typed after
the ``>'' prompt on the terminal, and retrieves records con-
taining all these keywords. If nothing matches, nothing is
returned except another ``>'' prompt.
_
\bL_
\bo_
\bo_
\bk_
\bb_
\bi_
\bb will ask if you need instructions, and will print
some brief information if you reply ``y''. The ``-n'' flag
turns off the prompt for instructions.
It is possible to search multiple databases, as long as they
have a common index made by _
\bi_
\bn_
\bd_
\bx_
\bb_
\bi_
\bb. In that case, only the
first argument given to _
\bi_
\bn_
\bd_
\bx_
\bb_
\bi_
\bb is specified to _
\bl_
\bo_
\bo_
\bk_
\bb_
\bi_
\bb.
If _
\bl_
\bo_
\bo_
\bk_
\bb_
\bi_
\bb does not find the index files (the .i[abc]
files), it looks for a reference file with the same name as
the argument, without the suffixes. It creates a file with
a '.ig' suffix, suitable for use with _
\bf_
\bg_
\br_
\be_
\bp. It then uses
this fgrep file to find references. This method is simpler
to use, but the .ig file is slower to use than the .i[abc]
files, and does not allow the use of multiple reference
Printed 7/9/88 April 29, 1985 1
LOOKBIB(1) UNIX Programmer's Manual LOOKBIB(1)
_
\bx.ia, _
\bx.ib, _
\bx.ic, where _
\bx is the first argument, or if these
are not present, then _
\bx.ig, _
\bx
S
\bSE
\bEE
\bE A
\bAL
\bLS
\bSO
\bO
refer(1), addbib(1), sortbib(1), roffbib(1), lookbib(1)
Probably all dates should be indexed, since many disciplines
refer to literature written in the 1800s or earlier.
Printed 7/9/88 April 29, 1985 2