;
; This is an example of a lemma definition file.
;
; Each definition is preceded by the word LEMMA (or CLASS) and followed
; by the tag of the lemma or word class.
;
; The next contains a reference to whether the tokens for the LEMMA (or CLASS)
; are to be treated as whole words or strings.
;
; Then come, one per line, each of the tokens of the particular lemma or word
; class. Lexa registers each lemma and/or word class and attaches it to each
; token which it finds in the text currently loaded into memory.
;
; N.B. The lemma delimiter (by default an underscore) which Lexa places
; between a given word form and the lemma it is assigned to should not be
; entered when defining lemmas below.
;
; All tokens must be unambiguously assigned to a single lemma, otherwise
; the results of lemmatisation are unpredictable. Formal ambiguity must
; be eradicated manually by the user. Equally the name of a lemma must not
; occur in one of the tokens as this leads to confusion.
;
; As usual any line beginning with a semi-colon is regarded as a comment
; and skipped.
;
; A double cross '#' indicates a word boundary. Placed before a string it
; means that the string in question must occur at the beginning of a word;
; placed after a string it implies that the latter is to be found at the
; end of a word; Any text enclosed within two occurrences of '#' is taken
; to refer to a whole word; parts of a word can be left unspecified by using
; one of the two wild cards '?' or '*' which have the same interpretation as
; in DOS, i.e. '?' = one, '*' = several unspecified characters.
;
; Graphical variants of a form must be entered as individual words. E.g. you
; cannot enter "(f)for" to cover both "ffor" and "for"; instead enter both
; variants separately.
;
; A Stop Words file can be used to avoid Lexa tagging (i) very common but
; linguistically uninteresting forms or (ii) forms which would probably be
; lemmatised incorrectly if done automatically. To see how this works, try
; lemmatising the sample tests both with the supplied stop word file _STOP.LST
; specified and without it. In the former case far fewer forms are tagged as
; some of the stop words are tokens in the lemma definitions below.
;
;
; Note: This sample definition file is intended for use with the 4 test files
; _LX_TST1-4.INP and the prologue to Chaucer's Canterbury Tales, CHAUCER.TXT.
; All texts are instances of Middle English in the late 14th. century. The
; types and tokens included below are intended to be of use when lemmatising
; this historical variety of English.
;
;
; Recall that information on the operation of Lexa, such as the use of a stop
; words file (and its name), is conveyed to the programme via the initializa-
; tion file which is read on Lexa starting. Consult the manual for further
; details.
;
;
LEMMA_1: HAVE
TOKENS: WORDS
;
haue
hath
hadde
had
;
LEMMA_2: COPULA
TOKENS: WORDS
;
was
were
weren
be
been
;
LEMMA_3: PREP
TOKENS: WORDS
;
of
on
in
for
ffor
;
LEMMA_4: POSS_PRO
TOKENS: WORDS
;
my
youre
oure
his
hir
hire
;
CLASS_1: PAST_PART
TOKENS: WORDS
;
#y*e#
#y*ed#
;
CLASS_1A: GIVE
TOKENS: WORDS
;
#y?ue#
#y?f#
;
CLASS_2: PLURAL
TOKENS: STRINGS
;
es#
;
CLASS_3: CONJ
TOKENS: WORDS
;
whan
which
what
;
CLASS_4: ART
TOKENS: WORDS
;
a
an
the
;
CLASS_5: IND_PRO
TOKENS: WORDS
;
ech
euery
;
CLASS_6: NEG_PART
TOKENS: WORDS
;
ne
no
neuer
neuere
;
;
CLASS_7: MAN
TOKENS: WORDS
;
#m?n#
;
CLASS_8: SUCH
TOKENS: STRINGS
;
ilke#
;
CLASS_7: X_PHON
TOKENS: STRINGS
;
ght#
;
CLASS_8: ROMANCE
TOKENS: STRINGS
;
age#
ie#
ioun#
aunce#
aunt#
ble#
;
;