This program generates
an Ahnenliste (German ancestral report). You may want to edit the resulting
output to combine some of the related lines with same or similar surnames
and to sort the list of ancestors with no surname.
This program checks all xrefs except in the GEDCOM header.
NOTE records are treated somewhat differently as NOTEs can be
either by reference or by value.
This simple program gives
you some basic statistics about your database, including numbers of
individuals, families, numbers of unique surnames and given names,
and number and distribution across centuries of birth, baptism, marriage,
death, and burial events. This is one of my earliest LifeLines programs,
and has perhaps the greatest gap in time between versions 1 and 2 of
any program I have written (over 20 years).
This generates a GEDCOM file with only dead people in it.
The people can be selected as ancestors or descendants of a chosen person,
or all people in the database. But only the dead ones or likely dead ones
are included in the resulting GEDCOM file.
This program prints out
a descendants report, assigning a d'Aboville, Henry, modified Henry,
modern Henry, Meurgey de Tupigny, de Villiers/Pama code, or a
generation index to the individuals. The chosen ancestor, and all of
his/her spouses, descendants, and descendants' spouses, either in male
or female descendance lines or all lines, are included in the report.
This LifeLines report program generates a text file that lists people
who may be in the Find A Grave database but are not yet sourced as
such. It searches for the string "Find A Grave" or FINDAGRAVE in
their source references to indicate that a Find A Grave entry has
already been found. If not, then The program guesses birth and death
years as needed and outputs a line about that person.
Counts the number of times tags are used in a particular way in a GEDCOM hierarchy.
This can be useful to find oddball tags or tags used in oddball ways.
Each output line consists of a dot-delimited tag hierarchy, followed by
a tab character and a count of the number of times that tag
was seen in that hierarchy of tags.
Calculates individual relationship graph statistics. A typical relationship has two directed edges
(e.g., father to son and son to father). Occasionally a relationship might have four directed edges
(e.g., a husband marrying the same wife more than once), but all relationships should have an even
number of edges. This program outputs the number of nodes (individuals), directed edges, and lists
all relationships (related pairs of individuals) connected by a number of directed edges not equal to two.
This program calculates the pairs of individuals in a database that are
related to each other, but are least related to each other. The
degree of relation is given by the number of steps it takes to go from
one person to another. It takes one step to go from a person to
his/her parent, spouse, sibling, or child. If several pairs tie for
least related status, all are output. Each pair is actually output twice,
once in each direction. If the database contains mutually unrelated partitions,
a warning is generated, but the results are still correct.
This program scans your
database, or descendants of chosen progenitors therein, and for those
individuals who do not have sources referencing the U.S. Social
Security Death Index (SSDI), it writes one line to an output report.
A text report can be generated, or a web page with buttons to search
one or more online databases for SSDI information. If a single
database is selected, the generated web page uses conventional HTML
usable in a basic web browser. If the user selects the simultaneous
database option, the generated web page uses Javascript to allow each
database to be searched individually or all to be searched
simultaneously. In this case, the user may also dynamically alter the
precision of the birth and death year ranges used for database search.
This program generates a text file
that lists exceptions to assertions or checks about the database. These
checks help you find errors in the database. They include checks on
individuals, families, and events. Run the program once to produce lots
of output, then fix your database as needed, then run the program again
to produce a reference output that you consider correct, acceptable, or
unfixable. Thereafter, run the program as needed and compare with the
reference output (using diff) to find new potential problems.