DMCA
Terminology Finite-State Preprocessing for Computational LFG
Cached
Download Links
- [acl.ldc.upenn.edu]
- [acl.ldc.upenn.edu]
- [ucrel.lancs.ac.uk]
- DBLP
Other Repositories/Bibliography
BibTeX
@MISC{_terminologyfinite-state,
author = {},
title = {Terminology Finite-State Preprocessing for Computational LFG},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a technique to deal with multiword nominal terminology in a compu-tational Lexical Functional Grammar. This method treats multiword terms as single to-kens by modifying the preprocessing stage of the grammar (tokenization and morphological anal-ysis), which consists of a cascade of two-level finite-state automata (transducers). We present here how we build the transducers to take ter-minology 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 affect-ing the relevance of the results. Moreover, the method improves the perspicuity of the analy-ses. 1
