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 | silva-etal-2004-extracting | Extracting Named Entities. A Statistical Approach | Blache, Philippe and Nguyen, No{\"el and Chenfour, Nouredine and Rajouani, Abdenbi | apr | 2004 | F{\`e}s, Maroc | ATALA | https://aclanthology.org/2004.jeptalnrecital-poster.21/ | Silva, Joaquim and Kozareva, Zornitsa and Noncheva, Veska and Lopes, Gabriel | Actes de la 11{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Posters | 125--130 | Named entities and more generally Multiword Lexical Units (MWUs) are important for various applications. However, language independent methods for automatically extracting MWUs do not provide us with clean data. So, in this paper we propose a method for selecting possible named entities from automatically extracted MWUs, and later, a statistics-based language independent unsupervised approach is applied to possible named entities in order to cluster them according to their type. Statistical features used by our clustering process are described and motivated. The Model-Based Clustering Analysis (MBCA) software enabled us to obtain different clusters for proposed named entities. The method was applied to Bulgarian and English. For some clusters, precision is very high; other clusters still need further refinement. Based on the obtained clusters, it is also possible to classify new possible named entities. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,705 |
inproceedings | tsalidis-etal-2004-electronic | An electronic dictionary as a basis for {NLP} tools: The {G}reek case | Blache, Philippe and Nguyen, No{\"el and Chenfour, Nouredine and Rajouani, Abdenbi | apr | 2004 | F{\`e}s, Maroc | ATALA | https://aclanthology.org/2004.jeptalnrecital-poster.23/ | Tsalidis, Christos and Vagelatos, Aristides and Orphanos, Giorgos | Actes de la 11{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Posters | 141--146 | The existence of a Dictionary in electronic form for Modern Greek (MG) is mandatory if one is to process MG at the morphological and syntactic levels since MG is a highly inflectional language with marked stress and a spelling system with many characteristics carried over from Ancient Greek. Moreover, such a tool becomes necessary if one is to create efficient and sophisticated NLP applications with substantial linguistic backing and coverage. The present paper will focus on the deployment of such an electronic dictionary for Modern Greek, which was built in two phases: first it was constructed to be the basis for a spelling correction schema and then it was reconstructed in order to become the platform for the deployment of a wider spectrum of NLP tools. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,707 |
inproceedings | sonnenhauser-2004-towards | Towards a rule-guided derivation of aspectual readings in {R}ussian | B{\'e}chet, Fr{\'e}d{\'e}ric and Vanrullen, Tristan | apr | 2004 | F{\`e}s, Maroc | ATALA | https://aclanthology.org/2004.jeptalnrecital-recitalposter.13/ | Sonnenhauser, Barbara | Actes de la 11{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. REncontres jeunes Chercheurs en Informatique pour le Traitement Automatique des Langues (Posters) | 73--78 | Natural language expressions are underspecified and require enrichment to develop into full fledged propositions. Their sense-general semantics must be complemented with pragmatic inferences that have to be systematically figured out and pinned down in a principled way, so as to make them suitable inputs for NLP algorithms. This paper deals with the underspecified ipf1 aspect in Russian and introduces a semantic and pragmatic framework that might serve as the basis for a rule-guided derivation of its different readings. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,731 |
inproceedings | arranz-etal-2004-speech | A speech-to-speech translation system for {C}atalan, {S}panish, and {E}nglish | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.2/ | Arranz, Victoria and Comelles, Elisabet and Farwell, David and Nadeu, Climent and Padrell, Jaume and Febrer, Albert and Alexander, Dorcas and Peterson, Kay | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 7--16 | In this paper we describe the FAME interlingual speech-to- speech translation System for Spanish, Catalan and English which is intended to assist users in the reservation of a hotel room when calling or visiting abroad. The System has been developed as an extension of the existing NESPOLE! translation system [4] which translates between English, German, Italian and French. After a brief introduction we describe the Spanish and Catalan System components including speech recognition, transcription to IF mapping, IF to text generation and speech synthesis. We also present a task-oriented evaluation method used to inform about system development and some preliminary 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 | 91,782 |
inproceedings | ayan-etal-2004-multi | Multi-Align: combining linguistic and statistical techniques to improve alignments for adaptable {MT} | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.3/ | Ayan, Necip Fazil and Dorr, Bonnie and Habash, Nizar | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 17--26 | An adaptable statistical or hybrid MT system relies heavily on the quality of word-level alignments of real-world data. Statistical alignment approaches provide a reasonable initial estimate for word alignment. However, they cannot handle certain types of linguistic phenomena such as long-distance dependencies and structural differences between languages. We address this issue in Multi-Align, a new framework for incremental testing of different alignment algorithms and their combinations. Our design allows users to tune their systems to the properties of a particular genre/domain while still benefiting from general linguistic knowledge associated with a language pair. We demonstrate that a combination of statistical and linguistically-informed alignments can resolve translation divergences during the alignment 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 | 91,783 |
inproceedings | brown-2004-modified | A modified Burrows-Wheeler transform for highly scalable example-based translation | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.4/ | Brown, Ralf D. | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 27--36 | The Burrows-Wheeler Transform (BWT) was originally developed for data compression, but can also be applied to indexing text. In this paper, an adaptation of the BWT to word-based indexing of the training corpus for an example-based machine translation (EBMT) system is presented. The adapted BWT embeds the necessary information to retrieve matched training instances without requiring any additional space and can be instantiated in a compressed form which reduces disk space and memory requirements by about 40{\%} while still remaining searchable without decompression. Both the speed advantage from O(log N) lookups compared to the O(N) lookups in the inverted-file index which had previously been used and the structure of the index itself act as enablers for additional capabilities and run-time speed. Because the BWT groups all instances of any n-gram together, it can be used to quickly enumerate the most-frequent n-grams, for which translations can be precomputed and stored, resulting in an order-of-magnitude speedup 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 | 91,784 |
inproceedings | cardey-etal-2004-designing | Designing a controlled language for the machine translation of medical protocols: the case of {E}nglish to {C}hinese | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.5/ | Cardey, Sylviane and Greenfield, Peter and Wu, Xiahong | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 37--47 | Because of its clarity and its simplified way of writing, controlled language (CL) is being paid increasing attention by NLP (natural language processing) researchers, such as in machine translation. The users of controlled languages are of two types, firstly the authors of documents written in the controlled language and secondly the end-user readers of the documents. As a subset of natural language, controlled language restricts vocabulary, grammar, and style for the purpose of reducing or eliminating both ambiguity and complexity. The use of controlled language can help decrease the complexity of natural language to a certain degree and thus improve the translation quality, especially for the partial or total automatic translation of non-general purpose texts, such as technical documents, manuals, instructions and medical reports. Our focus is on the machine translation of medical protocols applied in the field of zoonosis. In this article we will briefly introduce why controlled language is preferred in our research work, what kind of benefits it will bring to our work and how we could make use of this existing technique to facilitate our translation tool. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,785 |
inproceedings | corston-oliver-gamon-2004-normalizing | Normalizing {G}erman and {E}nglish inflectional morphology to improve statistical word alignment | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.6/ | Corston-Oliver, Simon and Gamon, Michael | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 48--57 | German has a richer system of inflectional morphology than English, which causes problems for current approaches to statistical word alignment. Using Giza++ as a reference implementation of the IBM Model 1, an HMMbased alignment and IBM Model 4, we measure the impact of normalizing inflectional morphology on German-English statistical word alignment. We demonstrate that normalizing inflectional morphology improves the perplexity of models and reduces alignment errors. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,786 |
inproceedings | dillinger-seligman-2004-system | System description: a highly interactive speech-to-speech translation system | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.7/ | Dillinger, Mike and Seligman, Mark | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 58--63 | Spoken Translation, Inc. (STI) of Berkeley, CA has developed a commercial system for interactive speech-to-speech machine translation designed for both high accuracy and broad linguistic and topical coverage. Planned use is in situations requiring both of these features, for example in helping Spanish-speaking patients to communicate with English-speaking doctors, nurses, and other health-care staff. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,787 |
inproceedings | elliott-etal-2004-fluency | A fluency error categorization scheme to guide automated machine translation evaluation | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.8/ | Elliott, Debbie and Hartley, Anthony and Atwell, Eric | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 64--73 | Existing automated MT evaluation methods often require expert human translations. These are produced for every language pair evaluated and, due to this expense, subsequent evaluations tend to rely on the same texts, which do not necessarily reflect real MT use. In contrast, we are designing an automated MT evaluation system, intended for use by post-editors, purchasers and developers, that requires nothing but the raw MT output. Furthermore, our research is based on texts that reflect corporate use of MT. This paper describes our first step in system design: a hierarchical classification scheme of fluency errors in English MT output, to enable us to identify error types and frequencies, and guide the selection of errors for automated detection. We present results from the statistical analysis of 20,000 words of MT output, manually annotated using our classification scheme, and describe correlations between error frequencies and human scores for fluency and adequacy. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,788 |
inproceedings | gaspari-2004-online | Online {MT} services and real users' needs: an empirical usability evaluation | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.9/ | Gaspari, Federico | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 74--85 | This paper presents an empirical evaluation of the main usability factors that play a significant role in the interaction with on-line Machine Translation (MT) services. The investigation is carried out from the point of view of typical users with an emphasis on their real needs, and focuses on a set of key usability criteria that have an impact on the successful deployment of Internet-based MT technology. A small-scale evaluation of the performance of five popular web-based MT systems against the selected usability criteria shows that different approaches to interaction design can dramatically affect the level of user satisfaction. There are strong indications that the results of this study can be fed back into the development of on-line MT services to enhance their design, thus ensuring that they meet the requirements and expectations of a wide range of Internet users. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,789 |
inproceedings | helmreich-farwell-2004-counting | Counting, measuring, ordering: translation problems and solutions | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.10/ | Helmreich, Stephen and Farwell, David | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 86--93 | This paper describes some difficulties associated with the translation of numbers (scalars) used for counting, measuring, or selecting items or properties. A set of problematic issues is described, and the presence of these difficulties is quantified by examining a set of texts and translations. An approach to a solution is suggested. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,790 |
inproceedings | hernandez-etal-2004-feedback | Feedback from the field: the challenge of users in motion | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.11/ | Hernandez, L. and Turner, J. and Holland, M. | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 94--101 | Feedback from field deployments of machine translation (MT) is instructive but hard to obtain, especially in the case of soldiers deployed in mobile and stressful environments. We first consider the process of acquiring feedback: the difficulty of getting and interpreting it, the kinds of information that have been used in place of or as predictors of direct feedback, and the validity and completeness of that information. We then look at how to better forecast the utility of MT in deployments so that feedback from the field is focused on aspects that can be fixed or enhanced rather than on overall failure or viability of the technology. We draw examples from document and speech 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 | 91,791 |
inproceedings | hutchins-2004-georgetown | The {G}eorgetown-{IBM} experiment demonstrated in {J}anuary 1954 | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.12/ | Hutchins, W. John | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 102--114 | The public demonstration of a Russian-English machine translation system in New York in January 1954 {--} a collaboration of IBM and Georgetown University {--} caused a great deal of public interest and much controversy. Although a small-scale experiment of just 250 words and six {\textquoteleft}grammar' rules it raised expectations of automatic systems capable of high quality translation in the near future. This paper describes the system, its background, its impact and its implications. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,792 |
inproceedings | kool-etal-2004-pars | The {PARS} family of machine translation systems for {D}utch system description/ demonstration | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.14/ | Kool, Edward A. and Blekhman, Michael S. and Kursin, Andrei and Rakova, Alla | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 125--129 | Lingvistica is developing a family of MT systems for Dutch to and from English, German, and French. PARS/H, a Dutch to and from English system, is a fully commercial product, while PARS/HD, for Dutch to and from German MT, and PARS/HF, for Dutch to and from French, are under way. The PARS/Dutch family of MT systems is based on the rule-based Lingvistica`s Dutch morphological-syntactic analyzer and synthesizer dealing with vowel and consonant alterations in Dutch words, as well as Dutch syntactic analysis and synthesis. Besides, a German analyzer and synthesizer have been developed, and a similar French one is being constructed. Representative Dutch and German grammatical dictionaries have been created, comprising Dutch and German words and their complete morphological descriptions: class and subclass characteristics, alteration features, and morphological declension/conjugation paradigms. The PARS/H dictionary editor provides simple dictionary updating. Numerous specialist dictionaries are being and have been created. The user interface integrates PARS/H with MS Word and MS Internet Explorer, fully preserving the corresponding formats. Integrating with MS Excel and many other applications is under way. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,794 |
inproceedings | kopris-2004-rapid | Rapid {MT} experience in an {LCTL} ({P}ashto) | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.15/ | Kopris, Craig | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 130--133 | A year ago we were faced with a challenge: rapidly develop a machine translation (MT) system for written Pashto with limited resources. We had three full-time native speakers (one with a Ph.D. in general linguistics, and translation experience) and one part-time descriptive linguist with a typological-functional background. In addition, we had a legacy MT software system, which neither the speakers nor the linguist was familiar with, although we had the opportunity to occasionally confer with experienced system users. There were also dated published grammars of varying (usually inadequate) quality available. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,795 |
inproceedings | lavie-etal-2004-significance | The significance of recall in automatic metrics for {MT} evaluation | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.16/ | Lavie, Alon and Sagae, Kenji and Jayaraman, Shyamsundar | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 134--143 | Recent research has shown that a balanced harmonic mean (F1 measure) of unigram precision and recall outperforms the widely used BLEU and NIST metrics for Machine Translation evaluation in terms of correlation with human judgments of translation quality. We show that significantly better correlations can be achieved by placing more weight on recall than on precision. While this may seem unexpected, since BLEU and NIST focus on n-gram precision and disregard recall, our experiments show that correlation with human judgments is highest when almost all of the weight is assigned to recall. We also show that stemming is significantly beneficial not just to simpler unigram precision and recall based metrics, but also to BLEU and NIST. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,796 |
inproceedings | lee-etal-2004-alignment | Alignment of bilingual named entities in parallel corpora using statistical model | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.17/ | Lee, Chun-Jen and Chang, Jason S. and Chuang, Thomas C. | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 144--153 | Named entities make up a bulk of documents. Extracting named entities is crucial to various applications of natural language processing. Although efforts to identify named entities within monolingual documents are numerous, extracting bilingual named entities has not been investigated extensively owing to the complexity of the task. In this paper, we describe a statistical phrase translation model and a statistical transliteration model. Under the proposed models, a new method is proposed to align bilingual named entities in parallel corpora. Experimental results indicate that a satisfactory precision rate can be achieved. To enhance the performance, we also describe how to improve the proposed method by incorporating approximate matching and person name recognition. Experimental results show that performance is significantly improved with the enhancement. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,797 |
inproceedings | leplus-etal-2004-weather | Weather report translation using a translation memory | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.18/ | Leplus, Thomas and Langlais, Philippe and Lapalme, Guy | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 154--163 | We describe the use of a translation memory in the context of a reconstruction of a landmark application of machine translation, the Canadian English to French weather report translation system. This system, which has been in operation for more than 20 years, was developed using a classical symbolic approach. We describe our experiment in developing an alternative approach based on the analysis of hundreds of thousands of weather reports. We show that it is possible to obtain excellent translations using translation memory techniques and we analyze the kinds of translation errors that are induced by this 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 | 91,798 |
inproceedings | lin-mitamura-2004-keyword | Keyword translation from {E}nglish to {C}hinese for multilingual {QA} | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.19/ | Lin, Frank and Mitamura, Teruko | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 164--176 | The Keyword Translator is a part of the Question Analyzer module in the JAVELIN Question-Answering system; it translates the keywords, which are used to query documents and extract answers, from one language to another. Much work has been in the area of query translation for CLIR or MLIR, however, many have focused on methods using hard-to-obtain and domain-specific resources, and evaluation is often based on retrieval performance rather than translation correctness. In this paper we will describe methods combining easily accessible, general-purpose MT systems to improve keyword translation correctness. We also describe methods that utilize the question sentence available to a question-answering system to improve translation correctness. We will show that using multiple MT systems and the question sentence to translate keywords from English to Mandarin Chinese can significantly improve keyword translation correctness. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,799 |
inproceedings | lin-etal-2004-extraction | Extraction of name and transliteration in monolingual and parallel corpora | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.20/ | Lin, Tracy and Wu, Jian-Cheng and Chang, Jason S. | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 177--186 | Named-entities in free text represent a challenge to text analysis in Machine Translation and Cross Language Information Retrieval. These phrases are often transliterated into another language with a different sound inventory and writing system. Named-entities found in free text are often not listed in bilingual dictionaries. Although it is possible to identify and translate named-entities on the fly without a list of proper names and transliterations, an extensive list of existing transliterations certainly will ensure high precision rate. We use a seed list of proper names and transliterations to train a Machine Transliteration Model. With the model it is possible to extract proper names and their transliterations in monolingual or parallel corpora with high precision and recall rates. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,800 |
inproceedings | font-llitjos-etal-2004-error | Error analysis of two types of grammar for the purpose of automatic rule refinement | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.21/ | Font Llitj{\'o}s, Ariadna and Probst, Katharina and Carbonell, Jaime | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 187--196 | This paper compares a manually written MT grammar and a grammar learned automatically from an English-Spanish elicitation corpus with the ultimate purpose of automatically refining the translation rules. The experiment described here shows that the kind of automatic refinement operations required to correct a translation not only varies depending on the type of error, but also on the type of grammar. This paper describes the two types of grammars and gives a detailed error analysis of their output, indicating what kinds of refinements are required in each case. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,801 |
inproceedings | macklovitch-2004-contribution | The contribution of end-users to the {T}rans{T}ype2 project | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.22/ | Macklovitch, Elliott | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 197--207 | TransType2 is a novel kind of interactive MT in which the system and the user collaborate in drafting a target text, the system`s contribution taking the form of predictions that extend what the translator has already typed in. TT2 is also an international research project in which end-users are represented by two translation firms. We describe the contribution of these translators to the project, from their input to the system`s functional specifications to their participation in quarterly user trials. We also present the results of the latest round of user trials. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,802 |
inproceedings | mahsut-etal-2004-experiment | An experiment on {J}apanese-{U}ighur machine translation and its evaluation | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.23/ | Mahsut, Muhtar and Ogawa, Yasuhiro and Sugino, Kazue and Toyama, Katsuhiko and Inagaki, Yasuyoshi | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 208--216 | This paper describes an evaluation experiment about a Japanese-Uighur machine translation system which consists of verbal suffix processing, case suffix processing, phonetic change processing, and a Japanese-Uighur dictionary including about 20,000 words. Japanese and Uighur have many syntactical and language structural similarities, including word order, existence and same functions of case suffixes and verbal suffixes, morphological structure, etc. For these reasons, we can consider that we can translate Japanese into Uighur in such a manner as word-by-word aligning after morphological analysis of the input sentences without complicated syntactical analysis. From the point of view of practical usage, we have chosen three articles about environmental issue appeared in Nippon Keizai Shinbun, and conducted a translation experiment on the articles with our MT system, for clarifying our argument. Here, we have counted the correctness of phrases in the Output sentences to be evaluating criteria. As a results of the experiment, 84.8{\%} of precision has been achieved. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,803 |
inproceedings | probst-lavie-2004-structurally | A structurally diverse minimal corpus for eliciting structural mappings between languages | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.24/ | Probst, Katharina and Lavie, Alon | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 217--226 | We describe an approach to creating a small but diverse corpus in English that can be used to elicit information about any target language. The focus of the corpus is on structural information. The resulting bilingual corpus can then be used for natural language processing tasks such as inferring transfer mappings for Machine Translation. The corpus is sufficiently small that a bilingual user can translate and word-align it within a matter of hours. We describe how the corpus is created and how its structural diversity is ensured. We then argue that it is not necessary to introduce a large amount of redundancy into the corpus. This is shown by creating an increasingly redundant corpus and observing that the information gained converges as redundancy increases. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,804 |
inproceedings | reeder-2004-investigation | Investigation of intelligibility judgments | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.25/ | Reeder, Florence | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 227--235 | This paper describes an intelligibility snap-judgment test. In this exercise, participants are shown a series of human translations and machine translations and are asked to determine whether the author was human or machine. The experiment shows that snap judgments on intelligibility are made successfully and that system rankings on snap judgments are consistent with more detailed intelligibility measures. In addition to demonstrating a quick intelligibility judgment, representing on a few minutes time of each participant, it details the types of errors which led to the snap judgments. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,805 |
inproceedings | reeder-etal-2004-interlingual | Interlingual annotation for {MT} development | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.26/ | Reeder, Florence and Dorr, Bonnie and Farwell, David and Habash, Nizar and Helmreich, Stephen and Hovy, Eduard and Levin, Lori and Mitamura, Teruko and Miller, Keith and Rambow, Owen and Siddharthan, Advaith | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 236--245 | MT systems that use only superficial representations, including the current generation of statistical MT systems, have been successful and useful. However, they will experience a plateau in quality, much like other {\textquotedblleft}silver bullet{\textquotedblright} approaches to MT. We pursue work on the development of interlingual representations for use in symbolic or hybrid MT systems. In this paper, we describe the creation of an interlingua and the development of a corpus of semantically annotated text, to be validated in six languages and evaluated in several ways. We have established a distributed, well-functioning research methodology, designed a preliminary interlingua notation, created annotation manuals and tools, developed a test collection in six languages with associated English translations, annotated some 150 translations, and designed and applied various annotation metrics. We describe the data sets being annotated and the interlingual (IL) representation language which uses two ontologies and a systematic theta-role list. We present the annotation tools built and outline the annotation process. Following this, we describe our evaluation methodology and conclude with a summary of issues that have arisen. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,806 |
inproceedings | richardson-2004-machine | Machine translation of online product support articles using data-driven {MT} system | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.27/ | Richardson, Stephen D. | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 246--251 | At AMTA 2002, we reported on a pilot project to machine translate Microsoft`s Product Support Knowledge Base into Spanish. The successful pilot has since resulted in the permanent deployment of both Spanish and Japanese versions of the knowledge base, as well as ongoing pilot projects for French and German. The translated articles in each case have been produced by MSR-MT, Microsoft Research`s data-driven MT system, which has been trained on well over a million bilingual sentence pairs for each target language from previously translated materials contained in translation memories and glossaries. This paper describes our experience in deploying this system and the (positive) customer response to the availability of machine translated articles, as well as other uses of MSR-MT either planned or underway at Microsoft. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,807 |
inproceedings | rychtyckyj-2004-maintenance | Maintenance issues for machine translation systems | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.28/ | Rychtyckyj, Nestor | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 252--261 | At AMTA-2002 we presented a deployed application of Machine Translation (MT) at Ford Motor Company in the domain of vehicle assembly process planning. This application uses an MT system developed by SYSTRAN to translate Ford`s manufacturing process build instructions from English to Spanish, German, Dutch and Portuguese. Our MT system has already translated over 2 million instructions into these target languages and is an integral part of our manufacturing process planning to support Ford`s assembly plants in Europe, Mexico and South America. A major component of the MT system development was the creation of a set of technical glossaries for the correct translation of automotive and Ford-specific terminology. Due to the dynamic nature of the automobile industry we need to keep these technical glossaries current as our terminology frequently changes due to the introduction of new manufacturing technologies, vehicles and vehicle features. In addition, our end-users need to be able to test and modify translations and see these results deployed in a timely manner. In this paper we will discuss the tools and business process that we have developed in conjunction with SYSTRAN in order to maintain and customize our MT system and improve its performance in the face of an ever-changing business environment. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,808 |
inproceedings | wu-wang-2004-improving-domain | Improving domain-specific word alignment with a general bilingual corpus | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.29/ | Wu, Hua and Wang, Haifeng | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 262--271 | In conventional word alignment methods, some employ statistical models or statistical measures, which need large-scale bilingual sentence-aligned training corpora. Others employ dictionaries to guide alignment selection. However, these methods achieve unsatisfactory alignment results when performing word alignment on a small-scale domain-specific bilingual corpus without terminological lexicons. This paper proposes an approach to improve word alignment in a specific domain, in which only a small-scale domain-specific corpus is available, by adapting the word alignment information in the general domain to the specific domain. This approach first trains two statistical word alignment models with the large-scale corpus in the general domain and the small-scale corpus in the specific domain respectively, and then improves the domain-specific word alignment with these two models. Experimental results show a significant improvement in terms of both alignment precision and recall, achieving a relative error rate reduction of 21.96{\%} as compared with state-of-the-art technologies. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 91,809 |
inproceedings | zhao-etal-2004-super | A super-function based {J}apanese-{C}hinese machine translation system for business users | Frederking, Robert E. and Taylor, Kathryn B. | sep # " 28 - " # oct # " 2" | 2004 | Washington, USA | Springer | https://aclanthology.org/2004.amta-papers.30/ | Zhao, Xin and Ren, Fuji and Vo{\ss}, Stefan | Proceedings of the 6th Conference of the Association for Machine Translation in the Americas: Technical Papers | 272--281 | In this paper, a Japanese-Chinese Machine Translation (MT) system using the so-called Super-Function (SF) approach is presented. A SF is a functional relation mapping sentences from one language to another. The core of the system uses the SF approach to translate without going through syntactic and semantic analysis as many MT systems usually do. Our work focuses on business users for whom MT often is a great help if they need an immediate idea of the content of texts like e-mail messages, reports, web pages, or business letters. In this paper, we aim at performing MT between Japanese and Chinese to translate business letters by the SF based 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 | 91,810 |
inproceedings | alonso-diaz-2003-parsing | Parsing {T}ree {A}djoining {G}rammars and Tree Insertion Grammars with Simultaneous Adjunctions | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3001/ | Alonso, Miguel A. and D{\'i}az, V{\'i}ctor J. | Proceedings of the Eighth International Conference on Parsing Technologies | 19--30 | A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsing algorithm managing simultaneous adjunctions in TAG and TIG. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,317 |
inproceedings | boullier-2003-guided | Guided {E}arley Parsing | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3005/ | Boullier, Pierre | Proceedings of the Eighth International Conference on Parsing Technologies | 43--54 | In this paper, we present a method which may speed up Earley parsers in practice. A first pass called a guiding parser builds an intermediate structure called a guide which is used by a second pass, an Earley parser, called a guided parser whose Predictor phase is slightly modified in such a way that it selects an initial item only if this item is in the guide. This approach is validated by practical experiments preformed on a large test set with an English context-free grammar. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,321 |
inproceedings | boullier-2003-supertagging | Supertagging: A Non-Statistical Parsing-Based Approach | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3006/ | Boullier, Pierre | Proceedings of the Eighth International Conference on Parsing Technologies | 55--65 | We present a novel approach to supertagging w.r.t. some lexicalized grammar G. It differs from previous approaches in several ways:- These supertaggers rely only on structural information: they do not need any training phase;- These supertaggers do not compute the {\textquotedblleft}best{\textquotedblleft} supertag for each word, but rather a set of supertags. These sets of supertags do not exclude any supertag that will eventually be used in a valid complete derivation (i.e., we have a recall score of 100{\%});- These supertaggers are in fact true parsers which accept supersets of L(G) that can be more efficiently parsed than the sentences of L(G). | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,322 |
inproceedings | corazza-2003-parsing | Parsing Strategies for the Integration of Two Stochastic Context-Free Grammars | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3007/ | Corazza, Anna | Proceedings of the Eighth International Conference on Parsing Technologies | null | Integration of two stochastic context-free grammars can be useful in two pass approaches used, for example, in speech recognition and understanding. Based on an algorithm proposed by [Nederhof and Satta, 2002] for the non-probabilistic case, left-to-right strategies for the search for the best solution based on CKY and Earley parsers are discussed. The restriction that one of the two grammars must be non recursive does not represent a problem in the considered 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 | 92,323 |
inproceedings | costagliola-deufemia-2003-visual | Visual Language Editors based on {LR} Parsing Techniques | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3008/ | Costagliola, Gennaro and Deufemia, Vincenzo | Proceedings of the Eighth International Conference on Parsing Technologies | 78--90 | Visual language editors should provide a user-friendly environment where users are supported in an effective way in the construction of visual sentences. In this paper, we propose an approach for the construction of syntax-directed visual language editors by integrating incremental parsers into freehand editors. The approach combines the LR-based techniques for parsing visual languages with the more general incremental Generalized LR parsing techniques developed for string languages. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,324 |
inproceedings | fouvry-2003-constraint | Constraint relaxation with weighted feature structures | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3010/ | Fouvry, Frederik | Proceedings of the Eighth International Conference on Parsing Technologies | 103--114 | In this paper, we present a definition of unification of weighted feature structures designed to deal with constraint relaxation. The application of phrase structure rules in a unification-based Natural Language Processing system is adapted such that inconsistent values do not lead to failure, but are penalised. These penalties are based on the signature and the shape of the feature structures, and thus realise an elegant and general approach to relaxation. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,326 |
inproceedings | henderson-2003-generative | Generative versus Discriminative Models for Statistical Left-Corner Parsing | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3011/ | Henderson, James | Proceedings of the Eighth International Conference on Parsing Technologies | 115--126 | We propose two statistical left-corner parsers and investigate their accuracy at varying speeds. The parser based on a generative probability model achieves state-of-the-art accuracy when sufficient time is available, but when high speed is required the parser based on a discriminative probability model performs better. Neural network probability estimation is used to handle conditioning on both the unbounded parse histories and the unbounded lookahead strings. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,327 |
inproceedings | kadlec-smrz-2003-pace | {PACE} {---} Parser Comparison and Evaluation | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3012/ | Kadlec, Vladimir and Smrz, Pavel | Proceedings of the Eighth International Conference on Parsing Technologies | 211--212 | The paper introduces PACE {---} a parser comparison and evaluation system for the syntactic processing of natural languages. The analysis is based on context free grammar with contextual extensions (constraints). The system is able to manage very large and extremely ambiguous CF grammars. It is independent of the parsing algorithm used. The tool can solve the contextual constraints on the resulting CF structure, select the best parsing trees according to their probabilities, or combine them. We discuss the advantages and disadvantages of our modular design as well as how efficiently it processes the standard evaluation grammars. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,328 |
inproceedings | kwak-etal-2003-glr | {GLR} Parser with Conditional Action Model using Surface Phrasal Types for {K}orean | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3013/ | Kwak, Yong-Jae and Park, So-Young and Rim, Hae-Chang | Proceedings of the Eighth International Conference on Parsing Technologies | 213--214 | In this paper, we propose a new probabilistic GLR parsing method that can solve the problems of conventional methods. Our proposed Conditional Action Model uses Surface Phrasal Types (SPTs) encoding the functional word sequences of the sub-trees for describing structural characteristics of the partial parse. And, the proposed GLR model outperforms the previous methods by about 6{\textasciitilde}8{\%}. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,329 |
inproceedings | langley-lavie-2003-parsing | Parsing Domain Actions with Phrase-Level Grammars and Memory-Based Learners | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3014/ | Langley, Chad and Lavie, Alon | Proceedings of the Eighth International Conference on Parsing Technologies | 127--136 | In this paper, we describe an approach to analysis for spoken language translation that combines phrase-level grammar-based parsing and automatic domain action classification. The job of the analyzer is to transform utterances into a shallow semantic task-oriented interlingua representation. The goal of our hybrid approach is to provide accurate real-time analyses and to improve robustness and portability to new domains and languages. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,330 |
inproceedings | mohanty-balabantaray-2003-intelligent | Intelligent Parsing in Natural Language Processing | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3015/ | Mohanty, Sanghamitra and Balabantaray, Rakesh Chandra | Proceedings of the Eighth International Conference on Parsing Technologies | null | Parser does the part of speech (POS) identification in a sentence, which is required for Machine Translation (MT). An intelligent parser is a parser, which takes care of semantics along with the POS in a sentence. Use of such intelligent parser will reduce the complexity in semantics during MT apriori. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,331 |
inproceedings | nederhof-satta-2003-probabilistic | Probabilistic Parsing as Intersection | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3016/ | Nederhof, Mark-Jan and Satta, Giorgio | Proceedings of the Eighth International Conference on Parsing Technologies | 137--148 | We show that a well-known algorithm to compute the intersection of a context-fre language and a regular language can be extended to apply to a probabilistic context-free grammar and a probabilistic finite automaton, provided the two probabilistic models are combined through multiplication. The result is a probabilistic context-free grammar that contains joint information about the original grammar and automaton. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,332 |
inproceedings | nivre-2003-efficient | An Efficient Algorithm for Projective Dependency Parsing | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3017/ | Nivre, Joakim | Proceedings of the Eighth International Conference on Parsing Technologies | 149--160 | This paper presents a deterministic parsing algorithm for projective dependency grammar. The running time of the algorithm is linear in the length of the input string, and the dependency graph produced is guaranteed to be projective and acyclic. The algorithm has been experimentally evaluated in parsing unrestricted Swedish text, achieving an accuracy above 85{\%} with a very simple grammar. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,333 |
inproceedings | sagae-lavie-2003-combining | Combining Rule-based and Data-driven Techniques for Grammatical Relation Extraction in Spoken Language | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3019/ | Sagae, Kenji and Lavie, Alon | Proceedings of the Eighth International Conference on Parsing Technologies | null | We investigate an aspect of the relationship between parsing and corpus-based methods in NLP that has received relatively little attention: coverage augmentation in rule-based parsers. In the specific task of determining grammatical relations (such as subjects and objects) in transcribed spoken language, we show that a combination of rule-based and corpus-based approaches, where a rule-based system is used as the teacher (or an automatic data annotator) to a corpus-based system, outperforms either system in isolation. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,335 |
inproceedings | nederhof-etal-2003-partially | Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3020/ | Nederhof, Mark-Jan and Satta, Giorgio and Shieber, Stuart | Proceedings of the Eighth International Conference on Parsing Technologies | 171--182 | We present a new formalism, partially ordered multiset context-free grammars (poms-CFG), along with an Earley-style parsing algorithm. The formalism, which can be thought of as a generalization of context-free grammars with partially ordered right-hand sides, is of interest in its own right, and also as infrastructure for obtaining tighter complexity bounds for more expressive context-free formalisms intended to express free or multiple word-order, such as ID/LP grammars. We reduce ID/LP grammars to poms-grammars, thereby getting finer-grained bounds on the parsing complexity of ID/LP grammars. We argue that in practice, the width of attested ID/LP grammars is small, yielding effectively polynomial time complexity for ID/LP grammar parsing. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,336 |
inproceedings | simaan-2003-maximizing | On maximizing metrics for syntactic disambiguation | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3021/ | Sima{'}an, Khalil | Proceedings of the Eighth International Conference on Parsing Technologies | 183--194 | Given a probabilistic parsing model and an evaluation metric for scoring the match between parse-trees, e.g., PARSEVAL [Black et al., 1991], this paper addresses the problem of how to select the on average best scoring parse-tree for an input sentence. Common wisdom dictates that it is optimal to select the parse with the highest probability, regardless of the evaluation metric. In contrast, the Maximizing Metrics (MM) method [Goodman, 1998, Stolcke et al., 1997] proposes that an algorithm that optimizes the evaluation metric itself constitutes the optimal choice. We study the MM method within parsing. We observe that the MM does not always hold for tree-bank models, and that optimizing weak metrics is not interesting for semantic processing. Subsequently, we state an alternative proposition: the optimal algorithm must maximize the metric that scores parse-trees according to linguistically relevant features. We present new algorithms that optimize metrics that take into account increasingly more linguistic features, and exhibit experiments in support of our claim. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,337 |
inproceedings | yamada-matsumoto-2003-statistical | Statistical Dependency Analysis with Support Vector Machines | null | apr | 2003 | Nancy, France | null | https://aclanthology.org/W03-3023/ | Yamada, Hiroyasu and Matsumoto, Yuji | Proceedings of the Eighth International Conference on Parsing Technologies | 195--206 | In this paper, we propose a method for analyzing word-word dependencies using deterministic bottom-up manner using Support Vector machines. We experimented with dependency trees converted from Penn treebank data, and achieved over 90{\%} accuracy of word-word dependency. Though the result is little worse than the most up-to-date phrase structure based parsers, it looks satisfactorily accurate considering that our parser uses no information from phrase structures. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,339 |
inproceedings | akiba-etal-2003-experimental | Experimental comparison of {MT} evaluation methods: {RED} vs.{BLEU} | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.1/ | Akiba, Yasuhiro and Sumita, Eiichiro and Nakaiwa, Hiromi and Yamamoto, Seiichi and Okuno, Hiroshi G. | Proceedings of Machine Translation Summit IX: Papers | null | This paper experimentally compares two automatic evaluators, RED and BLEU, to determine how close the evaluation results of each automatic evaluator are to average evaluation results by human evaluators, following the ATR standard of MT evaluation. This paper gives several cautionary remarks intended to prevent MT developers from drawing misleading conclusions when using the automatic evaluators. In addition, this paper reports a way of using the automatic evaluators so that their results agree with those of human evaluators. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,803 |
inproceedings | bernth-mccord-2003-hybrid | A hybrid approach to deriving selectional preferences | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.2/ | Bernth, Arendse and McCord, Michael C. | Proceedings of Machine Translation Summit IX: Papers | null | A hybrid approach to automatic derivation of class-based selectional preferences is proposed. A lexicon of selectional preferences can assist in handling several forms of ambiguity, a major problem for MT. The approach combines knowledge-rich parsing and lexicons, with statistics and corpus data. We illustrate the use of a selectional preference lexicon for anaphora resolution. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,804 |
inproceedings | bond-fujita-2003-evaluation | Evaluation of a method of creating new valency entries | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.3/ | Bond, Francis and Fujita, Sanae | Proceedings of Machine Translation Summit IX: Papers | null | Information on subcategorization and selectional restrictions is important for natural language processing tasks such as deep parsing, rule-based machine translation and automatic summarization. In this paper we present a method of adding detailed entries to a bilingual dictionary, based on information in an existing valency dictionary. The method is based on two assumptions: words with similar meaning have similar subcategorization frames and selectional restrictions; and words with the same translations have similar meanings. Based on these assumptions, new valency entries are constructed from words in a plain bilingual dictionary, using entries with similar source-language meaning and the same target-language translations. We evaluate the effects of various measures of similarity in increasing accuracy. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,805 |
inproceedings | brown-etal-2003-reducing | Reducing boundary friction using translation-fragment overlap | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.4/ | Brown, Ralf D. and Hutchinson, Rebecca and Bennett, Paul N. and Carbonell, Jaime G. and Jansen, Peter | Proceedings of Machine Translation Summit IX: Papers | null | Many corpus-based Machine Translation (MT) systems generate a number of partial translations which are then pieced together rather than immediately producing one overall translation. While this makes them more robust to ill-formed input, they are subject to disfluencies at phrasal translation boundaries even for well-formed input. We address this {\textquotedblleft}boundary friction{\textquotedblright} problem by introducing a method that exploits overlapping phrasal translations and the increased confidence in translation accuracy they imply. We specify an efficient algorithm for producing translations using overlap. Finally, our empirical analysis indicates that this approach produces higher quality translations than the standard method of combining non-overlapping fragments generated by our Example-Based MT (EBMT) system in a peak-to-peak comparison. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,806 |
inproceedings | burger-etal-2003-communicative | Communicative strategies and patterns of multimodal integration in a speech-to-speech translation system | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.5/ | Burger, Susanne and Costantini, Erica and Pianesi, Fabio | Proceedings of Machine Translation Summit IX: Papers | null | When multilingual communication through a speech-to-speech translation system is supported by multimodal features, e.g. pen-based gestures, the following issues arise concerning the nature of the supported communication: a) to what extend does multilingual communication differ from {\textquoteleft}ordinary' monolingual communication with respect to the dialogue structure and the communicative strategies used by participants; b) the patterns of integration between speech and gestures. Building on the outcomes of a previous work, we present results from a study aimed at addressing those issues. The initial findings confirm that multilingual communication, and the way in which it is realized by actual systems (e.g., with or without the push-to-talk mode) affects the form and structure of the conversation. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,807 |
inproceedings | charniak-etal-2003-syntax | Syntax-based language models for statistical machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.6/ | Charniak, Eugene and Knight, Kevin and Yamada, Kenji | Proceedings of Machine Translation Summit IX: Papers | null | We present a syntax-based language model for use in noisy-channel machine translation. In particular, a language model based upon that described in (Cha01) is combined with the syntax based translation-model described in (YK01). The resulting system was used to translate 347 sentences from Chinese to English and compared with the results of an IBM-model-4-based system, as well as that of (YK02), all trained on the same data. The translations were sorted into four groups: good/bad syntax crossed with good/bad meaning. While the total number of translations that preserved meaning were the same for (YK02) and the syntax-based system (and both higher than the IBM-model-4-based system), the syntax based system had 45{\%} more translations that also had good syntax than did (YK02) (and approximately 70{\%} more than IBM Model 4). The number of translations that did not preserve meaning, but at least had good grammar, also increased, though to less avail. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,808 |
inproceedings | correa-2003-fine | A fine-grained evaluation framework for machine translation system development | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.7/ | Correa, Nelson | Proceedings of Machine Translation Summit IX: Papers | null | Intelligibility and fidelity are the two key notions in machine translation system evaluation, but do not always provide enough information for system development. Detailed information about the type and number of errors of each type that a translation system makes is important for diagnosing the system, evaluating the translation approach, and allocating development resources. In this paper, we present a fine-grained machine translation evaluation framework that, in addition to the notions of intelligibility and fidelity, includes a typology of errors common in automatic translation, as well as several other properties of source and translated texts. The proposed framework is informative, sensitive, and relatively inexpensive to apply, to diagnose and quantify the types and likely sources of translation error. The proposed fine-grained framework has been used in two evaluation experiments on the LMT English-Spanish machine translation system, and has already suggested one important architectural improvement of the 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 | 92,809 |
inproceedings | corston-oliver-gamon-2003-combining | Combining decision trees and transformation-based learning to correct transferred linguistic representations | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.8/ | Corston-Oliver, Simon and Gamon, Michael | Proceedings of Machine Translation Summit IX: Papers | null | We approach to correcting features in transferred linguistic representations in machine translation. The hybrid approach combines decision trees and transformation-based learning. Decision trees serve as a filter on the intractably large search space of possible interrelations among features. Transformation-based learning results in a simple set of ordered rules that can be compiled and executed after transfer and before sentence realization in the target language. We measure the reduction in noise in the linguistic representations and the results of human evaluations of end-to-end English-German 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 | 92,810 |
inproceedings | coughlin-2003-correlating | Correlating automated and human assessments of machine translation quality | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.9/ | Coughlin, Deborah | Proceedings of Machine Translation Summit IX: Papers | null | We describe a large-scale investigation of the correlation between human judgments of machine translation quality and the automated metrics that are increasingly used to drive progress in the field. We compare the results of 124 human evaluations of machine translated sentences to the scores generated by two automatic evaluation metrics (BLEU and NIST). When datasets are held constant or file size is sufficiently large, BLEU and NIST scores closely parallel human judgments. Surprisingly, this was true even though these scores were calculated using just one human reference. We suggest that when human evaluators are forced to make decisions without sufficient context or domain expertise, they fall back on strategies that are not unlike determining n-gram precision. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,811 |
inproceedings | culy-riehemann-2003-limits | The limits of n-gram translation evaluation metrics | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.10/ | Culy, Christopher and Riehemann, Susanne Z. | Proceedings of Machine Translation Summit IX: Papers | null | N-gram measures of translation quality, such as BLEU and the related NIST metric, are becoming increasingly important in machine translation, yet their behaviors are not fully understood. In this paper we examine the performance of these metrics on professional human translations into German of two literary genres, the Bible and Tom Sawyer. The most surprising result is that some machine translations outscore some professional human translations. In addition, it can be difficult to distinguish some other human translations from machine translations with only two reference translations; with four reference translations it is much easier. Our results lead us to conclude that much care must be taken in using n-gram measures in formal evaluations of machine translation quality, though they are still valuable as part of the iterative development cycle. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,812 |
inproceedings | dien-etal-2003-hybrid | A hybrid approach to word order transfer in the {E}nglish-to-{V}ietnamese machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.11/ | Dien, Dinh and Ngan, Nguyen Luu Thuy and Quang, Do Xuan and Nam, Van Chi | Proceedings of Machine Translation Summit IX: Papers | null | Word Order transfer is a compulsory stage and has a great effect on the translation result of a transfer-based machine translation system. To solve this problem, we can use fixed rules (rule-based) or stochastic methods (corpus-based) which extract word order transfer rules between two languages. However, each approach has its own advantages and disadvantages. In this paper, we present a hybrid approach based on fixed rules and Transformation-Based Learning (or TBL) method. Our purpose is to transfer automatically the English word orders into the Vietnamese ones. The learning process will be trained on the annotated bilingual corpus (named EVC: English-Vietnamese Corpus) that has been automatically word-aligned, phrase-aligned and POS-tagged. This transfer result is being used for the transfer module in the English-Vietnamese transfer-based machine translation 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 | 92,813 |
inproceedings | dien-etal-2003-btl | {BTL}: a hybrid model for {E}nglish-{V}ietnamese machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.12/ | Dien, Dinh and Hoang, Kiem and Hovy, Eduard | Proceedings of Machine Translation Summit IX: Papers | null | Machine Translation (MT) is the most interesting and difficult task which has been posed since the beginning of computer history. The highest difficulty which computers had to face with, is the built-in ambiguity of Natural Languages. Formerly, a lot of human-devised rules have been used to disambiguate those ambiguities. Building such a complete rule-set is time-consuming and labor-intensive task whilst it doesn`t cover all the cases. Besides, when the scale of system increases, it is very difficult to control that rule-set. In this paper, we present a new model of learning-based MT (entitled BTL: Bitext-Transfer Learning) that learns from bilingual corpus to extract disambiguating rules. This model has been experimented in English-to-Vietnamese MT system (EVT) and it gave encouraging 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 | 92,814 |
inproceedings | ding-etal-2003-algorithm | An algorithm for word-level alignment of parallel dependency trees | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.13/ | Ding, Yuan and Gildea, Daniel and Palmer, Martha | Proceedings of Machine Translation Summit IX: Papers | null | Structural divergence presents a challenge to the use of syntax in statistical machine translation. We address this problem with a new algorithm for alignment of loosely matched non-isomorphic dependency trees. The algorithm selectively relaxes the constraints of the two tree structures while keeping computational complexity polynomial in the length of the sentences. Experimentation with a large Chinese-English corpus shows an improvement in alignment results over the unstructured models of (Brown et al., 1993). | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,815 |
inproceedings | sayans-gomez-villar-conde-2003-functionality | The functionality of a tool bar for postedition in machine translation between languages with linguistic interference: the {S}panish-{G}alician case | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.16/ | Say{\'a}ns G{\'o}mez, Antonio and Villar Conde, Elena | Proceedings of Machine Translation Summit IX: Papers | null | The Department of Linguistics of the Centro Ram{\'o}n Pi{\~n}eiro para a Investigaci{\'o}n en Humanidades (C.R.P.I.H.), headed by Professor Guillermo Rojo, has developed Es-Ga, a machine translation system based on the Metal system which at the present time translates from Spanish into Galician in .rtf, .txt and .html formats. It also contains a number of programmes whose function is to deformat documents that are then translated and, once this process has finished, to reconstruct their original format. The system has a tool bar with linguistic information designed for MS-WORD, the functionality and functioning of which has proven unquestionable as an aid to the posteditor in a context of linguistic interference between two intercomprehensible languages. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,818 |
inproceedings | goto-etal-2003-transliteration | Transliteration considering context information based on the maximum entropy method | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.17/ | Goto, Isao and Kato, Naoto and Uratani, Noriyoshi and Ehara, Terumasa | Proceedings of Machine Translation Summit IX: Papers | null | This paper proposes a method of automatic transliteration from English to Japanese words. Our method successfully transliterates an English word not registered in any bilingual or pronunciation dictionaries by converting each partial letters in the English word into Japanese katakana characters. In such transliteration, identical letters occurring in different English words must often be converted into different katakana. To produce an adequate transliteration, the proposed method considers chunking of alphabetic letters of an English word into conversion units and considers English and Japanese context information simultaneously to calculate the plausibility of conversion. We have confirmed experimentally that the proposed method improves the conversion accuracy by 63{\%} compared to a simple method that ignores the plausibility of chunking and contextual 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 | 92,819 |
inproceedings | gough-way-2003-controlled | Controlled generation in example-based machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.18/ | Gough, Nano and Way, Andy | Proceedings of Machine Translation Summit IX: Papers | null | The theme of controlled translation is currently in vogue in the area of MT. Recent research (Scha {\ensuremath{\ddot{}}}ler et al., 2003; Carl, 2003) hypothesises that EBMT systems are perhaps best suited to this challenging task. In this paper, we present an EBMT system where the generation of the target string is filtered by data written according to controlled language specifications. As far as we are aware, this is the only research available on this topic. In the field of controlled language applications, it is more usual to constrain the source language in this way rather than the target. We translate a small corpus of controlled English into French using the on-line MT system Logomedia, and seed the memories of our EBMT system with a set of automatically induced lexical resources using the Marker Hypothesis as a segmentation tool. We test our system on a large set of sentences extracted from a Sun Translation Memory, and provide both an automatic and a human evaluation. For comparative purposes, we also provide results for Logomedia itself. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,820 |
inproceedings | gupta-chatterjee-2003-identification | Identification of divergence for {E}nglish to {H}indi {EBMT} | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.19/ | Gupta, Deepa and Chatterjee, Niladri | Proceedings of Machine Translation Summit IX: Papers | null | Divergence is a key aspect of translation between two languages. Divergence occurs when structurally similar sentences of the source language do not translate into sentences that are similar in structures in the target language. Divergence assumes special significance in the domain of Example-Based Machine Translation (EBMT). An EBMT system generates translation of a given sentence by retrieving similar past translation examples from its example base and then adapting them suitably to meet the current translation requirements. Divergence imposes a great challenge to the success of EBMT. The present work provides a technique for identification of divergence without going into the semantic details of the underlying sentences. This identification helps in partitioning the example database into divergence / non-divergence categories, which in turn should facilitate efficient retrieval and adaptation in an EBMT 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 | 92,821 |
inproceedings | habash-2003-matador | Matador: a large-scale {S}panish-{E}nglish {GHMT} system | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.20/ | Habash, Nizar | Proceedings of Machine Translation Summit IX: Papers | null | This paper describes and evaluates Matador, an implemented large-scale Spanish-English MT system built in the Generation-Heavy Hybrid Machine Translation (GHMT) approach. An extensive evaluation shows that Matador has a higher degree of robustness and superior output quality, in terms of grammaticality and accuracy, when compared to a primarily statistical 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 | 92,822 |
inproceedings | hajic-etal-2003-simple | A simple multilingual machine translation system | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.21/ | Haji{\v{c}}, Jan and Homola, Petr and Kubo{\v{n}}, Vladislav | Proceedings of Machine Translation Summit IX: Papers | null | The multilingual machine translation system described in the first part of this paper demonstrates that the translation memory (TM) can be used in a creative way for making the translation process more automatic (in a way which in fact does not depend on the languages used). The MT system is based upon exploitation of syntactic similarities between more or less related natural languages. It currently covers the translation from Czech to Slovak, Polish and Lithuanian. The second part of the paper also shows that one of the most popular TM based commercial systems, TRADOS, can be used not only for the translation itself, but also for a relatively fast and natural method of evaluation of the translation quality of 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 | 92,823 |
inproceedings | hearne-way-2003-seeing | Seeing the wood for the trees: data-oriented translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.22/ | Hearne, Mary and Way, Andy | Proceedings of Machine Translation Summit IX: Papers | null | Data-Oriented Translation (DOT), which is based on Data-Oriented Parsing (DOP), comprises an experience-based approach to translation, where new translations are derived with reference to grammatical analyses of previous translations. Previous DOT experiments [Poutsma, 1998, Poutsma, 2000a, Poutsma, 2000b] were small in scale because important advances in DOP technology were not incorporated into the translation model. Despite this, related work [Way, 1999, Way, 2003a, Way, 2003b] reports that DOT models are viable in that solutions to {\textquoteleft}hard' translation cases are readily available. However, it has not been shown to date that DOT models scale to larger datasets. In this work, we describe a novel DOT system, inspired by recent advances in DOP parsing technology. We test our system on larger, more complex corpora than have been used heretofore, and present both automatic and human evaluations which show that high quality translations can be achieved at reasonable speeds. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,824 |
inproceedings | huang-etal-2003-unified | A unified statistical model for generalized translation memory system | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.23/ | Huang, Jin-Xia and Wang, Wei and Zhou, Ming | Proceedings of Machine Translation Summit IX: Papers | null | We introduced, for Translation Memory System, a statistical framework, which unifies the different phases in a Translation Memory System by letting them constrain each other, and enables Translation Memory System a statistical qualification. Compared to traditional Translation Memory Systems, our model operates at a fine grained sub-sentential level such that it improves the translation coverage. Compared with other approaches that exploit sub-sentential benefits, it unifies the processes of source string segmentation, best example selection, and translation generation by making them constrain each other via the statistical confidence of each step. We realized this framework into a prototype system. Compared with an existing product Translation Memory System, our system exhibits obviously better performance in the ``assistant quality metric'' and gains improvements in the range of 26.3{\%} to 55.1{\%} in the ``translation efficiency metric''. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,825 |
inproceedings | hutchins-2003-machine | Has machine translation improved? some historical comparisons | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.24/ | Hutchins, John | Proceedings of Machine Translation Summit IX: Papers | null | The common assertion that MT systems have improved over the last decades is examined by informal comparisons of translations produced by operational systems in the 1960s, 1970s and 1980s and of translations of the same source texts produced by some currently available commercial and online systems. The scarcity of source and target texts for earlier systems means that the conclusions are consequently tentative and preliminary. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,826 |
inproceedings | hyland-2003-testing | Testing Prompt: the development of a rapid post-editing service at {CLS} Corporate Language Services {AG}, {S}witzerland | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.25/ | Hyland, Catherine | Proceedings of Machine Translation Summit IX: Papers | null | CLS Corporate Language Services AG recently began offering the rapid post-editing of raw machine translation output to meet the rising demand for this service among clients. What is meant by rapid post-editing is the rough correction of machine translated texts with emphasis on speed and denotative accuracy. In the preliminary phase of the project, CLS conducted a test among four in-house translators. The objective was to gain practical experience, establish workflow requirements and set up efficient post-editing processes. Text samples were selected from several subject categories, and post-edited in English, German and French. The participants were given 10, 15 and 30 minutes per page to complete their tasks. This paper aims to present the results of the post-editing test at CLS Corporate Language Services AG, and to examine the conditions under which a rapid post-editing service is feasible in a commercial environment. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,827 |
inproceedings | ji-etal-2003-lexical | Lexical knowledge representation with contextonyms | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.26/ | Ji, Hyungsuk and Ploux, Sabine and Wehrli, Eric | Proceedings of Machine Translation Summit IX: Papers | null | Inter-word associations like stagger - drunken, or intra-word sense divisions (e.g. write a diary vs. write an article) are difficult to compile using a traditional lexicographic approach. As an alternative, we present a model that reflects this kind of subtle lexical knowledge. Based on the minimal sense of a word (clique), the model (1) selects contextually related words (contexonyms) and (2) classifies them in a multi-dimensional semantic space. Trained on very large corpora, the model provides relevant, organized contexonyms that reflect the fine-grained connotations and contextual usage of the target word, as well as the distinct senses of homonyms and polysemous words. Further study on the neighbor effect showed that the model can handle the data sparseness problem. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,828 |
inproceedings | kanayama-watanabe-2003-multilingual | Multilingual translation via annotated hub language | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.27/ | Kanayama, Hiroshi and Watanabe, Hideo | Proceedings of Machine Translation Summit IX: Papers | null | This paper describes a framework for multilingual translation using existing translation engines. Our method allows translation between non-English languages through English as a {\textquotedblleft}hub language{\textquotedblright}. This hub language method has two major problems: {\textquotedblleft}information loss{\textquotedblright} and {\textquotedblleft}error accumulation{\textquotedblright}. In order to address these problems, we represent the hub language using the Linguistic Annotation Language (LAL), which contains English syntactic information and source language information. We show the effectiveness of the annotation approach with a series of experiments. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,829 |
inproceedings | karagol-ayan-etal-2003-acquisition | Acquisition of bilingual {MT} lexicons from {OCR}ed dictionaries | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.28/ | Karagol-Ayan, Burcu and Doermann, David and Dorr, Bonnie J. | Proceedings of Machine Translation Summit IX: Papers | null | This paper describes an approach to analyzing the lexical structure of OCRed bilingual dictionaries to construct resources suited for machine translation of low-density languages, where online resources are limited. A rule-based, an HMM-based, and a post-processed HMM-based method are used for rapid construction of MT lexicons based on systematic structural clues provided in the original dictionary. We evaluate the effectiveness of our techniques, concluding that: (1) the rule-based method performs better with dictionaries where the font is not an important distinguishing feature for determining information types; (2) the post-processed stochastic method improves the results of the stochastic method for phrasal entries; and (3) Our resulting bilingual lexicons are comprehensive enough to provide the basis for reasonable translation results when compared to human translations. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,830 |
inproceedings | kashioka-etal-2003-building | Building a parallel corpus for monologues with clause alignment | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.29/ | Kashioka, Hideki and Maruyama, Takehiko and Tanaka, Hideki | Proceedings of Machine Translation Summit IX: Papers | null | Many studies have been reported in the domain of speech-to-speech machine translation systems for travel conversation use. Therefore, a large number of travel domain corpora have become available in recent years. From a wider viewpoint, speech-to-speech systems are required for many purposes other than travel conversation. One of these is monologues (e.g., TV news, lectures, technical presentations). However, in monologues, sentences tend to be long and complicated, which often causes problems for parsing and translation. Therefore, we need a suitable translation unit, rather than the sentence. We propose the clause as a unit for translation. To develop a speech-to-speech machine translation system for monologues based on the clause as the translation unit, we need a monologue parallel corpus with clause alignment. In this paper, we describe how to build a Japanese-English monologue parallel corpus with clauses aligned, and discuss the features of this corpus. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,831 |
inproceedings | king-etal-2003-femti | {FEMTI}: creating and using a framework for {MT} evaluation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.30/ | King, Margaret and Popescu-Belis, Andrei and Hovy, Eduard | Proceedings of Machine Translation Summit IX: Papers | null | This paper presents FEMTI, a web-based Framework for the Evaluation of Machine Translation in ISLE. FEMTI offers structured descriptions of potential user needs, linked to an overview of technical characteristics of MT systems. The description of possible systems is mainly articulated around the quality characteristics for software product set out in ISO/IEC standard 9126. Following the philosophy set out there and in the related 14598 series of standards, each quality characteristic bottoms out in metrics which may be applied to a particular instance of a system in order to judge how satisfactory the system is with respect to that characteristic. An evaluator can use the description of user needs to help identify the specific needs of his evaluation and the relations between them. He can then follow the pointers to system description to determine what metrics should be applied and how. In the current state of the framework, emphasis is on being exhaustive, including as much as possible of the information available in the literature on machine translation evaluation. Future work will aim at being more analytic, looking at characteristics and metrics to see how they relate to one another, validating metrics and investigating the correlation between particular metrics and human judgement. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,832 |
inproceedings | kitamura-murata-2003-practical | Practical machine translation system allowing complex patterns | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.31/ | Kitamura, Mihoko and Murata, Toshiki | Proceedings of Machine Translation Summit IX: Papers | null | Pattern-based machine translation systems can be easily customized by adding new patterns. To gain full profits from this character, input of patterns should be both expressive and simple to understand. The pattern-based machine translation system we have developed simplifies the handling of features in patterns by allowing sharing constraints between non-terminal symbols, and implementing an automated scheme of feature inheritance between syntactic classes. To avoid conflicts inherent to the pattern-based approach the system has priority control between patterns and between dictionaries. This approach proved its scalability in the web-based collaborative translation environment {\textquoteleft}Yakushite Net.' | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,833 |
inproceedings | leusch-etal-2003-novel | A novel string-to-string distance measure with applications to machine translation evaluation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.32/ | Leusch, Gregor and Ueffing, Nicola and Ney, Hermann | Proceedings of Machine Translation Summit IX: Papers | null | We introduce a string-to-string distance measure which extends the edit distance by block transpositions as constant cost edit operation. An algorithm for the calculation of this distance measure in polynomial time is presented. We then demonstrate how this distance measure can be used as an evaluation criterion in machine translation. The correlation between this evaluation criterion and human judgment is systematically compared with that of other automatic evaluation measures on two translation tasks. In general, like other automatic evaluation measures, the criterion shows low correlation at sentence level, but good correlation at system level. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,834 |
inproceedings | maier-clarke-2003-scalability | Scalability in {MT} systems | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.33/ | Maier, Elisabeth and Clarke, Anthony | Proceedings of Machine Translation Summit IX: Papers | null | In this paper we show why scalability is one of the most important aspects for the evaluation of Machine Translation (MT) systems and what scalability entails in the framework of MT. We illustrate the issue of scalability by reporting about an MT solution, which has been chosen in the course of a thorough hands-on evaluation and which in the meantime has been developed from a pilot system to a MT turnkey solution for mid-to large-scale enterprises. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,835 |
inproceedings | mitamura-etal-2003-source | Source language diagnostics for {MT} | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.34/ | Mitamura, Teruko and Baker, Kathryn and Svoboda, David and Nyberg, Eric | Proceedings of Machine Translation Summit IX: Papers | null | This paper presents a source language diagnostic system for controlled translation. Diagnostics were designed and implemented to address the most difficult rewrites for authors, based on an empirical analysis of log files containing over 180,000 sentences. The design and implementation of the diagnostic system are presented, along with experimental results from an empirical evaluation of the completed system. We found that the diagnostic system can correctly identify the problem in 90.2{\%} of the cases. In addition, depending on the type of grammar problem, the diagnostic system may offer a rewritten sentence. We found that 89.4{\%} of the rewritten sentences were correctly rewritten. The results suggest that these methods could be used as the basis for an automatic rewriting system in the future. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,836 |
inproceedings | nariyama-2003-resolving | Resolving {\textquoteleft}incognito' ellipsis: treatment for constructions that disguise ellipsis | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.35/ | Nariyama, Shigeko | Proceedings of Machine Translation Summit IX: Papers | null | This paper raises a neglected issue in the study of ellipsis resolution. The existence of ellipsis under certain constructions is often disguised due to the structure that assigns the nominative marking to what is typically the object. This kind of ellipsis deserves attention in view of the fact that its referent is the agent of the sentence and that these constructions are observed in diverse languages. A problem is posed by virtue of the fact that English is not one of those languages, and it overtly expresses the referent of ellipsis that is implicit in those languages that use those constructions. Hence, the recognition and resolution of such ellipses is of importance particularly in machine translation systems that translate sentences with {\textquotedblleft}incognito ellipsis{\textquotedblright} from those languages into English. After presenting the types of constructions, the paper explicates the mechanisms that govern the constructions in Japanese, and proposes a method to resolve such incognito ellipses along with common ellipses in a unified manner. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,837 |
inproceedings | nomoto-2003-predictive | Predictive models of performance in multi-engine machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.36/ | Nomoto, Tadashi | Proceedings of Machine Translation Summit IX: Papers | null | The paper describes a novel approach to Multi-Engine Machine Translation. We build statistical models of performance of translations and use them to guide us in combining and selecting from outputs from multiple MT engines. We empirically demonstrate that the MEMT system based on the models outperforms any of its component engine. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,838 |
inproceedings | oard-och-2003-rapid | Rapid-response machine translation for unexpected languages | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.37/ | Oard, Douglas W. and Och, Franz Josef | Proceedings of Machine Translation Summit IX: Papers | null | Statistical techniques for machine translation offer promise for rapid development in response to unexpected requirements, but realizing that potential requires rapid acquisition of required resources as well. This paper reports the results of experiments with resources collected in ten days; about 1.3 million words of parallel text from five types of sources and a bilingual term list with about 20,000 term pairs. Systems were trained with resources individually and in combination, using an approach based on alignment templates. The use of all available resources was found to yield the best results in an automatic evaluation using the BLEU measure, but a single resource (the Bible) coupled with a small amount of in-domain manual translation (less than 6,000 words) achieved more than 85{\%} of that upper baseline. With a concerted effort, such a system could be built in a single day. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,839 |
inproceedings | ono-2003-translation | Translation of news headlines | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.38/ | Ono, Kenji | Proceedings of Machine Translation Summit IX: Papers | null | Machine-Translation of news headlines is difficult since the sentences are fragmentary and abbreviations and acronyms of proper names are frequently used. Another difficulty is that, since the headline comes at the top of a news article, the context information useful to disambiguate the sense of words and to determine their translation(target word) is not available. This paper proposes a new approach to translating English news headline. In this approach, the abbreviations and acronyms in the headlines are complemented with their coreference in the lead of the article. Moreover, the target word selection is performed by referring to the translation of similar news articles retrieved from a parallel corpus. In the experiment, 100 English headlines are translated into Japanese using a corpus containing 30,000 English-Japanese article pairs, resulting in a 17 {\%} improvement in the target words and a 21 {\%} improvement in the style of 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 | 92,840 |
inproceedings | orliac-dillinger-2003-collocation | Collocation extraction for machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.39/ | Orliac, Brigitte and Dillinger, Mike | Proceedings of Machine Translation Summit IX: Papers | null | This paper reports on the development of a collocation extraction system that is designed within a commercial machine translation system in order to take advantage of the robust syntactic analysis that the system offers and to use this analysis to refine collocation extraction. Embedding the extraction system also addresses the need to provide information about the source language collocations in a system-specific form to support automatic generation of a collocation rulebase for analysis and 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 | 92,841 |
inproceedings | ortiz-etal-2003-use | On the use of statistical machine-translation techniques within a memory-based translation system ({AMETRA}) | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.40/ | Ort{\'i}z, Daniel and Garc{\'i}a-Varea, Ismael and Casacuberta, Francisco and Lagarda, Antonio and Gonz{\'a}lez, Jorge | Proceedings of Machine Translation Summit IX: Papers | null | The goal of the AMETRA project is to make a computer-assisted translation tool from the Spanish language to the Basque language under the memory-based translation framework. The system is based on a large collection of bilingual word-segments. These segments are obtained using linguistic or statistical techniques from a Spanish-Basque bilingual corpus consisting of sentences extracted from the Basque Country`s of{\textsterling}cial government record. One of the tasks within the global information document of the AMETRA project is to study the combination of well-known statistical techniques for the translation of short sequences and techniques for memory-based translation. In this paper, we address the problem of constructing a statistical module to deal with the task of translating segments. The task undertaken in the AMETRA project is compared with other existing translation tasks, This study includes the results of some preliminary experiments we have carried out using well-known statistical machine translation tools and techniques. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,842 |
inproceedings | popescu-belis-2003-experiment | An experiment in comparative evaluation: humans vs. computers | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.41/ | Popescu-Belis, Andrei | Proceedings of Machine Translation Summit IX: Papers | null | This paper reports results from an experiment that was aimed at comparing evaluation metrics for machine translation. Implemented as a workshop at a major conference in 2002, the experiment defined an evaluation task, description of the metrics, as well as test data consisting of human and machine translations of two texts. Several metrics, either applicable by human judges or automated, were used, and the overall results were analyzed. It appeared that most human metrics and automated metrics provided in general consistent rankings of the various candidate translations; the ranking of the human translations matched the one provided by translation professionals; and human translations were distinguished from machine translations. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,843 |
inproceedings | rapp-2003-word | Word sense discovery based on sense descriptor dissimilarity | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.42/ | Rapp, Reinhard | Proceedings of Machine Translation Summit IX: Papers | null | In machine translation, information on word ambiguities is usually provided by the lexicographers who construct the lexicon. In this paper we propose an automatic method for word sense induction, i.e. for the discovery of a set of sense descriptors to a given ambiguous word. The approach is based on the statistics of the distributional similarity between the words in a corpus. Our algorithm works as follows: The 20 strongest first-order associations to the ambiguous word are considered as sense descriptor candidates. All pairs of these candidates are ranked according to the following two criteria: First, the two words in a pair should be as dissimilar as possible. Second, although being dissimilar their co-occurrence vectors should add up to the co-occurrence vector of the ambiguous word scaled by two. Both conditions together have the effect that preference is given to pairs whose co-occurring words are complementary. For best results, our implementation uses singular value decomposition, entropy-based weights, and second-order similarity metrics. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,844 |
inproceedings | roh-etal-2003-proper | For the proper treatment of long sentences in a sentence pattern-based {E}nglish-{K}orean {MT} system | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.43/ | Roh, Yoon-Hyung and Hong, Munpyo and Choi, Sung-Kwon and Lee, Ki-Young and Park, Sang-Kyu | Proceedings of Machine Translation Summit IX: Papers | null | This paper describes a sentence pattern-based English-Korean machine translation system backed up by a rule-based module as a solution to the translation of long sentences. A rule-based English-Korean MT system typically suffers from low translation accuracy for long sentences due to poor parsing performance. In the proposed method we only use chunking information on the phrase-level of the parse result (i.e. NP, PP, and AP). By applying a sentence pattern directly to a chunking result, the high performance of analysis and a good quality of translation are expected. The parsing efficiency problem in the traditional RBMT approach is resolved by sentence partitioning, which is generally assumed to have many problems. However, we will show that the sentence partitioning has little side effect, if any, in our approach, because we use only the chunking results for the transfer. The coverage problem of a pattern-based method is overcome by applying sentence pattern matching recursively to the sub-sentences of the input sentence, in case there is no exact matching pattern to the 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 | 92,845 |
inproceedings | schwartz-etal-2003-disambiguation | Disambiguation of {E}nglish {PP} attachment using multilingual aligned data | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.44/ | Schwartz, Lee and Aikawa, Takako and Quirk, Chris | Proceedings of Machine Translation Summit IX: Papers | null | Prepositional phrase attachment (PP attachment) is a major source of ambiguity in English. It poses a substantial challenge to Machine Translation (MT) between English and languages that are not characterized by PP attachment ambiguity. In this paper we present an unsupervised, bilingual, corpus-based approach to the resolution of English PP attachment ambiguity. As data we use aligned linguistic representations of the English and Japanese sentences from a large parallel corpus of technical texts. The premise of our approach is that with large aligned, parsed, bilingual (or multilingual) corpora, languages can learn non-trivial linguistic information from one another with high accuracy. We contend that our approach can be extended to linguistic phenomena other than PP attachment. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,846 |
inproceedings | senellart-etal-2003-systran | {SYSTRAN} new generation: the {XML} translation workflow | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.45/ | Senellart, Jean and Boitet, Christian and Romary, Laurent | Proceedings of Machine Translation Summit IX: Papers | null | Customization of Machine Translation (MT) is a prerequisite for corporations to adopt the technology. It is therefore important but nonetheless challenging. Ongoing implementation proves that XML is an excellent exchange device between MT modules that efficiently enables interaction between the user and the processes to reach highly granulated structure-based customization. Accomplished through an innovative approach called the SYSTRAN Translation Stylesheet, this method is coherent with the current evolution of the {\textquotedblleft}authoring process{\textquotedblright}. As a natural progression, the next stage in the customization process is the integration of MT in a multilingual tool kit designed for the {\textquotedblleft}authoring process{\textquotedblright}. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,847 |
inproceedings | senellart-etal-2003-systran-intuitive | {SYSTRAN} intuitive coding technology | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.46/ | Senellart, Jean and Yang, Jin and Rebollo, Anabel | Proceedings of Machine Translation Summit IX: Papers | null | Customizing a general-purpose MT system is an effective way to improve machine translation quality for specific usages. Building a user-specific dictionary is the first and most important step in the customization process. An intuitive dictionary-coding tool was developed and is now utilized to allow the user to build user dictionaries easily and intelligently. SYSTRAN`s innovative and proprietary IntuitiveCoding{\textregistered} technology is the engine powering this tool. It is comprised of various components: massive linguistic resources, a morphological analyzer, a statistical guesser, finite-state automaton, and a context-free grammar. Methodologically, IntuitiveCoding{\textregistered} is also a cross-application approach for high quality dictionary building in terminology import and exchange. This paper describes the various components and the issues involved in its implementation. An evaluation frame and utilization of the technology are also presented. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,848 |
inproceedings | shimohata-etal-2003-example | Example-based rough translation for speech-to-speech translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.47/ | Shimohata, Mitsuo and Sumita, Eiichiro and Matsumoto, Yuji | Proceedings of Machine Translation Summit IX: Papers | null | Example-based machine translation (EBMT) is a promising translation method for speech-to-speech translation (S2ST) because of its robustness. However, it has two problems in that the performance degrades when input sentences are long and when the style of the input sentences and that of the example corpus are different. This paper proposes example-based rough translation to overcome these two problems. The rough translation method relies on {\textquotedblleft}meaning-equivalent sentences,{\textquotedblright} which share the main meaning with an input sentence despite missing some unimportant information. This method facilitates retrieval of meaning-equivalent sentences for long input sentences. The retrieval of meaning-equivalent sentences is based on content words, modality, and tense. This method also provides robustness against the style differences between the input sentence and the example corpus. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,849 |
inproceedings | smets-etal-2003-high | High quality machine translation using a machine-learned sentence realization component | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.48/ | Smets, Martine and Gamon, Michael and Pinkham, Jessie and Reutter, Tom and Pettenaro, Martine | Proceedings of Machine Translation Summit IX: Papers | null | We describe the implementation of two new language pairs (English-French and English-German) which use machine-learned sentence realization components instead of hand-written generation components. The resulting systems are evaluated by human evaluators, and in the technical domain, are equal to the quality of highly respected commercial systems. We comment on the difficulties that are encountered when using machine-learned sentence realization in the context of 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 | 92,850 |
inproceedings | somers-sugita-2003-evaluating | Evaluating commercial spoken language translation software | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.49/ | Somers, Harold and Sugita, Yuri | Proceedings of Machine Translation Summit IX: Papers | null | While spoken language translation remains a research goal, a crude form of it is widely available commercially for Japanese{--}English as a pipeline concatenation of speech-to-text recognition (SR), text-to-text translation (MT) and text-to-speech synthesis (SS). This paper proposes and illustrates an evaluation methodology for this noisy channel which tries to quantify the relative amount of degradation in translation quality due to each of the contributing modules. A small pilot experiment involving word-accuracy rate for the SR, and a fidelity evaluation for the MT and SS modules is proposed in which subjects are asked to paraphrase translated and/or synthesised sentences from a tourist`s phrasebook. Results show (as expected) that MT is the {\textquotedblleft}noisiest{\textquotedblright} channel, with SS contributing least noise. The concatenation of the three channels is worse than could be predicted from the performance of each as individual tasks. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,851 |
inproceedings | tanaka-baldwin-2003-translation | Translation selection for {J}apanese-{E}nglish noun-noun compounds | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.50/ | Tanaka, Takaaki and Baldwin, Timothy | Proceedings of Machine Translation Summit IX: Papers | null | We present a method for compositionally translating Japanese NN compounds into English, using a word-level transfer dictionary and target language monolingual corpus. The method interpolates over fully-specified and partial translation data, based on corpus evidence. In evaluation, we demonstrate that interpolation over the two data types is superior to using either one, and show that our method performs at an F-score of 0.68 over translation-aligned inputs and 0.66 over a random sample of 500 NN compounds. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,852 |
inproceedings | turian-etal-2003-evaluation | Evaluation of machine translation and its evaluation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.51/ | Turian, Joseph P. and Shen, Luke and Melamed, I. Dan | Proceedings of Machine Translation Summit IX: Papers | null | Evaluation of MT evaluation measures is limited by inconsistent human judgment data. Nonetheless, machine translation can be evaluated using the well-known measures precision, recall, and their average, the F-measure. The unigram-based F-measure has significantly higher correlation with human judgments than recently proposed alternatives. More importantly, this standard measure has an intuitive graphical interpretation, which can facilitate insight into how MT systems might be improved. The relevant software is publicly available from \url{http://nlp.cs.nyu.edu/GTM/}. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,853 |
inproceedings | ueffing-etal-2003-confidence | Confidence measures for statistical machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.52/ | Ueffing, Nicola and Macherey, Klaus and Ney, Hermann | Proceedings of Machine Translation Summit IX: Papers | null | In this paper, we present several confidence measures for (statistical) machine translation. We introduce word posterior probabilities for words in the target sentence that can be determined either on a word graph or on an N best list. Two alternative confidence measures that can be calculated on N best lists are proposed. The performance of the measures is evaluated on two different translation tasks: on spontaneously spoken dialogues from the domain of appointment scheduling, and on a collection of technical manuals. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,854 |
inproceedings | vogel-etal-2003-cmu | The {CMU} statistical machine translation system | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.53/ | Vogel, Stephan and Zhang, Ying and Huang, Fei and Tribble, Alicia and Venugopal, Ashish and Zhao, Bing and Waibel, Alex | Proceedings of Machine Translation Summit IX: Papers | null | In this paper we describe the components of our statistical machine translation system. This system combines phrase-to-phrase translations extracted from a bilingual corpus using different alignment approaches. Special methods to extract and align named entities are used. We show how a manual lexicon can be incorporated into the statistical system in an optimized way. Experiments on Chinese-to-English and Arabic-to-English translation tasks are presented. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,855 |
inproceedings | watanabe-sumita-2003-example | Example-based decoding for statistical machine translation | null | sep # " 23-27" | 2003 | New Orleans, USA | null | https://aclanthology.org/2003.mtsummit-papers.54/ | Watanabe, Taro and Sumita, Eiichiro | Proceedings of Machine Translation Summit IX: Papers | null | This paper presents a decoder for statistical machine translation that can take advantage of the example-based machine translation framework. The decoder presented here is based on the greedy approach to the decoding problem, but the search is initiated from a similar translation extracted from a bilingual corpus. The experiments on multilingual translations showed that the proposed method was far superior to a word-by-word generation beam search algorithm. | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | null | 92,856 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.