Terminology Finite State Preprocessing for Computational LFG
This paper presents a technique to deal with multiword nominal terminology in a computational lexical
Functional Grammar. This method treats multiword terms as single tokens by modifying the preprocessing
stage of the grammar (tokenization and morphological analysis), which consists of a cascade of two-level
finite state automata (transducers). We present here how we build the transducers to take terminology into
account. We tested the method by parsing a small corpus with and without this treatment of multiword terms.
The number of parses and parsing time decrease without affecting the relevance of the results. Moreover, the
method improves the perspicuity of the analyses.
Proceedings of COLING/ACL 98, Montreal, 1998
Coling-ACL98.pdf (412.76 kB)