File Information
File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/concl/92/c92-2123_concl.xml
Size: 2,064 bytes
Last Modified: 2025-10-06 13:56:51
<?xml version="1.0" standalone="yes"?> <Paper uid="C92-2123"> <Title>TOWARDS COMPUTER-AIDED LINGUISTIC ENGINEERING</Title> <Section position="8" start_page="0" end_page="0" type="concl"> <SectionTitle> 5 Towards Computer-Aided </SectionTitle> <Paragraph position="0"/> <Section position="1" start_page="0" end_page="0" type="sub_section"> <SectionTitle> Linguistic Engineering </SectionTitle> <Paragraph position="0"> we have outlined a frmnework for Computer-Aided Linguistic Engineering based on the concepts of reusability and automatic programming \[Biggerstaff/ Peflis 89\], and showed that we have already all the basic ingredients (although at various degree of elaboration): null To arrive a a fully detailed framework tlmt could be implemented in a Computer-Aided Linguistic Engineering workstation, the major parts that need to be researched and developed are the elaboration of an annotation system to bridge the gap between the specification language and the programming language, and the development of adequate tools for the automated acquisition of linguistic knowledge. Of course, this approach has to be tested on a larger scale than what have been possible using the partial implementations available at present.</Paragraph> <Paragraph position="1"> Part of the framework described in this paper is presently used in several on-going projects or proposed in several projects proposals. In the current projects, the primary domain of application of this framework is in the area of lexical representations (e.g., the MULTILEX ESPRIT project, the EUROLANG EUREKA project, the DELLS LRE proposal), Acknowledgments. This paper was written while I was working in the Polygloss project at the IMS (University of Stuttgart). Many of the ideas presented in this paper have been discussed during the preparation of an ESPRIT project proposal on Computer-Aided Linguistic Engineering. I would especiaUy like to thank Hassan Ai1-Kaci, Gabriel B~s, Ulrich Heir, Andreas Pedelski, and Harts Uszkoreit.</Paragraph> </Section> </Section> class="xml-element"></Paper>