entry_type
stringclasses 4
values | citation_key
stringlengths 10
110
| title
stringlengths 6
276
⌀ | editor
stringclasses 723
values | month
stringclasses 69
values | year
stringdate 1963-01-01 00:00:00
2022-01-01 00:00:00
| address
stringclasses 202
values | publisher
stringclasses 41
values | url
stringlengths 34
62
| author
stringlengths 6
2.07k
⌀ | booktitle
stringclasses 861
values | pages
stringlengths 1
12
⌀ | abstract
stringlengths 302
2.4k
| journal
stringclasses 5
values | volume
stringclasses 24
values | doi
stringlengths 20
39
⌀ | n
stringclasses 3
values | wer
stringclasses 1
value | uas
null | language
stringclasses 3
values | isbn
stringclasses 34
values | recall
null | number
stringclasses 8
values | a
null | b
null | c
null | k
null | f1
stringclasses 4
values | r
stringclasses 2
values | mci
stringclasses 1
value | p
stringclasses 2
values | sd
stringclasses 1
value | female
stringclasses 0
values | m
stringclasses 0
values | food
stringclasses 1
value | f
stringclasses 1
value | note
stringclasses 20
values | __index_level_0__
int64 22k
106k
|
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
inproceedings | nakayama-kumano-1999-collection | Collection of dictionary data through {I}nternet translation service | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.87/ | Nakayama, Keisuke and Kumano, Akira | Proceedings of Machine Translation Summit VII | 586--592 | We have developed an Internet translation service, which we began to provide in 1997 for English to Japanese translation and in 1998 for Japanese to English. In this service, users send a translation request from a web page and receive by e-mail the result of the translation outputted by Toshiba`s machine translation system. As in other similar services, users can specify English-Japanese word pairs(dictionary data) when making a translation request. What distinguishes our service from others is that our service system constructs users' own dictionaries on the server and helps them with this work by extracting words which the system expects to improve the system`s translation quality if included in the dictionaries. With this function, users can efficiently add new word pairs so as to upgrade their own dictionaries when requesting re-translation. The dictionary data thus obtained from users can be utilized to improve the system dictionary on the server also. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,795 |
inproceedings | orliac-arrieta-1999-term | Term Builder: a lexical knowledge acquisition tool for the Logos machine translation system | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.88/ | Orliac, Brigitte and Arrieta, Kutz | Proceedings of Machine Translation Summit VII | 593--597 | Logos 8, the next generation of the Logos Machine Translation (MT) system, is a client server application, which realizes the latest advances in system design and architecture. A multi-user, networkable application, Logos 8 allows Internet or Intranet use of its applications with client interfaces that communicate with dictionaries and translation servers through a common gateway. The new Logos 8 technology is based on a relational database for storage and organization of the lexical data. In this paper, we present Term-Builder, the Lexical Knowledge Acquisition tool developed for Logos 8. The new automatic coding functionality within Term-Builder is significantly improving the process of acquiring new lexicons for MT and other applications. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,796 |
inproceedings | blekhman-etal-1999-computer | Computer-aided translation tools for {R}ussian. {U}krainian, and {E}nglish | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.89/ | Blekhman, Michael S. and Byezhanova, Maryna and Kursin, Andrei and Backlan, Igor and Kazakov, Alexander and Petrov, Vladimir | Proceedings of Machine Translation Summit VII | 598--600 | The paper presents a new development by Lingvistica {\textquoteleft}98 Inc.: the PG-PARS computer-assisted translation system and a series of professional bidirectional dictionaries. PG-PARS was designed as a Windows 95 and Windows 98 application to support English-Russian-English and English-Ukrainian-English dictionaries. PG-PARS dictionaries are all bidirectional, i.e. they include, for example, both the English-Russian and Russian-English parts. Each part has its alphabetical index of entries displayed on a separate tab in the PG-PARS main window. The word entries are displayed for both parts of the dictionary, and translations of translations can be found easily, which is useful for a professional translator. One of the main peculiarities of PG-PARS is the Smart search mode based on morphological analysis of Slavic and English words looked up in the dictionaries. This is especially beneficial if the user is not a native speaker of Russian and Ukrainian. Another important feature is the Selection option which allows the user to mark a portion of the dictionary entry and paste it into the text. The presentation will show professional applications of the PG-PARS system for translating Russian and English texts. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,797 |
inproceedings | watanabe-etal-1999-translation | Translation camera | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.90/ | Watanabe, Yasuhiko and Okada, Yoshihiro and Kim, Yeun-Bae and Takeda, Tetsuya | Proceedings of Machine Translation Summit VII | 601--607 | In this paper, we propose a camera system which translates Japanese texts in a scene. The system is portable and consists of four components: digital camera, character image extraction process, character recognition process, and translation process. The system extracts character strings from a region which a user specifies, and translates them into English. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,798 |
inproceedings | chen-tokuda-1999-new | A new diagnostic system for {J}-{E} translation {ILTS} by global matching algorithm and {POST} parser | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.91/ | Chen, Liang and Tokuda, Naoyuki | Proceedings of Machine Translation Summit VII | 608--616 | A new diagnostic system has been developed for an interactive template-structured intelligent language tutoring system (ILTS) for Japanese-English translation where an efficient heaviest common sequence (HCS) matching algorithm and a {\textquoteleft}part-of-speech tagged (POST) parser' play a key role. This is implemented by exploiting the system template which consists of a complex transition networks comprising both model (correct) translations and many typical erroneous translations characteristic of nonnative beginners all collected and extracted from translations of about 200 monitors. By selecting, from among many candidates' paths in the system template, a path having a HCS with the student`s input translation as a best matched sentence, the template structure of the diagnostic system allows the potentially complicated bug finding processes in natural language to be implemented by a much simpler and efficient HCS string matching algorithm [20]. To improve the precision of a parser, we have developed a {\textquoteleft}probabilistic POST parser' where we have eliminated ambiguity in part-of-speeches by manually pre-assigning POS tags to all words in potentially correct paths of the template. Combining the templatebased diagnostic system and the parser, we found that the ILTS is capable of providing most adequate diagnostic messages and a tutoring strategy with appropriate comments after analyzing the keyed-in translated sentences from students. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,799 |
inproceedings | carl-hansen-1999-linking | Linking translation memories with example-based machine translation | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.92/ | Carl, Michael and Hansen, Silvia | Proceedings of Machine Translation Summit VII | 617--624 | The paper reports on experiments which compare the translation outcome of three corpus-based MT systems, a string-based translation memory (STM), a lexeme-based translation memory (LTM) and the example-based machine translation (EBMT) system EDGAR. We use a fully automatic evaluation method to compare the outcome of each MT system and discuss the results. We investigate the benefits for the linkage of different MT strategies such as TMsystems and EBMT systems. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,800 |
inproceedings | neumann-1999-towards | Towards an interlingual treatment of modality | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.93/ | Neumann, Christoph | Proceedings of Machine Translation Summit VII | 625--632 | Modality is an important, but complex linguistic phenomenon that concerns all levels of language production. NLP research has rather refrained from this subject, but we show that many errors in machine translation systems are directly related to the absence of a proper interlingual treatment of modality. We outline the traces of such a modal interlingua by presenting the {\textquotedblleft}Module of Modality{\textquotedblright}, parts of which are currently being implemented in a Japanese-English system. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,801 |
inproceedings | lange-yang-1999-automatic | Automatic domain recognition for machine translation | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.95/ | Lange, Elke D. and Yang, Jin | Proceedings of Machine Translation Summit VII | 641--645 | This paper describes an ongoing project which has the goal of improving machine translation quality by increasing knowledge about the text to be translated. A basic piece of such knowledge is the domain or subject field of the text. When this is known, it is possible to improve meaning selection appropriate to that domain. Our current effort consists in automating both recognition of the text`s domain and the assignment of domain-specific translations. Results of our implementation show that the approach of using terminology categorization already existing in the machine translation system is very promising. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,803 |
inproceedings | zajac-1999-multilevel | A multilevel framework for incremental development of {MT} systems | null | sep # " 13-17" | 1999 | Singapore, Singapore | null | https://aclanthology.org/1999.mtsummit-1.96/ | Zajac, Remi | Proceedings of Machine Translation Summit VII | 646--653 | We describe a Machine Translation framework aimed at the rapid development of large scale robust machine translation systems for assimilation purposes, where the MT system is incorporated as one of the tools in an analyst`s workstation. The multilevel architecture of the system is designed to enable early delivery of functional translation capabilities and incremental improvement of quality. A crucial aspect of the framework is a careful articulation of a software architecture, a linguistic architecture and an incremental development process of linguistic knowledge. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,804 |
inproceedings | chert-etal-1998-ntu | An {NTU}-Approach to Automatic Sentence Extraction for Summary Generation | null | oct | 1998 | Baltimore, Maryland, USA | Association for Computational Linguistics | https://aclanthology.org/X98-1022/ | Chen, Kuang-hua and Huang, Sheng-Jie and Lin, Wen-Cheng and Chen, Hsin-Hsi | TIPSTER TEXT PROGRAM PHASE III: Proceedings of a Workshop held at Baltimore, {M}aryland, October 13-15, 1998 | 163--170 | Automatic summarization and information extraction are two important Internet services. MUC and SUMMAC play their appropriate roles in the next generation Internet. This paper focuses on the automatic summarization and proposes two different models to extract sentences for summary generation under two tasks initiated by SUMMAC-1. For categorization task, positive feature vectors and negative feature vectors are used cooperatively to construct generic, indicative summaries. For adhoc task, a text model based on relationship between nouns and verbs is used to filter out irrelevant discourse segment, to rank relevant sentences, and to generate the user-directed summaries. The result shows that the NormF of the best summary and that of the fixed summary for adhoc tasks are 0.456 and 0.447. The NormF of the best summary and that of the fixed summary for categorization task are 0.4090 and 0.4023. Our system outperforms the average system in categorization task but does a common job in adhoc task. | null | null | 10.3115/1119089.1119117 | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 96,885 |
inproceedings | fung-1998-statistical | A statistical view on bilingual lexicon extraction | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.1/ | Fung, Pascale | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 1--17 | We present two problems for statistically extracting bilingual lexicon: (1) How can noisy parallel corpora be used? (2) How can non-parallel yet comparable corpora be used? We describe our own work and contribution in relaxing the constraint of using only clean parallel corpora. DKvec is a method for extracting bilingual lexicons, from noisy parallel corpora based on arrival distances of words in noisy parallel corpora. Using DKvec on noisy parallel corpora in English/Japanese and English/Chinese, our evaluations show a 55.35{\%} precision from a small corpus and 89.93{\%} precision from a larger corpus. Our major contribution is in the extraction of bilingual lexicon from non-parallel corpora. We present a first such result in this area, from a new method-Convec. Convec is based on context information of a word to be translated. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,872 |
inproceedings | melamed-1998-empirical | Empirical methods for {MT} lexicon development | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.2/ | Melamed, I. Dan | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 18--30 | This article reviews some recently invented methods for automatically extracting translation lexicons from parallel texts. The accuracy of these methods has been significantly improved by exploiting known properties of parallel texts and of particular language pairs. The state of the art has advanced to the point where non-compositional compounds can be automatically identified with high reliability, and their translations can be found. Most importantly, all of these methods can be smoothly integrated into the usual work ow of MT system developers. Semi-automatic MT lexicon construction is likely to be more efficient and more accurate than either fully automatic or fully manual methods alone. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,873 |
inproceedings | woszczcyna-etal-1998-modular | A modular approach to spoken language translation for large domains | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.3/ | Woszczcyna, Monika and Broadhead, Matthew and Gates, Donna and Gavald{\'a}, Marsal and Lavie, Alon and Levin, Lori and Waibel, Alex | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 31--49 | The MT engine of the JANUS speech-to-speech translation system is designed around four main principles: 1) an interlingua approach that allows the efficient addition of new languages, 2) the use of semantic grammars that yield low cost high quality translations for limited domains, 3) modular grammars that support easy expansion into new domains, and 4) efficient integration of multiple grammars using multi-domain parse lattices and domain re-scoring. Within the framework of the C-STAR-II speech-to-speech translation effort, these principles are tested against the challenge of providing translation for a number of domains and language pairs with the additional restriction of a common interchange format. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,874 |
inproceedings | olsen-etal-1998-enhancing | Enhancing automatic acquisition of the thematic structure in a large-scale lexicon for {M}andarin {C}hinese | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.4/ | Olsen, Mari Broman and Dorr, Bonnie J. and Thomas, Scott C. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 41--50 | This paper describes a refinement to our procedure for porting lexical conceptual structure (LCS) into new languages. Specifically we describe a two-step process for creating candidate thematic grids for Mandarin Chinese verbs, using the English verb heading the VP in the subde{\_}nitions to separate senses, and roughly parsing the verb complement structure to match thematic structure templates. We accomplished a substantial reduction in manual effort, without substantive loss. The procedure is part of a larger process of creating a usable lexicon for interlingual machine translation from a large on-line resource with both too much and too little information. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,875 |
inproceedings | oz-cicekli-1998-ordering | Ordering translation templates by assigning confidence factors | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.5/ | {\"Oz, Zeynep and Cicekli, Ilyas | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 51--61 | TTL (Translation Template Learner) algorithm learns lexical level correspondences between two translation examples by using analogical reasoning. The sentences used as translation examples have similar and different parts in the source language which must correspond to the similar and different parts in the target language. Therefore these correspondences are learned as translation templates. The learned translation templates are used in the translation of other sentences. However, we need to assign confidence factors to these translation templates to order translation results with respect to previously assigned confidence factors. This paper proposes a method for assigning confidence factors to translation templates learned by the TTL algorithm. Training data is used for collecting statistical information that will be used in confidence factor assignment process. In this process, each template is assigned a confidence factor according to the statistical information obtained from training data. Furthermore, some template combinations are also assigned confidence factors in order to eliminate certain combinations resulting bad translation. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,876 |
inproceedings | buschbeck-wolf-dorna-1998-quality | Quality and robustness in {MT}{---}{A} balancing act | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.6/ | Buschbeck-Wolf, Bianka and Dorna, Michael | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 62--71 | The speech-to-speech translation system Verbmobil integrates deep and shallow analysis modules that produce linguistic representations in parallel. Thus, the input representations for the transfer module differ with respect to their depth and quality. This gives rise to two problems: (i) the transfer database has to be adjusted according to input quality, and (ii) translations produced have to be ranked with respect to their quality in order to select the most appropriate result. This paper presents an operationalized solution to both problems. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,877 |
inproceedings | resnik-1998-parallel | Parallel strands: a preliminary investigation into mining the Web for bilingual text | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.7/ | Resnik, Philip | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 72--82 | Parallel corpora are a valuable resource for machine translation, but at present their availability and utility is limited by genre- and domain-specificity, licensing restrictions, and the basic dificulty of locating parallel texts in all but the most dominant of the world`s languages. A parallel corpus resource not yet explored is the World Wide Web, which hosts an abundance of pages in parallel translation, offering a potential solution to some of these problems and unique opportunities of its own. This paper presents the necessary first step in that exploration: a method for automatically finding parallel translated documents on the Web. The technique is conceptually simple, fully language independent, and scalable, and preliminary evaluation results indicate that the method may be accurate enough to apply without human intervention. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,878 |
inproceedings | hakkani-etal-1998-english | An {E}nglish-to-{T}urkish interlingual {MT} system | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.8/ | Hakkani, Dilek Zeynap and T{\"ur, G{\"oklan and Oflazer, Kemal and Mitamura, Teruko and Nyberg, 3rd, Eric H. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 83--94 | This paper describes the integration of a Turkish generation system with the KANT knowledge-based machine translation system to produce a prototype English-Turkish interlingua-based machine translation system. These two independently constructed systems were successfully integrated within a period of two months, through development of a module which maps KANT interlingua expressions to Turkish syntactic structures. The combined system is able to translate completely and correctly 44 of 52 benchmark sentences in the domain of broadcast news captions. This study is the first known application of knowledge-based machine translation from English to Turkish, and our initial results show promise for future development. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,879 |
inproceedings | palmer-etal-1998-rapid | Rapid prototyping of domain-apecific machine translation systems | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.9/ | Palmer, Martha and Rambow, Owen and Nasr, Alexis | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 95--102 | This paper reports on an experiment in assembling a domain-specific machine translation prototype system from off-the-shelf components. The design goals of this experiment were to reuse existing components, to use machine-learning techniques for parser specialization and for transfer lexicon extraction, and to use an expressive, lexicalized formalism for the transfer component. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,880 |
inproceedings | hogan-frederking-1998-evaluation | An evaluation of the multi-engine {MT} architecture | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.10/ | Hogan, Christopher and Frederking, Robert E. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 113--123 | The Multi-Engine MT (MEMT) architecture combines the outputs of multiple MT engines using a statistical language model of the target language. It has been used successfully in a number of MT research systems, for both text and speech translation. Despite its perceived benefits, there has never been a rigorous, published, double-blind evaluation of the claim that the combined output of a MEMT system is in fact better than that of any one of the component MT engines. We report here the results of such an evaluation. The combined MEMT output is shown to indeed be better overall than the output of the component engines in a Croatian {\ensuremath{\leftrightarrow}} English MT system. This result is consistent in both translation directions, and between different raters. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,881 |
inproceedings | temizsoy-cicekli-1998-ontology | An ontology-based approach to parsing {T}urkish sentences | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.11/ | Temizsoy, Murat and Cicekli, Ilya | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 124--135 | The main problem with natural language analysis is the ambiguity found in various levels of linguistic information. Syntactic analysis with word senses is frequently not enough to resolve all ambiguities found in a sentence. Although natural languages are highly connected to the real world knowledge, most of the parsing architectures do not make use of it effectively. In this paper, a new methodology is proposed for analyzing Turkish sentences which is heavily based on the constraints in the ontology. The methodology also makes use of morphological marks of Turkish which generally denote semantic properties. Analysis aims to find the propositional structure of the input utterance without constructing a deep syntactic tree, instead it utilizes a weak interaction between syntax and semantics. The architecture constructs a specific meaning representation on top of the analyzed propositional structure. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,882 |
inproceedings | mccarley-roukos-1998-fast | Fast document translation for cross-language information retrieval | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.13/ | McCarley, J.Scott and Roukos, Salim | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 150--157 | We describe a statistical algorithm for machine translation intended to provide translations of large document collections at speeds far in excess of traditional machine translation systems, and of sufficiently high quality to perform information retrieval on the translated document collections. The model is trained from a parallel corpus and is capable of disambiguating senses of words. Information retrieval (IR) experiments on a French language dataset from a recent cross-language information retrieval evaluation yields results superior to those obtained by participants in the evaluation, and confirm the importance of word sense disambiugation in cross-language information retrieval. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,884 |
inproceedings | godden-1998-machine | Machine translation in context | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.14/ | Godden, Kurt | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 158--163 | The Controlled Automotive Service Language project at General Motors is combining machine translation (MT) with a variety of other language technologies into an existing translation environment. In keeping with the theme of this conference, this report elaborates on the elements of this mixture, and how they are being blended together to form a coordinated whole. The primary concept is that machine translation cannot be viewed independently of the context in which it will be used. That entire context must be prepared and managed in order to accommodate MT without undue business risk. Further, until high-quality MT is available in a much wider variety of languages, any MT production application is likely to co-exist with traditional human translation, which requires additional considerations. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,885 |
inproceedings | bernth-1998-easy | Easy {E}nglish | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.15/ | Bernth, Arendse | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 158--163 | EasyEnglish is an authoring tool which is part of IBM`s internal SGML editing environment, Information Development Workbench. EasyEnglish is used as a preprocessing step for machine-translating IBM manuals. Although Easy English does some traditional grammar checking, its focus is on problems of structural ambiguity. Such problems include ambiguous attachment of participles, ambiguous scope in coordination, and ambiguous attachment of the agent phrase for double passives. Since we deal with truly ambiguous constructions, the system has no way of deciding on the desired interpretation; the system provides the user with a choice of rewriting suggestions, each forcing an unambiguous attachment. This paper describes the techniques for identifying structural ambiguities and generating unambiguous rewriting suggestions. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,886 |
inproceedings | hong-1998-multiple | Multiple-subject constructions in the multilingual {MT}-system {CAT} | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.16/ | Hong, Munpyo | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 174--186 | This paper addresses the problems of the so-called {\textquoteleft}Multiple-Subject Constructions' in Korean-to-English and Korean-to-German MT. They are often encountered in a dialogue, so that they must be especially taken into account in designing a spoken-language translation system. They do not only raise questions about their syntactic and semantic nature but also cause such problems as structural changes in the MT. The proper treatment of these constructions is also of importance in constructing a multilingual MT-System, because they are one of the major characteristics which distinguish the so-called {\textquoteleft}topic-oriented' languages such as Korean and Japanese from the {\textquoteleft}subject-oriented' languages such as English and German. In this paper we employ linguistic knowledge such as subcategorization, linear precedence and lexical functions for the analysis and the transfer of the constructions of this sort. Using the proposed methods, the specific transfer-rules for each language pair can be avoided. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,887 |
inproceedings | meyers-etal-1998-multilingual | A multilingual procedure for dictionary-based sentence alignment | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.17/ | Meyers, Adam and Kosaka, Michiko and Grishman, Ralph | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 187--198 | This paper describes a sentence alignment technique based on a machine readable dictionary. Alignment takes place in a single pass through the text, based on the scores of matches between pairs of source and target sentences. Pairings consisting of sets of matches are evaluated using a version of the Gale-Shapely solution to the stable marriage problem. An algorithm is described which can handle N-to-1 (or 1-to-N) matches, for n {\ensuremath{\geq}} 0, i.e., deletions, 1-to-1 (including scrambling), and 1-to-many matches. A simple frequency based method for acquiring supplemental dictionary entries is also discussed. We achieve high quality alignments using available bilingual dictionaries, both for closely related language pairs (Spanish/English) and more distantly related pairs (Japanese/English). | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,888 |
inproceedings | chang-etal-1998-taxonomy | Taxonomy and lexical semantics{---}from the perspective of machine readable dictionary | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.18/ | Chang, Jason S. and Ker, Sue J. and Chen, Mathis H. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 199--212 | Machine-readable dictionaries have been regarded as a rich knowledge source from which various relations in lexical semantics can be effectively extracted. These semantic relations have been found useful for supporting a wide range of natural language processing tasks, from information retrieval to interpretation of noun sequences, and to resolution of prepositional phrase attachment. In this paper, we address issues related to problems in building a semantic hierarchy from machine-readable dictionaries: genus disambiguation, discovery of covert categories, and bilingual taxonomy. In addressing these issues, we will discuss the limiting factors in dictionary definitions and ways of eradicating these problems. We will also compare the taxonomy extracted in this way from a typical MRD and that of the WordNet. We argue that although the MRD-derived taxonomy is considerably flatter than the WordNet, it nevertheless provides a functional core for a variety of semantic relations and inferences which is vital in natural language processing. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,889 |
inproceedings | loehr-1998-simultaneous | Can simultaneous interpretation help machine translation? | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.19/ | Loehr, Dan | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 213--224 | It is well known that Machine Translation (MT) has not approached the quality of human translations. It has also been noted that MT research has largely ignored the work of professionals and researchers in the field of translation, and that MT might benefit from collaboration with this field. In this paper, I look at a specialized type of translation, Simultaneous Interpretation (SI), in the light of possible applications to MT. I survey the research and practice of SI, and note that explanatory analyses of SI do not yet exist. However, descriptive analyses do, arrived at through anecdotal, empirical, and model-based methods. These descriptive analyses include {\textquotedblleft}techniques{\textquotedblright} humans use for interpreting, and I suggest possible ways MT might use these techniques. I conclude by noting further questions which must be answered before we can fully understand SI, and how it might help MT. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,890 |
inproceedings | serutla-kourie-1998-sentence | Sentence analysis using a concept lattice | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.20/ | Serutla, Lebelo and Kourie, Derrick | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 225--235 | Grammatically incorrect sentences result either from an unknown (possibly misspelled) word, an incorrect word order or even an omitted / redundant word. Sentences with these errors are a bottle-neck to NLP systems because they cannot be parsed correctly. Human beings are able to overcome this problem (either occurring in spoken or written language) since they are capable of doing a semantic similarity search to find out if a similar utterance has been heard before or a syntactic similarity search for a stored utterance that shares structural similarities with the input. If the syntactic and semantic analysis of the rest of the input can be done correctly, then a {\textquoteleft}gap' that exists in the utterance, can be uniquely identified. In this paper, a system named SAUCOLA which is based on a concept lattice, that mimics human skills in resolving knowledge gaps that exist in written language is presented. The preliminary results show that correct stored sentences can be retrieved based on the words contained in the incorrect input sentence. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,891 |
inproceedings | schutz-nubel-1998-evaluating | Evaluating language technologies | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.21/ | Sch{\"utz, J{\"org and N{\"ubel, Rita. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 236--249 | In this paper we report on ongoing verification and validation work within the MULTIDOC project. This project is situated in the field of multilingual automotive product documentation. One central task is the evaluation of existing off-the-shelf and research based language technology (LT) products and components for the purpose of supporting or even reorganising the documentation production chain along three diagnostic dimensions: the process proper, the documentation quality and the translatability of the process output. In this application scenario, LT components shall control and ensure that predefined quality criteria are applicable and measurable to the documentation end-product as well as to the information objects that form the basic building blocks of the end-product. In this scenario, multilinguality is of crucial importance. It shall be introduced or prepared, and maintained as early as possible in the documentation workflow to ensure a better and faster translation process. A prerequisite for the evaluation process is the thorough definition of these dimensions in terms of user quality requirements and LT developer quality requirements. In our approach, we define the output quality of the whole documentation process as the pivot where user requirements and developer requirements shall meet. For this, it turned out that a so-called {\textquotedblleft}braided{\textquotedblright} diagnostic evaluation is very well suited to cover both views. Since no generally approved standards or even valid specifications for standards exist for the evaluation of LT products, we have adjusted existing standards for the evaluation of software products, in particular ISO 9001, ISO 9000-3, ISO/IEC 12119, ISO 9004 and ISO 9126. This is feasible because an LT product consists of a software part and a lingware part. The adaptation had to be accomplished for the latter part. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,892 |
inproceedings | bian-chen-1998-integrating | Integrating query translation and document translation in a cross-language information retrieval system | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.22/ | Bian, Guo-Wei and Chen, Hsin-Hsi | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 250--265 | Due to the explosive growth of the WWW, very large multilingual textual resources have motivated the researches in Cross-Language Information Retrieval and online Web Machine Translation. In this paper, the integration of language translation and text processing system is proposed to build a multilingual information system. A distributed English-Chinese system on WWW is introduced to illustrate how to integrate query translation, search engines, and web translation system. Since July 1997, more than 46,000 users have accessed our system and about 250,000 English web pages have been translated to pages in Chinese or bilingual English-Chinese versions. And the average satisfaction degree of users at document level is 67.47{\%}. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,893 |
inproceedings | danielsson-muhlenbock-1998-stalhandske | When St{\r{a}}lhandske becomes Steelglove | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.23/ | Danielsson, Pernilla and M{\"uhlenbock, Katarina | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 266--274 | Names can serve several purposes in the field of Machine Translation. The problems range from identifying to processing the various types of names. The paper begins with a short description of the search strategy and then continues with the classification of types into a typology. We present our findings according to degrees of translation from which we highlight clues. These clues indicate a first step towards formalization. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,894 |
inproceedings | yang-lange-1998-systran | {SYSTRAN} on {A}lta{V}ista | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.24/ | Yang, Jin and Lange, Elke D. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 275--285 | On December 9 1997, SYSTRAN and the AltaVista Search Network launched the first widely available, real-time, high-speed and free translation service on the Internet. This initial deployment, treated as a global experiment, has become a tremendous success. Through this service, machine translation (MT) technology has been pushed to the forefront of worldwide awareness. Besides growing media coverage, user response during the first five months has been overwhelming. This paper is a study of the user feedback from the MT developer`s perspective, addressing such questions as: Who are the users? What are their needs? What is their acceptance of MT? What types of texts are being translated? What suggestions do users offer? Finally, this paper outlines our view on opportunities and challenges, and on how to use this feedback to guide future development priorities. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,895 |
inproceedings | germann-1998-making | Making semantic interpretation parser-independent | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.25/ | Germann, Ulrich | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 286--299 | We present an approach to semantic interpretation of syntactically parsed Japanese sentences that works largely parser-independent. The approach relies on a standardized parse tree format that restricts the number of syntactic configurations that the semantic interpretation rules have to anticipate. All parse trees are converted to this format prior to semantic interpretation. This setup allows us not only to apply the same set of semantic interpretation rules to output from different parsers, but also to independently develop parsers and semantic interpretation rules. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,896 |
inproceedings | fourla-yannoutsou-1998-implementing | Implementing {MT} in the {G}reek public sector | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.26/ | Fourla, Athanassia and Yannoutsou, Olga | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 300--307 | This paper presents the activities of Euromat (European Machine Translation) office in Greece, which has been functioning as a centre for Machine Translation Services for the Greek Public Sector since 1994. It describes the user profile, his/her attitude towards MT, strategies of promotion and the collected corpus for the first three years. User data were collected by questionnaires, interviews and corpus statistics. The general conclusions which have come out from our surveys are discussed. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,897 |
inproceedings | kim-1998-statistical | Statistical approach for {K}orean analysis | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.27/ | Kim, Nari | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 308--317 | In conventional approaches to Korean analysis, verb subcategorization has generally been used as lexical knowledge. A problem arises, however, when we are given long sentences in which two or more verbs of the same subcategorization are involved. In those sentences, a noun phrase may be taken as the constituent of more than one verb and cause an ambiguity. This paper presents an approach to solving this problem by using structural patterns acquired by a statistical method from corpora. Structural patterns can be the processing units for syntactic analysis and for translation into other languages as well. We have collected 10,686 unique structural patterns from a Korean corpus of 1.27 million words. We have analyzed 2,672 sentences and shown that structural patterns can improve the accuracy of Korean analysis. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,898 |
inproceedings | jones-havrilla-1998-twisted | Twisted pair grammar: support for rapid development of machine translation for low density languages | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.28/ | Jones, Douglas and Havrilla, Rick | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 318--332 | We describe a streamlined knowledge acquisition method for semi-automatically constructing knowledge bases for a Knowledge Based Machine Translation (KBMT) system. This method forms the basis of a very simple Java-based user interface that enables a language expert to build lexical and syntactic transfer knowledge bases without extensive specialized training as an MT system builder. Following [Wu 1997], we assume that the permutation of binary-branching structures is a sufficient reordering mechanism for MT. Our syntactic knowledge is based on a novel, highly constrained grammar construction environment in which the only re-ordering mechanism is the permutation of binary-branching structures (Twisted Pair Grammar). We describe preliminary results for several fully implemented components of a Hindi/Urdu to English MT prototype being built with this interface. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,899 |
inproceedings | dorr-etal-1998-thematic | A thematic hierarchy for efficient generation from lexical-conceptual structure | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.29/ | Dorr, Bonnie and Habash, Nizar and Traum, David | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 333--343 | This paper describes an implemented algorithm for syntactic realization of a target-language sentence from an interlingual representation called Lexical Conceptual Structure (LCS). We provide a mapping between LCS thematic roles and Abstract Meaning Representation (AMR) relations; these relations serve as input to an off-the-shelf generator (Nitrogen). There are two contributions of this work: (1) the development of a thematic hierarchy that provides ordering information for realization of arguments in their surface positions; (2) the provision of a diagnostic tool for detecting inconsistencies in an existing online LCS-based lexicon that allows us to enhance principles for thematic-role assignment. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,900 |
inproceedings | mccord-bernth-1998-lmt | The {LMT} Transformational System | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.30/ | McCord, Michael and Bernth, Arendse | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 344--355 | We present a newly designed transformational system for the MT system LMT, consisting of a transformational formalism, LMT-TL, and an algorithm for applying transformations written in this formalism. LMT-TL is both expressive and simple because of the systematic use of a powerful pattern matching mechanism that focuses on dependency trees. LMT-TL is a language in its own right, with no {\textquotedblleft}escapes{\textquotedblright} to underlying programming languages. We first provide an overview of the complete LMT translation process (all newly redesigned), and then give a self-contained description of LMT-TL, with examples. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,901 |
inproceedings | reeder-loehr-1998-finding | Finding the right words: an analysis of not-translated words in machine translation | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.31/ | Reeder, Flo and Loehr, Dan | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 356--363 | A not-translated word (NTW) is a token which a machine translation (MT) system is unable to translate, leaving it untranslated in the output. The number of not-translated words in a document is used as one measure in the evaluation of MT systems. Many MT developers agree that in order to reduce the number of NTWs in their systems, designers must increase the size or coverage of the lexicon to include these untranslated tokens, so that the system can handle them in future processing. While we accept this method for enhancing MT capabilities, in assessing the nature of NTWs in real-world documents, we found surprising results. Our study looked at the NTW output from two commercially available MT systems (Systran and Globalink) and found that lexical coverage played a relatively small role in the words marked as not translated. In fact, 45{\%} of the tokens in the list failed to translate for reasons other than that they were valid source language words not included in the MT lexicon. For instance, e-mail addresses, words already in the target language and acronyms were marked as not-translated words. This paper presents our analysis of NTWs and uses these results to argue that in addition to lexicon enhancement, MT systems could benefit from more sophisticated pre- and postprocessing of real-world documents in order to weed out such NTWs. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,902 |
inproceedings | taylor-white-1998-predicting | Predicting what {MT} is good for: user judgments and task performance | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.32/ | Taylor, Kathryn and White, John | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 364--373 | As part of the Machine Translation (MT) Proficiency Scale project at the US Federal Intelligent Document Understanding Laboratory (FIDUL), Litton PRC is developing a method to measure MT systems in terms of the tasks for which their output may be successfully used. This paper describes the development of a task inventory, i.e., a comprehensive list of the tasks analysts perform with translated material and details the capture of subjective user judgments and insights about MT samples. Also described are the user exercises conducted using machine and human translation samples and the assessment of task performance. By analyzing translation errors, user judgments about errors that interfere with task performance, and user task performance results, we isolate source language patterns which produce output problems. These patterns can then be captured in a single diagnostic test set, to be easily applied to any new Japanese-English system to predict the utility of its output. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,903 |
inproceedings | guillen-1998-reusing | Reusing translated terms to expand a multilingual thesaurus | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.33/ | Guill{\'e}n, Rocio | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 374--383 | Multilingual thesauri play a key role in multilingual text retrieval. At present, only a small number of on-line thesauri contain translations of terms in languages other than English. This is the case of the Unified Medical Language System (UMLS) Metathesaurus that includes the same term in different languages (e.g., English and Spanish). However, only a subset of terms in English have a corresponding translation in Spanish. In this work, I present an approach and some experimental results for reusing translated terms to expand the Metathesaurus. The approach includes two main tasks: finding patterns and formulating rules to automate the translation of English terms into Spanish terms. The approach is based on pattern matching, morphological rules, and word order inversion. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,904 |
inproceedings | mclaughlin-schwall-1998-spicing | Spicing up the information soup: machine translation and the internet | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.34/ | McLaughlin, Steve and Schwall, Ulrike | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 384--397 | The Internet is rapidly changing the face of business and dramatically transforming people`s working and private lives. These developments present both a challenge and an opportunity to many technologies, one of the most important being Machine Translation. The Internet will soon be the most important medium for offering and finding information, and one of the principle means of communication for both companies and private users. There are many players on the Internet scene, each with different needs. Some players require help in presenting their information to an international audience, others require help in finding the information they seek and, because the Internet is increasingly multilingual, help in understanding that which they find. This paper attempts to identify the players and their needs, and outlines the products and services with which Machine Translation can help them to fully participate in the Internet revolution. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,905 |
inproceedings | shinnou-1998-revision | Revision of morphological analysis errors through the person name construction model | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.35/ | Shinnou, Hiroyuki | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 398--407 | In this paper, we present the method to automatically revise morphological analysis errors caused by unregistered person names. In order to detect and revise their errors, we propose the Person Name Construction Model for kanji characters composing Japanese names. Our method has the advantage of not using context information, like a suffix, to recognize person names, thus making our method a useful one. Through the experiment, we show that our proposed model is effective. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,906 |
inproceedings | gdaniec-1998-lexical | Lexical choice and syntactic generation in a transfer system: transformations in the new {LMT} {E}nglish-{G}erman system | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.36/ | Gdaniec, Claudia | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 408--420 | This paper argues that, contrary to received wisdom in the MT research community, a transfer system such as LMT is well suited to deal with most of the problems that MT faces. It may in fact be superior to other approaches in that it can handle target surface-structure constraints, variation of syntactic patterns, discourse-structure constraints, and stylistic preference. The paper describes the linguistic issues involved in LMT`s English{\ensuremath{\Rightarrow}}German transformational component, its interaction with the lexical transfer component, and types of transformations. It identifies context-dependent and context-independent transformations and among the context-dependent ones, it differentiates between those that are triggered by instructions in the lexicon, by semantic category, by syntactic context, and by setting of stylistic preference. The paper concludes with some examples of divergence between English and German and shows how LMT handles them. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,907 |
inproceedings | knight-al-onaizan-1998-translation | Translation with finite-state devices | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.37/ | Knight, Kevin and Al-Onaizan, Yaser | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 421--437 | Statistical models have recently been applied to machine translation with interesting results. Algorithms for processing these models have not received wide circulation, however. By contrast, general finite-state transduction algorithms have been applied in a variety of tasks. This paper gives a finite-state reconstruction of statistical translation and demonstrates the use of standard tools to compute statistically likely translations. Ours is the first translation algorithm for {\textquotedblleft}fertility/permutation{\textquotedblright} statistical models to be described in replicable detail. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,908 |
inproceedings | dorr-katsova-1998-lexical | Lexical selection for cross-language applications: combining {LCS} with {W}ord{N}et | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.38/ | Dorr, Bonnie and Katsova, Maria | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 438--447 | This paper describes experiments for testing the power of large-scale resources for lexical selection in machine translation (MT) and cross-language information retrieval (CLIR). We adopt the view that verbs with similar argument structure share certain meaning components, but that those meaning components are more relevant to argument realization than to idiosyncratic verb meaning. We verify this by demonstrating that verbs with similar argument structure as encoded in Lexical Conceptual Structure (LCS) are rarely synonymous in WordNet. We then use the results of this work to guide our implementation of an algorithm for cross-language selection of lexical items, exploiting the strengths of each resource: LCS for semantic structure and WordNet for semantic content. We use the Parka Knowledge-Based System to encode LCS representations and WordNet synonym sets and we implement our lexical-selection algorithm as Parka-based queries into a knowledge base containing both information types. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,909 |
inproceedings | gerber-hovy-1998-improving | Improving translation quality by manipulating sentence length | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.39/ | Gerber, Laurie and Hovy, Eduard | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 448--460 | Translation systems tend to have more trouble with long sentences than with short ones for a variety of reasons. When the source and target languages differ rather markedly, as do Japanese and English, this problem is reflected in lower quality output. To improve readability, we experimented with automatically splitting long sentences into shorter ones. This paper outlines the problem, describes the sentence splitting procedure and rules, and provides an evaluation of the results. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,910 |
inproceedings | alam-1998-machine | Machine translation among languages with transitivity divergences using the causal relation in the interlingual lexicon | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.40/ | Alam, Yukiko Sasaki | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 461--471 | This paper proposes a design of verb entries in Interlingua to facilitate the machine translation (MT) of two languages with transitivity divergence as derived from their shared and individual linguistic characteristics. It suggests that the transitivity difference is best treated with verb entries containing information of the causal relation of the expressed events. It also demonstrates how the proposed design of verb entries gives a principled treatment of aspect divergence in semantically corresponding verbs of a source language (SL) and a target language (TL). Although the current paper focuses on English and Japanese, the proposed treatment should be applicable to the MT of similarly divergent languages, since the proposed lexicon in language-independent Interlingua contains information on causal relations of events as necessary to bridge the transitivity difference. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,911 |
inproceedings | oard-1998-comparative | A comparative study of query and document translation for cross-language information retrieval | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.41/ | Oard, Douglas W. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 472--483 | Cross-language retrieval systems use queries in one natural language to guide retrieval of documents that might be written in another. Acquisition and representation of translation knowledge plays a central role in this process. This paper explores the utility of two sources of translation knowledge for cross-language retrieval. We have implemented six query translation techniques that use bilingual term lists and one based on direct use of the translation output from an existing machine translation system; these are compared with a document translation technique that uses output from the same machine translation system. Average precision measures on a TREC collection suggest that arbitrarily selecting a single dictionary translation is typically no less effective than using every translation in the dictionary, that query translation using a machine translation system can achieve somewhat better effectiveness than simpler techniques, and that document translation may result in further improvements in retrieval effectiveness under some conditions. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,912 |
inproceedings | miller-zajic-1998-lexicons | Lexicons as gold: mining, embellishment and reuse | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-papers.42/ | Miller, Keith J. and Zajic, David M. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers | 484--493 | Given the high labor costs of developing new lexical resources for Machine Translation (MT) and language processing systems, it is desirable to make the most of those resources already in existence. This paper describes the work being carried out on two MT projects that share a common goal: the creation, maintenance and reuse of lexical information. This goal calls into play a range of tasks from dictionary mining of machine-readable dictionaries (MRDs) to the definition of a repository capable of housing this diverse lexical information. This paper outlines the two efforts, focusing on the problems encountered and the intermediate results achieved. While the ultimate goal of the automated processing of on-line resources into multi-purpose lexical repositories is far from being achieved, our experience has shown that there are significant applications that can make use of the partially processed information produced en route. We will describe our experience with two projects, with a focus on one which utilized multiple lexical resources to provide the basis for two natural language processing (NLP) tools: a segmenter and a glosser for Thai. Finally, we make recommendations for future resource development, with a view toward mitigating the difficulties of merging information from diverse sources. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,913 |
inproceedings | cote-1998-system | System description/demo of {A}lis {T}ranslation {S}olutions: overview | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.1/ | C{\^o}t{\'e}, Nathalie | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 494--497 | Part software, part process, Alis Translation Solutions (ATS) address the language barrier by tightly integrating a variety of language tools and services which include machine and human translation, on-line dictionaries, search engines, workflow and management tools. During the AMTA-98 conference, Alis Technologies is demonstrating various applications of ATS: Web and Intranet Publishing, Web Browsing, Company Document Circulation, E-mail Communication and Multilingual Site Search. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,914 |
inproceedings | westfall-1998-integrating | Integrating tools with the translation process | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.3/ | Westfall, Edith R. | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 501--505 | Translation tools can be integrated with the translation process with the goal and result of increasing consistency, reusing previous translations, and decreasing the amount of time needed to put a product on the market. This system demonstration will follow a document through the translation cycle utilizing a combination of TRADOS Translator`s Workbench 2.0 (translation memory), machine translation, and human translation. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,916 |
inproceedings | ripplinger-1998-emis | {EMIS} | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.4/ | Ripplinger, B{\"arbel | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 506--509 | The objective of the emis project is the conception and realization of a web-based multilingual information system on European media law with the following functionalities: search by words, a combination of words, phrases or keywords; guided search by using a so-called thematic structure; cross language retrieval of documents in different languages with one monolingual query by using language processing and MT technology; exploitation of additional information for the retrieved documents, which is stored in a database; structured representation of the document archive, the so-called dogmatic structure; multilingual user interface. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,917 |
inproceedings | kinoshita-1998-open | An open transfer translation | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.5/ | Kinoshita, Jorge | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 510--513 | We are developing an English-Portuguese Transfer Machine. The transfer machine operates in three phases: the analysis phase is done according to a dependency grammar, the transfer phase is done according to a transfer dictionary and the generation phase conjugates the Portuguese words. The user interface is done through the web. Our system is {\textquotedblleft}open{\textquotedblright} because the user can view intermediate structures generated by the system and change the database system in order to correct the text during the revision process. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,918 |
inproceedings | liu-yu-1998-transeasy | {T}rans{E}asy: A {C}hinese-{E}nglish machine translation system based on hybrid approach | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.6/ | Liu, Qun and Yu, Shiwen | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 514--517 | This paper describes the progress of a machine translation system from Chinese to English. The system is based on a reusable platform of MT software components. It`s a rule-based system, and some statistical algorithms are used as heuristic functions in parsing as well. There are about 50,000 Chinese words and 400 global parsing rules in the system. The system got a good result in a public test of MT system in China in Mar. 1998. It is a research vehicle up to now. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,919 |
inproceedings | chalabi-1998-sakhr | Sakhr {A}rabic-{E}nglish computer-aided translation system | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.7/ | Chalabi, Achraf | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 518--521 | Automation of the whole translation process using computers and machine translation systems did not fulfill,so far, the ever-growing needs for translation. On the other hand, Computer-aided translation systems have tackled the translation process by first concentrating on those mechanical tasks performed during the translation, then by gradually automating those intellingent (creative) tasks. This has resulted in useful systems that both increase translator`s productivity and guarantee better cinsistency across translation jobs. This paper describes Sakhr Cat system which has been specifically designed to support document, web page translation and software localisation for the Arabic-English language pair. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,920 |
inproceedings | cote-1998-system-description | System description/demo of {A}lis {T}ranslation {S}olutions application: multilingual search and query expansion | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.8/ | C{\^o}t{\'e}, Nathalie | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 522--525 | Alis Technologies partnered with Verity to develop a new multilingual search and retrieval technology. This tool enables the translation of search queries into multiple languages, and allows the search results to be translated back into the language of the query. This important component of the Alis Translation Solutions, a family of products and services designed to provide the highly tailored and integrated translation solutions that large corporations require, will be demonstrated at AMTA-98. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,921 |
inproceedings | orliac-1998-logos8 | Logos8 system description | Farwell, David and Gerber, Laurie and Hovy, Eduard | oct # " 28-31" | 1998 | Langhorne, PA, USA | Springer | https://aclanthology.org/1998.amta-systems.9/ | Orliac, Brigitte | Proceedings of the Third Conference of the Association for Machine Translation in the Americas: System Descriptions | 526--530 | The globalization of the information exchange made possible by the Internet and the World Wide Web has led to an increasing demand for translation and other language-enabled tools and services. Developers of Machine Translation (MT) systems are best positioned to address the international community ever growing need for information processing technologies. Today Logos offers its MT technology in a relational model on NT and Unix servers with net-centric Java clients. The new model realized in Logos8 is also preparing the system for use on the Internet as an information-gathering utility. This paper describes the new Logos8 system and presents the product developments made possible by the new system. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 97,922 |
inproceedings | hovy-1997-gentle | A gentle introduction to {MT}: theory and current practice | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-tutorials.1/ | Hovy, Eduard | Proceedings of Machine Translation Summit VI: Tutorials | null | This tutorial provides a nontechnical introduction to machine translation. It reviews the whole scope of MT, outlining briefly its history and the major application areas today, and describing the various kinds of MT techniques that have been invented{---}from direct replacement through transfer to the holy grail of interlinguas. It briefly outlines the newest statistics-based techniques and provides an introduction to the difficult questions of MT evaluation. Topics include: History and development of MT; Theoretical foundations of MT; Traditional and modern MT techniques; Newest MT research; Thorny questions of evaluating MT systems | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,464 |
inproceedings | leon-1997-make | How to make {MT} work for you | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-tutorials.2/ | Le{\'o}n, Marjorie | Proceedings of Machine Translation Summit VI: Tutorials | null | A successful MT operation is the result of good planning, an incremental approach, dedicated and talented people, and MT software that is capable of handling the types of text to be translated. The presenter will share insights gained during 20 years of experience with the development and implementation of machine translation at the Pan American Health Organization and the experiences of users of several MT systems. Topics include: evaluating candidate systems, making a commitment, preparing the environment, training, choosing input texts, postediting, building the dictionaries, requesting program enhancements, monitoring progress, and justifying the investment. The MT software available today can increase your productivity if you are willing to put in some initial effort to learn the system and tailor it to your needs. Then MT will start working for you! | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,465 |
inproceedings | white-1997-mt | {MT} evaluation: old, new, and recycled | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-tutorials.3/ | White, John | Proceedings of Machine Translation Summit VI: Tutorials | null | The tutorial addresses the issues peculiar to machine translation evaluation, namely the difficulty in determining what constitutes correct translation, and which types of evaluation are the most meaningful for evaluation ``consumers.'' The tutorial is structured around evaluation methods designed for particular purposes: types of MT design, stages in the development lifecycle, and intended end-use of a system that includes MT. It will provide an overview of the issues and classic approaches to MT evaluation. The traditional processes, such as those outlined in the ALPAC report, will be examined for their value historically and in terms of today`s environments. The tutorial also provides an insight into the latest evaluation techniques, designed to capture the value of MT systems in the context of current and future automated text handling processes. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,466 |
inproceedings | spalink-1997-post | Post-editing {MT} | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-tutorials.4/ | Spalink, Karin | Proceedings of Machine Translation Summit VI: Tutorials | null | The tutorial will introduce purpose-dependent levels of translation. The levels will be defined and it will be shown how to correct errors in relation to those levels. Error collection procedures as well as file storage and naming procedures will be discussed. Examples will be discussed that show how to read MT output for a particular level of translation. The implications of a purpose-oriented interpretation on client relations will also be introduced, and helpful hints on how to deal with the new parameters will be given. No previous knowledge of machine translation is required for successful participation in this session. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,467 |
inproceedings | pedtke-1997-u | {U}.{S}. Government Support and Use of Machine Translation: Current Status | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-plenaries.1/ | Pedtke, Thomas R. | Proceedings of Machine Translation Summit VI: Plenaries | 3--13 | The United States Government has filled a key role in the development and application of Machine Translation technology for over four decades. A recent study by the White House Office of Science and Technology has reaffirmed the importance of this role. Two key world events, the emergence of Internet technology and the collapse of the former Soviet Union, have stimulated rapid changes in the status of Machine Translation requirements and applications. A continuing need for Machine Translation systems in the United States military along with the application of Machine Translation systems on key United States Government networks has made Machine Translation systems available to tens of thousands of users. Advances in automating textual information processes and in testing and evaluation of the technology has further stimulated Machine Translation development and applications. Although budget reductions will impact this continuing growth, renewed cooperation will ameliorate some of the impact and the emerging widespread use of Machine Translation could reverse the budget trends. Age old arguments between linguists and Machine Translation advocates seem to be giving way to recognition of mutual dependence and the potential for Win/Win outcomes. The past five years have witnessed an accelerated exposure and application of Machine Translation technology in the United States Government unequaled in its 40 year history. However, with some budgetary adjustments, the next five years could be truly phenomenal. Advocates for Machine Translation technology and its applications are poised to meet the 21st Century and the Information Age with renewed vigor and practical applications which promise to end the debate over Machine Translation`s viability forever. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,468 |
inproceedings | hutchins-1997-first | First steps in Mechanical Translation | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-plenaries.2/ | Hutchins, John | Proceedings of Machine Translation Summit VI: Plenaries | 14--23 | Although the first ideas for mechanical translation were made in the seventeenth century, it was not until this century that means became available for realization with the appearance of the electronic computer in the mid 1940s. Fifty years ago, in March 1947 Warren Weaver wrote to Norbert Wiener and met Andrew Booth, mentioning to both the use of computers for translation. The possibilities were investigated during the next seven years, until in January 1954 the first prototype program was demonstrated. This article is a brief chronicle of these early years of mechanizing translation processes. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,469 |
inproceedings | nagao-1997-machine | Machine Translation Through Language Understanding | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-plenaries.11/ | Nagao, Makoto | Proceedings of Machine Translation Summit VI: Plenaries | 41--49 | In this paper is described a general framework of a next generation machine translation system which translates a text not sentence by sentence but by considering inter-sentential discourse. The method is a step closer to human translation than the present-day machine translation systems. Particularly important are a detailed discourse analysis and a flexible text generation by using information obtained from the discourse analysis. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,478 |
inproceedings | somers-1997-current | The Current State of Machine Translation | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-plenaries.12/ | Somers, Harold L. | Proceedings of Machine Translation Summit VI: Plenaries | 115--124 | This paper aims to survey the current state of research, development and use of Machine Translation (MT). Under {\textquoteleft}research' the role of linguistics is discussed, and contrasted with research in {\textquoteleft}analogy- based' MT. The range of languages covered by MT systems is discussed, and the lack of development for minority languages noted. The new research area of spoken language translation (SLT) is reviewed, with some major differences between SLT and text MT described. Under {\textquoteleft}use and users' we discuss tools for users: Translation Memory, bilingual concordances and software to help checking for mistranslations. The use of MT on the World Wide Web is also discussed, regarding pre- and post-editing, the impact of {\textquoteleft}controlled language' is reviewed, and finally a proposal is made that MT users can revise the input text in the light of errors that the system makes, thus {\textquoteleft}post-editing the source text'. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,479 |
inproceedings | maegaard-1997-whither | Whither {MT}? | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-plenaries.13/ | Maegaard, Bente | Proceedings of Machine Translation Summit VI: Plenaries | 191--199 | MT started out as a {\textquoteleft}technology push': more than 50 years ago, researchers had the bright idea of doing translation with the use of the newly developed computers. MT remained in the technology push area for many years. However, in the nineties we are seeing the {\textquoteleft}market pull' beginning to play a role and there are good reasons to believe that this trend will continue. MT is going where the market and the users wants it to go, and MT will be prospering in the future. MT will be available electronically over the network, and MT will be available in environments which also offer a variety of other tools for translation, as well as tools for other types of information management. Also in research and in development of new technologies, MT will further develop, e.g. along the lines of knowledge-based MT, advanced integration of different analysis techniques (rule-based, statistics-based, etc.), integration with speech etc. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,480 |
inproceedings | brundage-etal-1997-managing | Managing Distributed {MT} Projects Today {---} A New Challenge | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.3/ | Brundage, Jennifer A. and McCormick, Susan and Pyne, Chris | Proceedings of Machine Translation Summit VI: Papers | 58--63 | The current trend towards globalization means that even the most modern of industries must constantly re-evaluate its strategies and adapt to new technologies. As a long-time supporter of MT technology, SAP has shown that it can make productive use of competitive, commercial MT products along with other CAT products. In making MT work for them, however, SAP has also had to substantially adapt the products that they received from MT companies. The result, after many years, is a full range of peripheral tools and workflow scenarios that support the use of their MT programs. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,483 |
inproceedings | thurmair-1997-exchange | Exchange Interfaces for Translation Tools | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.5/ | Thurmair, Gregor | Proceedings of Machine Translation Summit VI: Papers | 74--93 | The following paper presents an overview of current discussions of exchange interfaces in the area of multilingual processing. It first discusses the principles which are relevant for the definition of such interfaces; it then presents a state of the art and a proposal in the area of text interfaces, translation memory interfaces, and terminology exchange. The approach is bottom-up, i.e. it starts from existing interfaces and existing requirements, and intends to be of practical use. It reflects the discussions in current multilingual research projects of the EC, like OTELO and AVENTINUS. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,485 |
inproceedings | gerber-1997-r | {R}{\&}{D} for Commercial {MT} | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.6/ | Gerber, Laurie | Proceedings of Machine Translation Summit VI: Papers | 94--97 | MT research in the commercial environment tends to be conservative, and to introduce change gradually, both because of limited funds, and the need to quickly turn innovations into product features. However, there are a number of challenges and opportunities that could make commercial research a much more dynamic environment for advancement of the field as a whole. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,486 |
inproceedings | bech-1997-mt | {MT} from an Everyday User`s Point of View | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.7/ | Bech, Annelise | Proceedings of Machine Translation Summit VI: Papers | 98--105 | This paper discusses the experiences of the specialised Danish translation company Lingtech in its use of MT for the translation of technical texts. The background and motivation for setting up Lingtech as an MT-based company is outlined. After a short general presentation of the PaTrans MT-system, the different tasks we have to perform in relation to our use of MT and the way this work is organized in order to achieve maximum cost-efficiency are described. This leads on to the discussion of problem areas for the everyday user in terms of ergonomy and tools for what may be called `peripheral' tasks, e.g. pre- and post-editing texts, and dictionary maintenance. In the course of gaining experience in running an MT-based organization, we have identified crucial areas, where even relatively simple tools can have quite an impact on the overall productivity and profitability of using MT. Given the state-of-the-art within language technology many useful tools can now be made for the MT-user; however, we argue that too little attention has been given to these aspects so far and that they may indeed be critical to the commercial success of machine translation. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,487 |
inproceedings | bezhanova-1997-translating | Translating Scientific Texts using {MT} and {MAT} Ssytems: Practical Experience of a Professional Translator | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.8/ | Bezhanova, Olga | Proceedings of Machine Translation Summit VI: Papers | 106--114 | The paper describes practical experience of a professional translator. The task consisted in translating 400 pages of Russian scientific materials (covering all fundamental sciences) into English within a month. The job was fulfilled using three computer-based systems: PARS, a Russian-English bidirectional machine translation system by Lingvistica `93 Co., Polyglossum, dictionary-support software by ETS Ltd., and the Random House electronic dictionary of the English language. The paper analyzes the pluses and minuses of translating scientific texts using computer programs, and gives numerous examples of translations. The main conclusion is that machine translation has no reasonable alternative when a large volume of scientific texts is to be translated professionally within a short period of time. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,488 |
inproceedings | farwell-helmreich-1997-user | User-Friendly Machine Translation: Alternate Translations Based on Differing Beliefs | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.9/ | Farwell, David and Helmreich, Stephen | Proceedings of Machine Translation Summit VI: Papers | 125--131 | In this paper the authors present a notion of {\textquotedblleft}user-friendly{\textquotedblright} translation and describe a method for achieving it within a pragmatics-based approach to machine translation. The approach relies on modeling the beliefs of the participants in the translation process: the source language speaker and addressee, the translator and the target language addressee. Translation choices may vary according to how beliefs are ascribed to the various participants and, in particular, {\textquotedblleft}user-friendly{\textquotedblright} choices are based on the beliefs ascribed to the TL addressee. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,489 |
inproceedings | kamei-etal-1997-sharable | Sharable Formats and Their Supporting Environments for Exchanging User Dictionaries among Different {MT} Systems as a Part of {AAMT} Activities | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.10/ | Kamei, Shin-ichiro and Itoh, Etsuo and Fujii, Mikiko and Hirai, Tokuyuki and Saitoh, Yukari and Takahashi, Masahito and Hiyama, Tsutomu and Muraki, Kazunori | Proceedings of Machine Translation Summit VI: Papers | 132--141 | We, machine translation providers, as members of Asia-Pacific Association for Machine Translation (AAMT), are now establishing environments for sharing and exchanging user dictionaries among different machine translation systems. In order for users to utilize machine translation systems more effectively, we define common formats of user dictionaries, and establish electronic environments available for users to exchange their user dictionaries using these common formats. This task started in 1996, and the formats will be fixed in March of 1998. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,490 |
inproceedings | isahara-1997-jeidas | {JEIDA}`s Bilingual Corpus and Other Corpora for {NLP} Research in {J}apan | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.11/ | Isahara, Hitoshi | Proceedings of Machine Translation Summit VI: Papers | 142--147 | The committee on text processing technology of JEIDA (Japan Electronics Industry Development Association) has been developing its bilingual corpus for research on machine translation systems since the 1996 Japanese fiscal year. An overview of this bilingual corpus is presented in this paper. And other linguistic data recently developed in Japan, which includes the RWC text database and the simple sentence data by the CRL and IPA. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,491 |
inproceedings | mima-etal-1997-multi | Multi-Lingual Spoken Dialog Translation System Using Transfer-Driven Machine Translation | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.12/ | Mima, Hidecki and Furuse, Osamu and Wakita, Yumi and Iida, Hitoshi | Proceedings of Machine Translation Summit VI: Papers | 148--155 | This paper describes a Transfer-Driven Machine Translation (TDMT) system as a prototype for efficient multi-lingual spoken-dialog translation. Currently, the TDMT system deals with dialogues in the travel domain, such as travel scheduling, hotel reservation, and trouble-shooting, and covers almost all expressions presented in commercially-available travel conversation guides. In addition, to put a speech dialog translation system into practical use, it is necessary to develop a mechanism that can handle the speech recognition errors. In TDMT, robust translation can be achieved by using an example-based correct parts extraction (CPE) technique to translate the plausible parts from speech recognition results even if the results have several recognition errors. We have applied TDMT to three language pairs, i.e., Japanese-English, Japanese-Korean, Japanese-German. Simulations of dialog communication between different language speakers can be provided via a TCP/IP network. In our performance evaluation for the translation of TDMT utilizing 69-87 unseen dialogs, we achieved about 70{\%} acceptability in the JE, KJ translations, almost 60{\%} acceptability in the EJ and JG translations, and about 90{\%} acceptability in the JK translations. In the case of handling erroneous sentences caused by speech recognition errors, although almost all translation results end up as unacceptable translation in conventional methods, 69{\%} of the speech translation results are improved by the CPE technique. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,492 |
inproceedings | tanaka-1997-mt | {MT} {R}{\&}{D} in {A}sia | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.13/ | Tanaka, Hozumi | Proceedings of Machine Translation Summit VI: Papers | 156--164 | There is a big shift in MT R{\&}D in this region after many large-scale projects conducted in the past ten years. Multi-lingual Machine Translation (MMT) project is one of the significant R{\&}D projects that increased a great number of NLP related researchers and research activities which can be seen in the increasing number of the research institutes in the recent years. We learned a lot from the collaboration research across languages and we still hope that it will be a rigorous step for the future MT R{\&}D in this region. Though the MT systems are still far from the extreme goal of the perfect translation, it can be observed that the MT systems are actually used to support information retrieval from the Internet. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,493 |
inproceedings | chang-su-1997-corpus | Corpus-Based Statistics-Oriented ({CBSO}) Machine Translation Researches in {T}aiwan | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.14/ | Chang, Jing-Shin and Su, Keh-Yih | Proceedings of Machine Translation Summit VI: Papers | 165--173 | A brief introduction to the MT research projects in Taiwan is given in this paper. Special attention is given to the more and more popular corpus-based statistics-oriented (CBSO) approaches in MT researches. In particular, the parameterized two-way training philosophy in designing the second generation BehaviorTran, which is the first and the largest operational system in this area, is introduced in this paper. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,494 |
inproceedings | blekhman-etal-1997-pars | {PARS}/{U} for Windows: The World`s First Commercial {E}nglish-{U}krainian and {U}krainian-{E}nglish Machine Translation System | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.16/ | Blekhman, Michael S. and Rakova, Alla and Kursin, Andrei | Proceedings of Machine Translation Summit VI: Papers | 176--179 | The paper describes the PARS/U Ukrainian-English bidirectional MT system by Lingvistica `93 Co. PARS/U translates MS Word and HTML files as well as screen Helps. It features an easy-to-master dictionary updating program, which permits the user to customize the system by means of running subject-area oriented texts through the MT engine. PARS/U is marketed in Ukraine and North America. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,496 |
inproceedings | schwall-thurmair-1997-metal | From {METAL} to T1: Systems and Components for Machine Translation Applications | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.17/ | Schwall, Ulrike and Thurmair, Gregor | Proceedings of Machine Translation Summit VI: Papers | 180--190 | This paper describes the progress which has been made to make MT systems usable in professional environments. After many years of significant investment, it was decided that the time was ripe for the METAL machine translation system to be better positioned in the market place. Two lines of action were followed: Introducing the system onto the PC market, using the GMS-T1 as a concrete example; Reusing system components in customized solutions, using the AVENTINUS project as an example, which is a multilingual information processing application. Both lines of action have far-reaching consequences for system development. But they also create new opportunities to improve the system`s capabilities and flexibility. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,497 |
inproceedings | gerber-yang-1997-systran | {SYSTRAN} {MT} Dictionary Development | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.19/ | Gerber, Laurie and Yang, Jin | Proceedings of Machine Translation Summit VI: Papers | 211--218 | YSTRAN has demonstrated success in the MT field with its long history spanning nearly 30 years. As a general-purpose fully automatic MT system, SYSTRAN employs a transfer approach. Among its several components, large, carefully encoded, high-quality dictionaries are critical to SYSTRAN`s translation capability. A total of over 2.4 million words and expressions are now encoded in the dictionaries for twelve source language systems (30 language pairs - one per year!). SYSTRAN`S dictionaries, along with its parsers, transfer modules, and generators, have been tested on huge amounts of text, and contain large terminology databases covering various domains and detailed linguistic rules. Using these resources, SYSTRAN MT systems have successfully served practical translation needs for nearly 30 years, and built a reputation in the MT world for their large, mature dictionaries. This paper describes various aspects of SYSTRAN MT dictionary development as an important part of the development and refinement of SYSTRAN MT systems. There are 4 major sections: 1) Role and Importance of Dictionaries in the SYSTRAN Paradigm describes the importance of coverage and depth in the dictionaries; 2) Dictionary Structure discusses the specifics of dictionary structure and types of information represented; 3) Dictionary Creation and Update describes the strategy and mechanics of the dictionary development; 4) Past. Present and Future Development provides some perspective on where SYSTRAN has come from and where it is going. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,499 |
inproceedings | read-etal-1997-java | {J}ava and Its Role in Natural Language Processing and Machine Translation | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.21/ | Read, Tim and B{\'a}rcena, Elena and Faber, Pamela | Proceedings of Machine Translation Summit VI: Papers | 224--231 | The Java programming language started as the language Oak when the World Wide Web was still being developed at CERN. It has gained popularity since its launch as a programming language capable of being used to develop applications which can run across the Internet (as well as local stand-alone programs). As with many technologies associated with the World Wide Web, there is a lot of `hype', confusion, and misinformation. Consequently, while many researchers in the area of Natural Language Processing and Machine Translation will have heard of Java, may be considering using it, or even have got as far as their first `Hello World' applet, they are probably not fully aware of what the implications of using this language are, and what possible role it could have in the development of computational linguistic applications, either intended to run locally on a wide range of computing platforms, or remotely across the Internet. This paper sets out to address this issue by presenting Java in a clear, concise fashion and considering how it may be used in computational linguistic applications. A requirements analysis for a generic Natural Language Processing and Machine Translation tool is undertaken to consider how Java could be used, and subsequently two example systems developed in Java (which can be accessed on the Internet) are introduced. Finally, pointers to Java resources are presented so that researchers interested in using this language can both install it and learn how to program it. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,501 |
inproceedings | nubel-1997-end | End-to-End Evaluation in {VERBMOBIL} {I} | Teller, Virginia and Sundheim, Beth | oct # " 29 – " # nov # " 1" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-papers.22/ | N{\"ubel, Rita | Proceedings of Machine Translation Summit VI: Papers | 232--239 | VERBMOBIL is a speech-to-speech translation system for spoken dialogues between two speakers. The application scenario is appointment scheduling for business meetings, with spoken dialogues between two speakers. Both dialogue participants have at least a passive knowledge of English which serves as intermediate language1. The transfer directions are German to English and Japanese to English. A special feature of VERBMOBIL is that translations are produced on demand when the dialogue participants are unable to express themselves in English and therefore prefer to use their mother tongue. In this paper2 we present the criteria and the evaluation procedure for evaluating the translation quality of the VERBMOBIL prototype. The evaluated data have been produced by three concurrent processing methods that are integrated in the VERBMOBIL prototype. These processing methods differ with respect to processing depth, processing speed and translation quality ([2], p. 2). The paper is structured as follows: we start by giving a short description of the VERBMOBIL architecture focusing on the concurrent linguistic analyses and transfer processes which lead to three alternative translation outputs for each turn3. In section two we outline the evaluation procedure and criteria. The third section discusses the evaluation results, and the conclusion of the paper gives an outlook to future applications of automated evaluation procedures for machine translation (MT) based on an MT architecture where several concurrent translation approaches are integrated. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,502 |
inproceedings | dorr-etal-1997-spanish | {S}panish {E}uro{W}ord{N}et and {LCS}-based interlingual {MT} | null | oct # " 28" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-workshop.3/ | Dorr, Bonnie J. and Mart{\'i}, M. Antonia and Castell{\'o}n, Irene | AMTA/SIG-IL First Workshop on Interlinguas | 19--31 | We present a machine translation framework in which the interlingua{---} Lexical Conceptual Structure (LCS){---}is coupled with a definitional component that includes bilingual (EuroWordNet) links between words in the source and target languages. While the links between individual words are language-specific, the LCS is designed to be a language-independent, compositional representation. We take the view that the two types of information{---}shallower, transfer-like knowledge as well as deeper, compositional knowledge{---}can be reconciled in interlingual machine translation, the former for overcoming the intractability of LCS-based lexical selec- tion, and the latter for relating the underlying semantics of two words cross-linguistically. We describe the acquisition process for these two information types and present results of hand-verification of the acquired lexicon. Finally, we demonstrate the utility of the two information types in interlingual MT. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,534 |
inproceedings | dorr-etal-1997-toward | Toward compact monotonically compositional interlingua using lexical aspect | null | oct # " 28" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-workshop.4/ | Dorr, Bonnie J. and Olsen, Mari Broman and Thomas, Scott C. | AMTA/SIG-IL First Workshop on Interlinguas | 33--43 | We describe a theoretical investigation into the semantic space described by our interlingua (IL), which currently has 191 main verb classes divided into 434 subclasses, represented by 237 distinct Lexical Conceptual Structures (LCSs). Using the model of aspect in Olsen (1994; 1997){---}monotonic aspectual composition{---}we have identified 71 aspectually basic subclasses that are associated with one or more of 68 aspectually non-basic classes via some lexical ({\textquotedblleft}type-shifting{\textquotedblright}) rule (Bresnan, 1982; Pinker, 1984; Levin and Rappaport Hovav, 1995). This allows us to refine the IL and address certain computational and theoretical issues at the same time. (1) From a linguistic viewpoint, the expected benefits include a refinement of the aspectual model in (Olsen, 1994; Olsen, 1997) (which provides necessary but not sufficient conditions for aspectual com- position), and a refinement of the verb classifications in (Levin, 1993); we also expect our approach to eventually produce a systematic definition (in terms of LCSs and compositional operations) of the precise meaning components responsible for Levin`s classification. (2) Computationally, the lexicon is made more compact. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,535 |
inproceedings | kamei-muraki-1997-interlingua | Interlingua developed and utilized in real multilingual {MT} product systems | null | oct # " 28" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-workshop.8/ | Kamei, Shin-ichiro and Muraki, Kazunori | AMTA/SIG-IL First Workshop on Interlinguas | 59--69 | This paper describes characteristics of an interlingua we have developed. It contains a large lexicon and has been tested on actual MT systems in the translation of large volumes of actual documents. The main characteristics of the interlingua are as follows: (1) Conceptual primitives, elements of the interlingua, can be linked to any parts of speech in English or Japanese. (2) Positions of the top node on the interlingua correspond to differences in syntactic structures. (3) Two or more conceptual graphs can be used for expressing the same concept, and can be converted to another by conceptual transformation rules which are independent of any specific language. (4) Conceptual primitives are divided into two classes; (a) functional conceptual primitives, which are finite and manageable and constitute, along with rules for interpreting conceptual graphs, the grammar of the interlingua, and (b) general conceptual primitives, which correspond to specific words in actual languages and which, depending on the direction of translation, may or may not be used. Our commercial MT products using the interlingua produce results of roughly the same or higher quality than systems using the syntactic transfer method, which fact indicates the feasibility of the interlingua approach. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,539 |
inproceedings | olsen-etal-1997-using | Using {W}ord{N}et to posit hierarchical structure in Levin`s verb classes | null | oct # " 28" | 1997 | San Diego, California | null | https://aclanthology.org/1997.mtsummit-workshop.13/ | Olsen, Mari Broman and Dorr, Bonnie J. and Clark, David J. | AMTA/SIG-IL First Workshop on Interlinguas | 99--110 | In this paper we report on experiments using WordNet synset tags to evaluate the semantic properties of the verb classes cataloged by Levin (1993). This paper represents ongoing research begun at the University of Pennsylvania (Rosenzweig and Dang, 1997; Palmer, Rosenzweig, and Dang, 1997) and the University of Maryland (Dorr and Jones, 1996b; Dorr and Jones, 1996a; Dorr and Jones, 1996c). Using WordNet sense tags to constrain the intersection of Levin classes, we avoid spurious class intersections introduced by homonymy and polysemy (run a bath, run a mile). By adding class intersections based on a single shared sense-tagged word, we minimize the impact of the non-exhaustiveness of Levin`s database (Dorr and Olsen, 1996; Dorr, To appear). By examining the syntactic properties of the intersective classes, we provide a clearer picture of the relationship between WordNet/EuroWordNet and the LCS interlingua for machine translation and other NLP applications. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,544 |
inproceedings | steedman-1997-making | Making Use of Intonation in Interactive Dialogue Translation | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.4/ | Steedman, Mark | Proceedings of the Fifth International Workshop on Parsing Technologies | xix | Intonational information is frequently discarded in speech recognition, and assigned by default heuristics in text-to-speech generation. However, in many applications involving dialogue and interactive discourse, intonation conveys significant information, and we ignore it at our peril. Translating telephones and personal assistants are an interesting test case, in which the salience of rapidly shifting discourse topics and the fact that sentences are machine-generated, rather than written by humans, combine to make the application particularly vulnerable to our poor theoretical grasp of intonation and its functions. I will discuss a number of approaches to the problem for such applications, ranging from cheap tricks to a combinatory grammar-based theory of the semantics involved and a syntax-phonology interface for building and generating from interpretations. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,548 |
inproceedings | blache-1997-disambiguating | Disambiguating with Controlled Disjunctions | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.5/ | Blache, Philippe | Proceedings of the Fifth International Workshop on Parsing Technologies | 1--7 | In this paper, we propose a disambiguating technique called controlled disjunctions. This extension of the so-called named disjunctions relies on the relations existing between feature values (covariation, control, etc.). We show that controlled disjunctions can implement different kind of ambiguities in a consistent and homogeneous way. We describe the integration of controlled disjunctions into a HPSG feature structure representation. Finally, we present a direct implementation by means of delayed evaluation and we develop an example within the functional programming paradigm. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,549 |
inproceedings | carroll-weir-1997-encoding | Encoding Frequency Information in Lexicalized Grammars | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.6/ | Carroll, John and Weir, David | Proceedings of the Fifth International Workshop on Parsing Technologies | 8--17 | We address the issue of how to associate frequency information with lexicalized grammar formalisms, using Lexicalized Tree Adjoining Grammar as a representative framework. We consider systematically a number of alternative probabilistic frameworks, evaluating their adequacy from both a theoretical and empirical perspective using data from existing large treebanks. We also propose three orthogonal approaches fo r backing off probability estimates to cope with the large number of parameters involved. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,550 |
inproceedings | chen-vijay-shankar-1997-towards | Towards a Reduced Commitment, {D}-Theory Style {TAG} Parser | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.7/ | Chen, John and Vijay-Shankar, K. | Proceedings of the Fifth International Workshop on Parsing Technologies | 18--29 | Many traditional TAG parsers handle ambiguity by considering all of the possible choices as they unfold during parsing. In contrast , D-theory parsers cope with ambiguity by using underspecified descriptions of trees. This paper introduces a novel approach to parsing TAG, namely one that explores how D-theoretic notions may be applied to TAG parsing. Combining the D-theoretic approach to TAG parsing as we do here raises new issues and problems. D-theoretic underspecification is used as a novel approach in the context of TAG parsing for delaying attachment decisions. Conversely, the use of TAG reveals the need for additional types of underspecification that have not been considered so far in the D-theoretic framework. These include combining sets of trees into their underspecified equivalents as well as underspecifying combinations of trees. In this paper, we examine various issues that arise in this new approach to TAG parsing and present solutions to some of the problems. We also describe other issues which need to be resolved for this method of parsing to be implemented. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,551 |
inproceedings | ciravegna-lavelli-1997-controlling | Controlling Bottom-Up Chart Parsers through Text Chunking | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.8/ | Ciravegna, Fabio and Lavelli, Alberto | Proceedings of the Fifth International Workshop on Parsing Technologies | 30--41 | In this paper we propose to use text chunking for controlling a bottom-up parser. As it is well known, during analysis such parsers produce many constituents not contributing to the final solution(s). Most of these constituents are introduced due to t he parser inability of checking the input context around them. Preliminary text chunking allows to focus directly on the constituents that seem more likely and to prune the search space in the case some satisfactory solutions are found. Preliminary experiments show that a CYK-like parser controlled through chunking is definitely more efficient than a traditional parser without significantly losing in correctness. Moreover the quality of possible partial results produced by the controlled parser is high. The strategy is particularly suited for tasks like Information Extraction from text (IE) where sentences are often long and complex and it is very difficult to have a complete coverage. Hence, there is a strong necessity of focusing on the most likely solutions; furthermore, in IE the quality of partial results is important . | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,552 |
inproceedings | cremers-1997-pruning | Pruning Search Space for Parsing Free Coordination in Categorial Grammar | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.9/ | Cremers, Crit | Proceedings of the Fifth International Workshop on Parsing Technologies | 42--53 | The standard resource sensitive invariants of categorial grammar are not suited to prune search space in the presence of coordination. We propose a weaker variant of count invariancy in order to prune the search space for parsing coordinated sentences at a stage prior to proper parsing. This Coordinative Count Invariant is argued to be the strongest possible instrument to prune search space for parsing coordination in categorial grammar. Its mode of operation is explained, and its effect at pruning search space is exemplified. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,553 |
inproceedings | evans-weir-1997-automaton | Automaton-based Parsing for Lexicalised Grammars | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.11/ | Evans, Roger and Weir, David | Proceedings of the Fifth International Workshop on Parsing Technologies | 66--76 | In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that during parsing some of the computation associated with different structures is duplicated. This paper explores ways in which the grammar can be precompiled into finite state automata so that some of this shared structure results in shared computation at run-time. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,555 |
inproceedings | giguet-vergne-1997-part | From Part of Speech Tagging to Memory-based Deep Syntactic Analysis | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.12/ | Giguet, Emmanuel and Vergne, Jacques | Proceedings of the Fifth International Workshop on Parsing Technologies | 77--88 | This paper presents a robust system for deep syntactic parsing of unrestricted French. This system uses techniques from Part-of-Speech tagging in order to build a constituent structure and uses other techniques from dependency grammar in an original framework of memories in order to build a functional structure. The two structures are build simultaneously by two interacting processes. The processes share the same aim, that is, to recover efficiently and reliably syntactic information with no explicit expectation on text structure. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,556 |
inproceedings | goodman-1997-probabilistic | Probabilistic Feature Grammars | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.13/ | Goodman, Joshua | Proceedings of the Fifth International Workshop on Parsing Technologies | 89--100 | We present a new formalism, probabilistic feature grammar (PFG). PFGs combine most of the best properties of several other formalisms, including those of Collins, Magerman, and Charniak, and in experiments have comparable or better performance. PFGs generate features one at a time, probabilistically, conditioning the probabilities of each feature on other features in a local context. Because the conditioning is local, efficient polynomial time parsing algorithms exist for computing inside, outside, and Viterbi parses. PFGs can produce probabilities of strings, making them potentially useful for language modeling. Precision and recall results are comparable to the state of the art with words, and the best reported without words. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,557 |
inproceedings | hahn-etal-1997-message | Message-passing Protocols for Real-world Parsing - An Object-oriented Model and its Preliminary Evaluation | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.14/ | Hahn, Udo and Neuhaus, Peter and Broeker, Norbert | Proceedings of the Fifth International Workshop on Parsing Technologies | 101--112 | We argue for a performance-based design of natural language grammars and their associated parsers in order to meet the constraints imposed by real-world NLP. Our approach incorporates declarative and procedural knowledge about language and language use within an object-oriented specification framework. We discuss several message-passing protocols for parsing and provide reasons for sacrificing completeness of the parse in favor of efficiency based on a preliminary empirical evaluation. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,558 |
inproceedings | hektoen-1997-probabilistic | Probabilistic Parse Selection based on Semantic Cooccurrences | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.15/ | Hektoen, Eirik | Proceedings of the Fifth International Workshop on Parsing Technologies | 113--122 | This paper presents a new technique for selecting the correct parse of ambiguous sentences based on a probabilistic analysis, of lexical cooccurrences in semantic forms. The method is called {\textquotedblleft}Semco{\textquotedblright} (for semantic cooccurrence analysis) and is specifically targeted at the differential distribution of such cooccurrences in correct and incorrect parses. It uses Bayesian Estimation for the cooccurrence probabilities to achieve higher accuracy for sparse data than the more common Maximum Likelihood Estimation would. It has been tested on the Wall Street Journal corpus (in the PENN Treebank) and shown to find the correct parse of 60.9{\%} of parseable sentences of 6-20 words. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,559 |
inproceedings | unui-etal-1997-new | A New Formalization of Probabilistic {GLR} Parsing | Nijholt, Anton and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Hajicova, Eva and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nagao, Makoto and Steedman, Mark and Tomita, Masaru and Vijay-Shanker, K. and Weir, David and Wittenburg, Kent and Wiren, Mats | sep # " 17-20" | 1997 | Boston/Cambridge, Massachusetts, USA | Association for Computational Linguistics | https://aclanthology.org/1997.iwpt-1.16/ | Unui, Kentaro and Sornlertlamvanich, Virach and Tanaka, Hozumi and Tokunaga, Takenobu | Proceedings of the Fifth International Workshop on Parsing Technologies | 123--134 | This paper presents a new formalization of probabilistic GLR language modeling for statistical parsing. Our model inherits its essential features from Briscoe and Carroll`s generalized probabilistic LR model, which obtains context-sensitivity by assigning a probability to each LR parsing action according to its left and right context. Briscoe and Carroll`s model, however, has a drawback in that it is not formalized in any probabilistically well-founded way, which may degrade its parsing performance. Our formulation overcomes this drawback with a few significant refinements, while maintaining all the advantages of Briscoe and Carroll`s modeling. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 98,560 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.