polygraf-ai/ACL-abstracts · Datasets at Hugging Face

inproceedings

mahsut-etal-2001-utilizing

Utilizing agglutinative features in {J}apanese-{U}ighur machine translation

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.40/

Mahsut, Muhtar and Ogawa, Yasuhiro and Sugino, Kazue and Inagaki, Yasuyoshi

Proceedings of Machine Translation Summit VIII

null

Japanese and Uighur languages are agglutinative languages and they have many syntactical and morphological similarities. And roughly speaking, we can translate Japanese into Uighur sequentially by replacing Japanese words with corresponding Uighur ones after morphological analysis. However, we should translate agglutinated suffixes carefully to make correct translation, because they play important roles on both languages. In this paper, we pay attention to them and propose a Japanese-Uighur machine translation utilizing the agglutinative features of both languages. To deal with the agglutinative features, we use the derivational grammar, which makes the similarities clearer between both languages. This makes our system proposed here simple and systematical. We have implemented the machine translation system and evaluated how effectively our system works.

null

94,890

inproceedings

maier-etal-2001-evaluation

Evaluation of machine translation systems at {CLS} Corporate Language Services {AG}

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.41/

Maier, Elisabeth and Clarke, Anthony and Stadler, Hans-Udo

Proceedings of Machine Translation Summit VIII

null

This paper describes the evaluation of Machine Translation (MT) System for use in a large company. To take into account the specific requirements of such an environment, a pragmatic approach for the evaluation was developed. It consists of five steps ranging from a specification of the evaluation process to the integration of the chosen MT system in a given infrastructure. The process includes a specification of MT evaluation criteria relevant to systems which have to be employed for a large customer base. The paper also shows the results of such an evaluation study which was recently carried out at CLS Corporate Language Services AG, where COMPRENDIUM is in the meantime being employed as corporate MT system.

null

94,891

inproceedings

miller-vanni-2001-scaling

Scaling the {ISLE} taxonomy: development of metrics for the multi-dimensional characterization of machine translation quality

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.42/

Miller, Keith J. and Vanni, Michelle

Proceedings of Machine Translation Summit VIII

null

The DARPA MT evaluations of the early 1990s, along with subsequent work on the MT Scale, and the International Standards for Language Engineering (ISLE) MT Evaluation framework represent two of the principal efforts in Machine Translation Evaluation (MTE) over the past decade. We describe a research program that builds on both of these efforts. This paper focuses on the selection of MT output features suggested in the ISLE framework, as well as the development of metrics for the features to be used in the study. We define each metric and describe the rationale for its development. We also discuss several of the finer points of the evaluation measures that arose as a result of verification of the measures against sample output texts from three machine translation systems.

null

94,892

inproceedings

mitamura-etal-2001-pronominal

Pronominal anaphora resolution in {KANTOO} {E}nglish-to-{S}panish machine translation system

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.43/

Mitamura, Teruko and Nyberg, Eric and Torrejon, Enrique and Svoboda, David and Baker, Kathryn

Proceedings of Machine Translation Summit VIII

null

We describe the automatic resolution of pronominal anaphora using KANT Controlled English (KCE) and the KANTOO English-to-Spanish MT system. Our algorithm is based on a robust, syntax-based approach that applies a set of restrictions and preferences to select the correct antecedent. We report a success rate of 89.6{\%} on a training corpus with 289 anaphors, and 87.5{\%} on held-out data containing 145 anaphors. Resolution of anaphors is important in translation, due to gender mismatches among languages; our approach translates anaphors to Spanish with 97.2{\%} accuracy.

null

94,893

inproceedings

nariyama-2001-multiple

Multiple argument ellipses resolution in {J}apanese

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.44/

Nariyama, Shigeko

Proceedings of Machine Translation Summit VIII

null

Some Japanese clauses contain more than one argument ellipsis, and yet this fact has not adequately been accounted for in the study of ellipsis resolution in the current literature, which predominantly focus resolving one ellipsis per sentence. This paper proposes a method using a ``salient referent list'', which identifies the referents of such multiple argument ellipses as well as offers ellipsis resolution as a whole by considering contextual information.

null

94,894

inproceedings

niessen-ney-2001-morpho

Morpho-syntactic analysis for reordering in statistical machine translation

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.45/

Niessen, Sonja and Ney, Hermann

Proceedings of Machine Translation Summit VIII

null

In the framework of statistical machine translation (SMT), correspondences between the words in the source and the target language are learned from bilingual corpora on the basis of so-called alignment models. Among other things these are meant to capture the differences in word order in different languages. In this paper we show that SMT can take advantage of the explicit introduction of some linguistic knowledge about the sentence structure in the languages under consideration. In contrast to previous publications dealing with the incorporation of morphological and syntactic information into SMT, we focus on two aspects of reordering for the language pair German and English, namely question inversion and detachable German verb prefixes. The results of systematic experiments are reported and demonstrate the applicability of the approach to both translation directions on a German-English corpus.

null

94,895

inproceedings

och-ney-2001-statistical

Statistical multi-source translation

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.46/

Och, Franz Josef and Ney, Hermann

Proceedings of Machine Translation Summit VIII

null

We describe methods for translating a text given in multiple source languages into a single target language. The goal is to improve translation quality in applications where the ultimate goal is to translate the same document into many languages. We describe a statistical approach and two specific statistical models to deal with this problem. Our method is generally applicable as it is independent of specific models, languages or application domains. We evaluate the approach on a multilingual corpus covering all eleven official European Union languages that was collected automatically from the Internet. In various tests we show that these methods can significantly improve translation quality. As a side effect, we also compare the quality of statistical machine translation systems for many European languages in the same domain.

null

94,896

inproceedings

paul-2001-translation

Translation knowledge recycling for related languages

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.48/

Paul, Michael

Proceedings of Machine Translation Summit VIII

null

An increasing interest in multi-lingual translation systems demands a reconsideration of the development costs of machine translation engines for language pairs. This paper proposes an approach that reuses the existing translation knowledge resources of high-quality translation engines for translation into different, but related languages. The lexical information of the target representation is utilized to generate the corresponding translation in the related language by using a transfer dictionary for the mapping of words and a set of heuristic rules for the mapping of structural information. Experiments using a Japanese-English translation engine for the generation of German translations show a minor decrease of up to 5{\%} in the acceptability of the German output compared with the English translation of unseen Japanese input.

null

94,898

inproceedings

petrits-etal-2001-commission

The Commission ́s {MT} system: today and tomorrow

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.49/

Petrits, Angeliki and Braun-Chen, Francine and Mart{\'i}nez Garc{\'i}a, Jes{\'u}s Manuel and Ross, Cameron and Sauer, Rosemarie and Torquati, Angelo and Reichling, Alain

Proceedings of Machine Translation Summit VIII

null

This paper presents a snapshot of how the Commission`s MT system (EC SYSTRAN) is used today and a glimpse of how that picture will change tomorrow. It looks in turn at: the origins of the system; how it is accessed; who requests MT and why; how users can influence the quality of output; the Rapid Post-editing Service; and the latest usage statistics, which augur well for the future. The paper closes with a look at that future, touching on the move to a new computer platform and plans for new language pairs, concluding that after twenty-five years of development, MT has become an integral part of the Commission`s working environment.

null

94,899

inproceedings

pinkham-etal-2001-rapid

Rapid assembly of a large-scale {F}rench-{E}nglish {MT} system

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.50/

Pinkham, Jessie and Corston-Oliver, Monica and Smets, Martine and Pettenaro, Martine

Proceedings of Machine Translation Summit VIII

null

Past research has shown that the ideal MT system should be modular and devoid of language pair specific information in its design. We describe here the assembly of TAMTAM (Traduction Automatique Microsoft), the French-English research MT system under development at Microsoft, which was constructed from a combination of pre-existing rule-based components and automatically created components. At this stage, the system has not been adapted either computationally or linguistically to the French-English context and yet it performs only slightly below the French-English Systran system in independent blind human evaluations

null

94,900

inproceedings

povlsen-bech-2001-ape

Ape: reducing the monkey business in post-editing by automating the task intelligently

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.51/

Povlsen, Claus and Bech, Annelise

Proceedings of Machine Translation Summit VIII

null

For a professional user of MT, quality, performance and cost efficiency are critical. It is therefore surprising that only little attention {--} both in theory and in practice - has been given to the task of post-editing machine translated texts. This paper will focus on this important user aspect and demonstrate that substantial savings in time and effort can be achieved by implementing intelligent automatic tools. Our point of departure is the PaTrans MT-system, developed by CST and used by the Danish translation company Lingtech. An intelligent post-editing facility, Ape, has been developed and added to the system. We will outline and discuss this mechanism and its positive effects on the output. The underlying idea of the intelligent post-editing facility is to exploit the lexical and grammatical knowledge already present in the MT-system`s linguistic components. Conceptually, our approach is general, although its implementation remains system specific. Surveys of post-editor satisfaction and cost-efficiency improvements, as well as a quantitative, benchmark-based evaluation of the effect of Ape demonstrate the success of the approach and encourage further development.

null

94,901

inproceedings

ribeiro-etal-2001-cognates

Cognates alignment

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.52/

Ribeiro, Ant{\'onio and Dias, Ga{\"el and Lopes, Gabriel and Mexia, Jo{\~ao

Proceedings of Machine Translation Summit VIII

null

Some authors (Simard et al.; Melamed; Danielsson {\& M{\"uhlenbock) have suggested measures of similarity of words in different languages so as to find extra clues for alignment of parallel texts. Cognate words, like {\textquoteleftParliament' and {\textquoteleftParlement', in English and French respectively, provide extra anchors that help to improve the quality of the alignment. In this paper, we will extend an alignment algorithm proposed by Ribeiro et al. using typical contiguous and non-contiguous sequences of characters extracted using a statistically sound method (Dias et al.). With these typical sequences, we are able to find more reliable correspondence points and improve the alignment quality without recurring to heuristics to identify cognates.

null

94,902

inproceedings

richardson-etal-2001-achieving

Achieving commercial-quality translation with example-based methods

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.53/

Richardson, Stephen and Dolan, William and Menezes, Arul and Pinkham, Jessie

Proceedings of Machine Translation Summit VIII

null

We describe MSR-MT, a large-scale example-based machine translation system under development for several language pairs. Trained on aligned English-Spanish technical prose, a blind evaluation shows that MSR-MT`s integration of rule-based parsers, example based processing, and statistical techniques produces translations whose quality in this domain exceeds that of uncustomized commercial MT systems.

null

94,903

inproceedings

rinsche-2001-managing

Managing translation and localisation projects with {LTC} Organiser

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.54/

Rinsche, Adriane

Proceedings of Machine Translation Summit VIII

null

Using an invented case study, the paper describes how multilingual translation projects can be managed efficiently with an enterprise resource management tool called {\textquotedblleft}LTC Organiser{\textquotedblright}, which was developed specifically for the particular requirements of the language industry. The talk will describe the most important aspects of the integrated solution, such as client and supplier management, project and finance management, managing tools used in the translation process, reporting facilities, security and user management, directory management, sort and search facilities as well as web functionality available at several levels.

null

94,904

inproceedings

sanchis-etal-2001-morphological

A morphological analyser for machine translation based on finite-state transducers

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.55/

Sanchis, Alberto and Pic{\'o}, David and Miquel del Val, Joan and Fabregat, Ferran and Tom{\'a}s, Jes{\'u}s and Pastor, Mois{\'e}s and Casacuberta, Francisco and Vidal, Enrique

Proceedings of Machine Translation Summit VIII

null

A finite-state, rule-based morphological analyser is presented here, within the framework of machine translation system TAVAL. This morphological analyser introduces specific features which are particularly useful for translation, such as the detection and morphological tagging of word groups that act as a single lexical unit for translation purposes. The case where words in one such group are not strictly contiguous is also covered. A brief description of the Spanish-to-Catalan and Catalan-to-Spanish translation system TAVAL is given in the paper.

null

94,905

inproceedings

senellart-etal-2001-new

New generation Systran translation system

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.56/

Senellart, Jean and Dienes, P{\'e}ter and V{\'a}radi, Tam{\'a}s

Proceedings of Machine Translation Summit VIII

null

In this paper, we present the design of the new generation Systran translation systems, currently utilized in the development of English-Hungarian, English-Polish, English-Arabic, French-Arabic, Hungarian-French and Polish-French language pairs. The new design, based on the traditional Systran machine translation expertise and the existing linguistic resources, addresses the following aspects: efficiency, modularity, declarativity, reusability, and maintainability. Technically, the new systems rely on intensive use of state-of-the-art finite automaton and formal grammar implementation. The finite automata provide the essential lookup facilities and the natural capacity of factorizing intuitive linguistic sets. Linguistically, we have introduced a full monolingual description of linguistic information and the concept of implicit transfer. Finally, we present some by-products that are directly derived from the new architecture: intuitive coding tools, spell checker and syntactic tagger.

null

94,906

inproceedings

senellart-etal-2001-resource

Resource alignment for machine translation or implicit transfer

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.57/

Senellart, Jean and Plitt, Mirko and Bailly, Christophe and Cardoso, Fran{\c{c}}oise

Proceedings of Machine Translation Summit VIII

null

In this article we present the concept of {\textquotedblleft}implicit transfer{\textquotedblright} rules. We will show that they represent a valid compromise between huge direct transfer terminology lists and large sets of transfer rules, which are very complex to maintain. We present a concrete, real-life application of this concept in a customization project (TOLEDO project) concerning the automatic translation of Autodesk (ADSK) support pages. In this application, the alignment is moreover combined with a graph representation substituting linear dictionaries. We show how the concept could be extended to increase coverage of traditional translation dictionaries as well as to extract terminology from large existing multilingual corpora. We also introduce the concept of ``alignment dictionary'' which seems promising in its ability to extend the pragmatic limits of multilingual dictionary management.

null

94,907

inproceedings

shimohata-etal-2001-collaborative

Collaborative translation environment on the Web

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.59/

Shimohata, Sayori and Kitamura, Mihoko and Sukehiro, Tatsuya and Murata, Toshiki

Proceedings of Machine Translation Summit VIII

null

This paper describes a comprehensive translation environment build on the Internet. This environment is designed not only to translate web pages but also to support translation work on the web. We first introduce a basic idea and implementation of this environment and then compare it to conventional machine translation (MT) systems available on the web and translation memories.

null

94,909

inproceedings

simard-langlais-2001-sub

Sub-sentential exploitation of translation memories

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.60/

Simard, Michel and Langlais, Philippe

Proceedings of Machine Translation Summit VIII

null

Translation memory systems (TMS) are a family of computer tools whose purpose is to facilitate and encourage the re-use of existing translations. By searching a database of past translations, these systems can retrieve the translation of whole segments of text and propose them to the translator for re-use. However, the usefulness of existing TMS`s is limited by the nature of the text segments that that they are able to put in correspondence, generally whole sentences. This article examines the potential of a type of system that is able to recuperate the translation of sub-sentential sequences of words.

null

94,910

inproceedings

smith-2001-using

Using information technology to optimise translation processes at {P}ricewaterhouse{C}oopers {M}adrid

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.61/

Smith, Ross

Proceedings of Machine Translation Summit VIII

null

This paper describes how information technology is used by the Translation Department of PricewaterhouseCoopers in Madrid to optimise translation processes. It commences by describing a mechanism for handling workflow via the corporate network, designed to maximise speed and efficiency in translation requests and also to function as an automated record for administration purposes. This is followed by an appraisal of the CAT system used in the Translation Department, namely the Trados Workbench and related applications. Finally, an ongoing project for making MT (Systran) available to PwC employees around the world over the Firm`s intranet is outlined.

null

94,911

inproceedings

sugaya-etal-2001-precise

Precise measurement method of a speech translation system`s capability with a paired comparison method between the system and humans

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.62/

Sugaya, Fumiaki and Yasuda, Keiji and Takezawa, Toshiyuki and Yamamoto, Seiichi

Proceedings of Machine Translation Summit VIII

null

The main goal of the present paper is to propose new schemes for the overall evaluation of a speech translation system. These schemes are expected to support and improve the design of the target application system, and precisely determine its performance. Experiments are conducted on the Japanese-to-English speech translation system ATR-MATRIX, which was developed at ATR Interpreting Telecommunications Research Laboratories. In the proposed schemes, the system`s translations are compared with those of a native Japanese taking the Test of English for International Communication (TOEIC), which is used as a measure of one`s speech translation capability. Subjective and automatic comparisons are made and the results are compared. A regression analysis on the subjective results shows that the speech translation capability of ATR-MATRIX matches a Japanese person scoring around 500 on the TOEIC. The automatic comparisons also show promising results.

null

94,912

inproceedings

tang-al-adhaileh-2001-converting

Converting a bilingual dictionary into a bilingual knowledge bank based on the synchronous {SSTC}

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.63/

Tang, Enya Kong and Al-Adhaileh, Mosleh H.

Proceedings of Machine Translation Summit VIII

null

In this paper, we would like to present an approach to construct a huge Bilingual Knowledge Bank (BKB) from an English Malay bilingual dictionary based on the idea of synchronous Structured String-Tree Correspondence (SSTC). The SSTC is a general structure that can associate an arbitrary tree structure to string in a language as desired by the annotator to be the interpretation structure of the string, and more importantly is the facility to specify the correspondence between the string and the associated tree which can be non-projective. With this structure, we are able to match linguistic units at different inter levels of the structure (i.e. define the correspondence between substrings in the sentence, nodes in the tree, subtrees in the tree and sub-correspondences in the SSTC). This flexibility makes synchronous SSTC very well suited for the construction of a Bilingual Knowledge Bank we need for the English-Malay MT application.

null

94,913

inproceedings

tomas-casacuberta-2001-monotone

Monotone statistical translation using word groups

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.64/

Tom{\'a}s, Jes{\'u}s and Casacuberta, Francisco

Proceedings of Machine Translation Summit VIII

null

A new system for statistical natural language translation for languages with similar grammar is introduced. Specifically, it can be used with Romanic Languages, such as French, Spanish or Catalan. The statistical translation uses two sources of information: a language model and a translation model. The language model used is a standard trigram model. A new approach is defined in the translation model. The two main properties of the translation model are: the translation probabilities are computed between groups of words and the alignment between those groups is monotone. That is, the order between the word groups in the source sentence is conserved in the target sentence. Once, the translation model has been defined, we present an algorithm to infer its parameters from training samples. The translation process is carried out with an efficient algorithm based on stack-decoding. Finally, we present some translation results from Catalan to Spanish and compare our model with other conventional models.

null

94,914

inproceedings

underwood-jongejan-2001-translatability

Translatability checker: a tool to help decide whether to use {MT}

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.65/

Underwood, Nancy and Jongejan, Bart

Proceedings of Machine Translation Summit VIII

null

This paper describes a tool designed to assess the machine translatability of English source texts by assigning a translatability index to both individual sentences and the text as a whole. The tool is designed to be both stand-alone and integratable into a suite of other tools which together help to improve the quality of professional translation in the preparatory phase of the translation workflow. Assessing translatability is an important element in ensuring the most efficient and cost effective use of current translation technology, and the tool must be able to quickly determine the translatability of a text without itself using too many resources. It is therefore based on rather simple tagging and pattern matching technologies which bring with them a certain level of indeterminacy. This potential disadvantage can, however, be offset by the fact that an annotated version of the text is simultaneously produced to allow the user to interpret the results of the checker.

null

94,915

inproceedings

walker-etal-2001-sentence

Sentence boundary detection: a comparison of paradigms for improving {MT} quality

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.66/

Walker, Daniel J. and Clements, David E. and Darwin, Maki and Amtrup, Jan W.

Proceedings of Machine Translation Summit VIII

null

The reliable detection of sentence boundaries in running text is one of the first important steps in preparing an input document for translation. Although this is often neglected, it is necessary to obtain a translation with a high degree of quality. In this paper, we present a comparison of different paradigms for the detection of sentence boundaries in written text. We compare three different approaches: Directly encoding the knowledge in a program, a rule-based system relying on regular expressions to describe boundaries, and a statistical maximum-entropy learning algorithm to obtain knowledge about boundaries. Using the statistical system, we obtain a recall of 98.14{\%}, classifying boundaries of six types, and using a training corpus of under 10,000 sentences.

null

94,916

inproceedings

yasuda-etal-2001-automatic

An automatic evaluation method of translation quality using translation answer candidates queried from a parallel corpus

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.67/

Yasuda, Keiji and Sugaya, Fumiaki and Takezawa, Toshiyuki and Yamamoto, Seiichi and Yanagida, Masuzo

Proceedings of Machine Translation Summit VIII

null

An automatic translation quality evaluation method is proposed. In the proposed method, a parallel corpus is used to query translation answer candidates. The translation output is evaluated by measuring the similarity between the translation output and translation answer candidates with DP matching. This method evaluates a language translation subsystem of the Japanese-to-English ATR-MATRIX speech translation system developed at ATR Interpreting Telecommunications Research Laboratories. Discriminant analysis is then carried out to examine the evaluation performance of the proposed method. Experimental results show the effectiveness of the proposed method. The discriminant ratio is 83.5{\%} for 2-class discrimination between absolutely correct and less appropriate translations classified subjectively. Also discussed are issues of the proposed method when it is applied to speech translation systems which inevitably make recognition errors.

null

94,917

inproceedings

yokoyama-etal-2001-automatic

An automatic evaluation method for machine translation using two-way {MT}

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.68/

Yokoyama, Shoichi and Kashioka, Hideki and Kumano, Akira and Matsudaira, Masaki and Shirokizawa, Yoshiko and Kodama, Shuji and Ehara, Terumasa and Miyazawa, Shinichiro and Murata, Yuzo

Proceedings of Machine Translation Summit VIII

null

Evaluation of machine translation is one of the most important issues in this field. We have already proposed a quantitative evaluation of machine translation system. The method was roughly that an example sentence in Japanese is machine translated into English, and then into Japanese using several systems, and that the comparison of output Japanese sentences with the original Japanese sentence is done for the word identification, the correctness of the modification, the syntactic dependency, and the parataxis. By calculating the score, we could quantitatively evaluate the English machine translation. However, the extraction of word identification etc. was done by human, and the fact affects the correctness of evaluation. In order to solve this problem, we developed an automatic evaluation system. We report the detail of the system in this paper..

null

94,918

inproceedings

zhang-etal-2001-pre

Pre-processing of bilingual corpora for {M}andarin-{E}nglish {EBMT}

Maegaard, Bente

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-papers.69/

Zhang, Ying and Brown, Ralf and Frederking, Robert and Lavie, Alon

Proceedings of Machine Translation Summit VIII

null

Pre-processing of bilingual corpora plays an important role in Example-Based Machine Translation (EBMT) and Statistical-Based Machine Translation (SBMT). For our Mandarin-English EBMT system, pre-processing includes segmentation for Mandarin, bracketing for English and building a statistical dictionary from the corpora. We used the Mandarin segmenter from the Linguistic Data Consortium (LDC). It uses dynamic programming with a frequency dictionary to segment the text. Although the frequency dictionary is large, it does not completely cover the corpora. In this paper, we describe the work we have done to improve the segmentation for Mandarin and the bracketing process for English to increase the length of English phrases. A statistical dictionary is built from the aligned bilingual corpus. It is used as feedback to segmentation and bracketing to re-segment / re-bracket the corpus. The process iterates several times to achieve better results. The final results of the corpus pre-processing are a segmented/bracketed aligned bilingual corpus and a statistical dictionary. We achieved positive results by increasing the average length of Chinese terms about 60{\%} and 10{\%} for English. The statistical dictionary gained about a 30{\%} increase in coverage.

null

94,919

inproceedings

bruckner-plitt-2001-evaluating

Evaluating the operational benefit of using machine translation output as translation memory input

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.1/

Bruckner, Christine and Plitt, Mirko

Workshop on MT Evaluation

null

Following the guidelines for MT evaluation proposed in the ISLE taxonomy, this paper presents considerations and procedures for evaluating the integration of machine-translated segments into a larger translation workflow with Translation Memory (TM) systems. The scenario here focuses on the software localisation industry, which already uses TM systems and looks to further streamline the overall translation process by integrating Machine Translation (MT). The main agents involved in this evaluation scenario are localisation managers and translators; the primary aspects of evaluation are speed, quality, and user acceptance. Using the penalty feature of Translation Memory systems, the authors also outline a possible method for finding the {\textquotedblleft}right place{\textquotedblright} for MT produced segments among TM matches with different degrees of fuzziness.

null

94,920

inproceedings

marrafa-ribeiro-2001-quantitative

Quantitative evaluation of machine translation systems: sentence level

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.2/

Marrafa, Palmira and Ribeiro, Ant{\'o}nio

Workshop on MT Evaluation

null

This paper reports the first results of an on-going research on evaluation of Machine Translation quality. The starting point for this work was the framework of ISLE (the International Standards for Language Engineering), which provides a classification for evaluation of Machine Translation. In order to make a quantitative evaluation of translation quality, we pursue a more consistent, fine-grained and comprehensive classification of possible translation errors and we propose metrics for sentence level errors, specifically lexical and syntactic errors.

null

94,921

inproceedings

miller-etal-2001-evaluating

Evaluating machine translation output for an unknown source language: report of an {ISLE}-based investigation

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.3/

Miller, Keith J. and Gates, Donna M. and Underwood, Nancy and Magdalen, Josemina

Workshop on MT Evaluation

null

It is often assumed that knowledge of both the source and target languages is necessary in order to evaluate the output of a machine translation (MT) system. This paper reports on an experimental evaluation of Chinese-English MT and Spanish-English MT from output specifically designed for evaluators who do not read or speak Chinese or Spanish. An outline of the characteristics measured and evaluation follows.

null

94,922

inproceedings

mustafa-el-hadi-etal-2001-setting

Setting a methodology for machine translation evaluation

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.4/

Mustafa El Hadi, Widad and Timimi, Ismail and Dabbadie, Marianne

Workshop on MT Evaluation

null

In this paper some of the problems encountered in designing an evaluation for an MT system will be examined. The source text, in French, provided by INRA (Institut National pour la Recherche Agronomique i.e. National Institute for Agronomic Research) deals with biotechnology and animal reproduction. It has been translated into English. The output of the system (i.e. the result of the assembling of several components), as opposed to its individual modules or specific components (i.e. analysis, generation, grammar, lexicon, core, etc.), will be evaluated. Moreover, the evaluation will concentrate on translation quality and its fidelity to the source text. The evaluation is not comparative, which means that we tested a specific MT system, not necessarily representative of other MT systems that can be found on the market.

null

94,923

inproceedings

rajman-hartley-2001-automatically

Automatically predicting {MT} systems rankings compatible with fluency, adequacy and informativeness scores

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.6/

Rajman, Martin and Hartley, Tony

Workshop on MT Evaluation

null

The main goal of the work presented in this paper is to find an inexpensive and automatable way of predicting rankings of MT systems compatible with human evaluations of these systems expressed in the form of Fluency, Adequacy or Informativeness scores. Our approach is to establish whether there is a correlation between rankings derived from such scores and the ones that can be built on the basis of automatically computable attributes of syntactic or semantic nature. We present promising results obtained on the DARPA94 MT evaluation corpus.

null

94,925

inproceedings

reeder-2001-one

In one hundred words or less

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.7/

Reeder, Florence

Workshop on MT Evaluation

null

This paper reports on research which aims to test the efficacy of applying automated evaluation techniques, originally designed for human second language learners, to machine translation (MT) system evaluation. We believe that such evaluation techniques will provide insight into MT evaluation, MT development, the human translation process and the human language learning process. The experiment described here looks only at the intelligibility of MT output. The evaluation technique is derived from a second language acquisition experiment that showed that assessors can differentiate native from non-native language essays in less than 100 words. Particularly illuminating for our purposes is the set of factor on which the assessors made their decisions. We duplicated this experiment to see if similar criteria could be elicited from duplicating the test using both human and machine translation outputs in the decision set. The encouraging results of this experiment, along with an analysis of language factors contributing to the successful outcomes, is presented here.

null

94,926

inproceedings

reeder-etal-2001-naming

The naming of things and the confusion of tongues: an {MT} metric

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.8/

Reeder, Florence and Miller, Keith and Doyon, Jennifer and White, John

Workshop on MT Evaluation

null

This paper reports the results of an experiment in machine translation (MT) evaluation, designed to determine whether easily/rapidly collected metrics can predict the human generated quality parameters of MT output. In this experiment we evaluated a system`s ability to translate named entities, and compared this measure with previous evaluation scores of fidelity and intelligibility. There are two significant benefits potentially associated with a correlation between traditional MT measures and named entity scores: the ability to automate named entity scoring and thus MT scoring; and insights into the linguistic aspects of task-based uses of MT, as captured in previous studies.

null

94,927

inproceedings

vanni-miller-2001-scaling

Scaling the {ISLE} framework: validating tests of machine translation quality for multi-dimensional measurement

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.9/

Vanni, Michelle and Miller, Keith J.

Workshop on MT Evaluation

null

Work on comparing a set of linguistic test scores for MT output to a set of the same tests' scores for naturally-occurring target language text (Jones and Rusk 2000) broke new ground in automating MT Evaluation. However, the tests used were selected on an ad hoc basis. In this paper, we report on work to extend our understanding, through refinement and validation, of suitable linguistic tests in the context of our novel approach to MTE. This approach was introduced in Miller and Vanni (2001a) and employs standard, rather than randomly-chosen, tests of MT output quality selected from the ISLE framework as well as a scoring system for predicting the type of information processing task performable with the output. Since the intent is to automate the scoring system, this work can also be viewed as the preliminary steps of algorithm design.

null

94,928

inproceedings

white-2001-predicting

Predicting intelligibility from fidelity in {MT} evaluation

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.10/

White, John

Workshop on MT Evaluation

null

Attempts to formulate methods of automatically evaluating machine translation (MT) have generally looked at some attrinbute of translation and then tried, explicitly or implicitly, to extrapolate the measurement to cover a broader class of attributes. In particular, some studies have focused on measuring fidelity of translation, and inferring intelligibility from that, and others have taken the opposite approach. In this paper we examine the more fundamental question of whether, and to what extent, the one attribute can be predicted by the other. As a starting point we use the 1994 DARPA MT corpus, which has measures for both attributes, and perform a simple comparison of the behavior of each. Two hypotheses about a predictable inference between fidelity and intelligibility are compared with the comparative behavior across all language pairs and all documents in the corpus.

null

94,929

inproceedings

white-forner-2001-predicting

Predicting {MT} fidelity from noun-compound handling

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.11/

White, John and Forner, Monika

Workshop on MT Evaluation

null

Approaches to the automation of machine translation (MT) evaluation have attempted, or presumed, to connect some rapidly measurable phenomenon with general attributes of the MT output and/or system. In particular, measurements of the fluency of output are often asserted to be predictive of the usefulness of MT output in information-intensive, downstream tasks. The connections between the fluency ({\textquotedblleft}intelligibility{\textquotedblright}) of translation and its informational adequacy ({\textquotedblleft}fidelity{\textquotedblright}) are not actually straightforward. This paper discussed a small experiment in isolating a particular contrastive linguistic phenomena common to both French-English and Spanish-English pairs, and attempts to associate that behavior in machine and human translations with known fidelity properties of those translations. Our results show a definite correlative trend.

null

94,930

inproceedings

yuste-rodrigo-braun-chen-2001-comparative

Comparative evaluation of the linguistic output of {MT} systems for translation and information purposes

Hovy, Eduard and King, Margaret and Manzi, Sandra and Reeder, Florence

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-eval.12/

Yuste-Rodrigo, Elia and Braun-Chen, Francine

Workshop on MT Evaluation

null

This paper describes a Machine Translation (MT) evaluation experiment where emphasis is placed on the quality of output and the extent to which it is geared to different users' needs. Adopting a very specific scenario, that of a multilingual international organisation, a clear distinction is made between two user classes: translators and administrators. Whereas the first group requires MT output to be accurate and of good post-editable quality in order to produce a polished translation, the second group primarily needs informative data for carrying out other, non-linguistic tasks, and therefore uses MT more as an information-gathering and gisting tool. During the experiment, MT output of three different systems is compared in order to establish which MT system best serves the organisation`s multilingual communication and information needs. This is a comparative usability- and adequacy-oriented evaluation in that it attempts to help such organisations decide which system produces the most adequate output for certain well-defined user types. To perform the experiment, criteria relating to both users and MT output are examined with reference to the ISLE taxonomy. The experiment comprises two evaluation phases, the first at sentence level, the second at overall text level. In both phases, evaluators make use of a 1-5 rating scale. Weighted results provide some insight into the systems' usability and adequacy for the purposes described above. As a conclusion, it is suggested that further research should be devoted to the most critical aspect of this exercise, namely defining meaningful and useful criteria for evaluating the post-editability and informativeness of MT output.

null

94,931

inproceedings

mctait-2001-linguistic

Linguistic knowledge and complexity in an {EBMT} system based on translation patterns

Carl, Michael and Way, Andy

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-ebmt.3/

McTait, Kevin

Workshop on Example-Based machine Translation

null

An approach to Example-Based Machine Translation is presented which operates by extracting translation patterns from a bilingual corpus aligned at the level of the sentence. This is carried out using a language-neutral recursive machine-learning algorithm based on the principle of similar distributions of strings. The translation patterns extracted represent generalisations of sentences that are translations of each other and, to some extent, resemble transfer rules but with fewer constraints. The strings and variables, of which translations patterns are composed, are aligned in order to provide a more refined bilingual knowledge source, necessary for the recombination phase. A non-structural approach based on surface forms is error prone and liable to produce translation patterns that are false translations. Such errors are highlighted and solutions are proposed by the addition of external linguistic resources, namely morphological analysis and part-of-speech tagging. The amount of linguistic resources added has consequences for computational complexity and portability.

null

94,935

inproceedings

menezes-richardson-2001-best-first

A best-first alignment algorithm for automatic extraction of transfer mappings from bilingual corpora

Carl, Michael and Way, Andy

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-ebmt.4/

Menezes, Arul and Richardson, Stephen D.

Workshop on Example-Based machine Translation

null

Translation systems that automatically extract transfer mappings (rules or examples) from bilingual corpora have been hampered by the difficulty of achieving accurate alignment and acquiring high quality mappings. We describe an algorithm that uses a best-first strategy and a small alignment grammar to significantly improve the quality of the mappings extracted. For each mapping, frequencies are computed and sufficient context is retained to distinguish competing mappings during translation. Variants of the algorithm are run against a corpus containing 200K sentence pairs and evaluated based on the quality of resulting translations.

null

94,936

inproceedings

schaler-2001-beyond

Beyond translation memories

Carl, Michael and Way, Andy

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-ebmt.5/

Sch{\"aler, Reinhard

Workshop on Example-Based machine Translation

null

One key to the success of EBMT is the removal of the boundaries limiting the potential of translation memories. To bring EBMT to fruition, researchers and developers have to go beyond the self-imposed limitations of what is now traditional, in computing terms almost old fashioned, TM technology. Experiments have shown that the probability of finding exact matches at phrase level is higher than the probability of finding exact matches at the current TM segment level. We outline our implementation of a linguistically enhanced translation memory system (or Phrasal Lexicon) implementing phrasal matching. This system takes advantage of the huge and underused resources available in existing translation memories and develops a traditional TM into a sophisticated example-based machine translation engine which when integrated into a hybrid MT solution can yield significant improvements in translation quality.

null

94,937

inproceedings

somers-2001-ebmt

{EBMT} seen as case-based reasoning

Carl, Michael and Way, Andy

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-ebmt.6/

Somers, Harold

Workshop on Example-Based machine Translation

null

This paper looks at EBMT from the perspective of the Case-based Reasoning (CBR) paradigm. We attempt to describe the task of machine translation (MT) seen as a potential application of CBR, and attempt to describe MT in standard CBR terms. The aim is to see if other applications of CBR can suggest better ways to approach EBMT.

null

94,938

inproceedings

turcato-popowich-2001-example

What is example-based machine translation?

Carl, Michael and Way, Andy

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-ebmt.7/

Turcato, Davide and Popowich, Fred

Workshop on Example-Based machine Translation

null

We maintain that the essential feature that characterizes a Machine Translation approach and sets it apart from other approaches is the kind of knowledge it uses. From this perspective, we argue that Example-Based Machine Translation is sometimes characterized in terms of inessential features. We show that Example-Based Machine Translation, as long as it is linguistically principled, significantly overlaps with other linguistically principled approaches to Machine Translation. We make a proposal for translation knowledge bases that make such an overlap explicit.

null

94,939

inproceedings

balkan-2001-exploiting

Exploiting the {WWW} for {MT} teaching

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.1/

Balkan, Lorna

Workshop on Teaching Machine Translation

null

This paper gives an overview of what resources, including software tools, reference material and course material, are currently available on the web for teaching machine translation, and discusses where to find these resources. It makes some suggestions as to how these resources and access to them can be enhanced in the future.

null

94,941

inproceedings

belam-2001-transferable

Transferable skills in an {MT} course

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.2/

Belam, Judith

Workshop on Teaching Machine Translation

null

The paper describes the process of designing a new MT course for final-year undergraduates. It explains the skills to be acquired as part of the module. The course will include a practical and a theoretical component, and in addition to subject-specific knowledge the course should enable students to gain competence in analysis of language and appreciation of the nature of communication. It is hoped that some of these skills will be transferable from the specific context of MT to wider areas of application. Discrete profiling and evaluation is not envisaged. The paper also defines areas where an MT course can provide opportunities not necessarily offered on conventional translation courses.

null

94,942

inproceedings

clavier-poudat-2001-teaching

Teaching machine translation in non computer science subjects: report of an educational experience within the {U}niversity of {O}rleans

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.4/

Clavier, Viviane and Poudat, C{\'e}line

Workshop on Teaching Machine Translation

null

Machine Translation is increasingly being taught within non scientific subject areas at French universities, which involves instructors solving educational and scientific problems caused by the lack of training of these students in computer science. Most of these students are being taught MT within the framework of language and linguistic courses. As MT instructors in both Departments of Foreign Language and Linguistics at Orl{\'e}ans, we will report on our experience of teaching. Besides setting up the technological environment, we also had to consider the courses from two different angles. First of all, we can state that MT tools enable future users to enhance their skills in Machine-Assisted Translation, and secondly they introduce potential future system designers to computational linguistics issues.

null

94,944

inproceedings

gaspari-2001-teaching

Teaching machine translation to trainee translators: a survey of their knowledge and opinions

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.5/

Gaspari, Federico

Workshop on Teaching Machine Translation

null

This paper reports upon a survey carried out among thirty-eight trainee translators who took courses on machine translation. The survey was conducted asking the sample of students to fill out a questionnaire both at the beginning and at the end of the MT course. The questions aimed at assessing the degree of knowledge about MT of the respondents and the opinions and impressions that they accordingly had on it. The results of the questionnaire were elaborated so as to investigate the relationship between the increase in the knowledge about MT after the conclusion of the course, and the corresponding change in the students' attitude towards the discipline, which became much less biased and in general fairly positive, thanks to a very successful and rewarding learning process. The paper suggests that the more the trainee translators became familiar with MT, realising its reasonable potential and current limitations, the less afraid they were of it. These findings encourage the increasing integration and introduction of technology into translation curricula, since the impact of computer technology on language translation directly affects professional human translators. As a result, exposing trainee translators to machine translation seems to raise the profile of their training.

null

94,945

inproceedings

kenny-way-2001-teaching

Teaching machine translation {\&} translation technology: a contrastive study

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.6/

Kenny, Dorothy and Way, Andy

Workshop on Teaching Machine Translation

null

The Machine Translation course at Dublin City University is taught to undergraduate students in Applied Computational Linguistics, while Computer-Assisted Translation is taught on two translator-training programmes, one undergraduate and one postgraduate. Given the differing backgrounds of these sets of students, the course material, methods of teaching and assessment all differ. We report here on our experiences of teaching these courses over a number of years, which we hope will be of interest to lecturers of similar existing courses, as well as providing a reference point for others who may be considering the introduction of such material.

null

94,946

inproceedings

perez-ortiz-forcada-2001-discovering

Discovering machine translation strategies beyond word-for-word translation: a laboratory assignment

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.7/

P{\'e}rez-Ortiz, Juan Antonio and Forcada, Mikel L.

Workshop on Teaching Machine Translation

null

It is a common mispreconception to say that machine translation programs translate word-for-word, but real systems follow strategies which are much more complex. This paper proposes a laboratory assignment to study the way in which some commercial machine translation programs translate whole sentences and how the translation differs from a word-for-word translation. Students are expected to infer some of these extra strategies by observing the outcome of real systems when translating a set of sentences designed on purpose. The assignment also makes students aware of the difficulty of constructing such programs while bringing some technological light into the apparent {\textquotedblleft}magic{\textquotedblright} of machine translation.

null

94,947

inproceedings

somers-2001-three

Three perspectives on {MT} in the classroom

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.8/

Somers, Harold

Workshop on Teaching Machine Translation

null

This paper considers the role of translation software, especially Machine Translation (MT), in curricula for students of computational linguistics, for trainee translators and for language learners. These three sets of students have differing needs and interests, although there is some overlap between them. A brief historical view of MT in the classroom is given, including comments on the author`s 25 years of experience in the field. This is followed by discussion and examples of strategies for teaching about MT and related aspects of Language Engineering and Information Technology for the three types of student.

null

94,948

inproceedings

yuste-rodrigo-2001-making

Making {MT} commonplace in translation training curricula {\textbullet} too many misconceptions, so much potential!

Forcada, Mikel L. and P{\'e}rez-Ortiz, Juan Antonio

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-teach.9/

Yuste-Rodrigo, Elia

Workshop on Teaching Machine Translation

null

This paper tackles the issue of how to teach Machine Translation (MT) to future translators enrolled in a university translation-training course. Teaching MT to trainee translators usually entails two main difficulties: first, a misunderstanding of what MT is really useful for, which normally leads to the misconception that MT output`s quality always equals zero; second, a widespread fear that machines are to replace human translators, consequently leaving them out of work. In order to fight these generalised prejudices on MT among (future) translators, translation instruction should be primarily practical and realistic, as well as learner-centred. It thus ought to highlight the fact that: 1) MT systems and applications are essential components of today`s global multilingual documentation production; 2) the way in which MT is employed in large multilingual organisations and international companies opens up new work avenues for translators. This will be illustrated by two activities, one using commercial MT systems for quick translations, whose process outcome is improved through the trainees' interaction with the system; the other focusing on MT output comprehensibility by speakers of target language only. MT is thus a mainstream component of a translation-training framework delineated in Yuste (2000) that, by placing the trainee in workplace-like situations, also echoes Kiraly (1999).

null

94,949

inproceedings

boitet-2001-four

Four technical and organizational keys to handle more languages and improve quality (on demand) in {MT}

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.1/

Boitet, Christian

Workshop on MT2010: Towards a Road Map for MT

null

Despite considerable investment over the past 50 years, only a small number of language pairs is covered by MT systems designed for information access, and even fewer are capable of quality translation or speech translation. To open the door toward MT of adequate quality for all languages (at least in principle), we propose four keys. On the technical side, we should (1) dramatically increase the use of learning techniques which have demonstrated their potential at the research level, and (2) use pivot architectures, the most universally usable pivot being UNL. On the organizational side, the keys are (3) the cooperative development of open source linguistic resources on the Web, and (4) the construction of systems where quality can be improved ``on demand'' by users, either a priori through interactive disambiguation, or a posteriori by correcting the pivot representation through any language, thereby unifying MT, computer-aided authoring, and multilingual generation.

null

94,951

inproceedings

farwell-helmreich-2001-towards

Towards pragmatics-based machine translation

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.2/

Farwell, David and Helmreich, Stephen

Workshop on MT2010: Towards a Road Map for MT

null

We propose a program of research which has as its goal establishing a framework and methodology for investigating the pragmatic aspects of the translation process and implementing a computational platform for carrying out systematic experiments on the pragmatics of translation. The program has four components. First, on the basis of a comparative study of multiple translations of the same document into a single target language, a pragmatics-based computational model is to be developed in which reasoning about the beliefs of the participants in the translation task and about the content of a text are central. Second, existing Natural Language Processing technologies are to be appraised as potential components of a computational platform that supports investigations into the effects of pragmatics on translation. Third, the platform is to be assembled and prototype translation systems implemented which conform to the pragmatics-based computational model of translation. Finally, a novel evaluation methodology is to be developed and evaluations of the systems carried out.

null

94,952

inproceedings

flournoy-callison-burch-2001-secondary

Secondary benefits of feedback and user interaction in machine translation tools

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.3/

Flournoy, Raymond S. and Callison-Burch, Chris

Workshop on MT2010: Towards a Road Map for MT

null

User feedback has often been proposed as a method for improving the accuracy of machine translation systems, but useful feedback can also serve a number of secondary benefits, including increasing user confidence in the MT technology and expanding the potential audience of users. Amikai, Inc. has produced a number of communication tools which embed translation technology and which attempt to improve the user experience by maximizing useful user interaction and feedback. As MT continues to develop, further attention needs to be paid to developing the overall user experience, which can improve the utility of translation tools even when translation quality itself plateaus.

null

94,953

inproceedings

macklovitch-valderrabanos-2001-rethinking

Rethinking interaction: the solution for high-quality {MT}?

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.5/

Macklovitch, Elliott and Valderr{\'a}banos, Antonio S.

Workshop on MT2010: Towards a Road Map for MT

null

Our focus is on high-quality (HQ) translation, the worldwide demand for which continues to increase exponentially and now far exceeds the capacity of the translation profession to satisfy it. To what extent is MT currently being used to satisfy this growing demand for HQ translation? Quite obviously, very little. Although MT is being used today by more people than ever before, very few of these users are professional translators. This represents a major change, for a mere ten years ago, translators were still the principal target market for most MT vendors. What happened to bring about this change? For that matter, what happened to most of those MT vendors? The view we present is that the most promising strategy for HQ MT is to embed MT systems in translation environments where the translator retains full control over their output. In our opinion, this new type of interactive MT will achieve better acceptance levels among translators and significantly improve the prospects of MT`s commercial success in the translation industry.

null

94,955

inproceedings

och-ney-2001-machine

What can machine translation learn from speech recognition?

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.6/

Och, Franz Josef and Ney, Hermann

Workshop on MT2010: Towards a Road Map for MT

null

The performance of machine translation technology after 50 years of development leaves much to be desired. There is a high demand for well performing and cheap MT systems for many language pairs and domains, which automatically adapt to rapidly changing terminology. We argue that for successful MT systems it will be crucial to apply data-driven methods, especially statistical machine translation. In addition, it will be very important to establish common test environments. This includes the availability of large parallel training corpora, well defined test corpora and standardized evaluation criteria. Thereby research results can be compared and this will open the possibility for more competition in MT research.

null

94,956

inproceedings

probst-etal-2001-design

Design and implementation of controlled elicitation for machine translation of low-density languages

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.7/

Probst, Katharina and Brown, Ralf and Carbonell, Jaime and Lavie, Alon and Levin, Lori and Peterson, Erik

Workshop on MT2010: Towards a Road Map for MT

null

NICE is a machine translation project for low-density languages. We are building a tool that will elicit a controlled corpus from a bilingual speaker who is not an expert in linguistics. The corpus is intended to cover major typological phenomena, as it is designed to work for any language. Using implicational universals, we strive to minimize the number of sentences that each informant has to translate. From the elicited sentences, we learn transfer rules with a version space algorithm. Our vision for MT in the future is one in which systems can be quickly trained for new languages by native speakers, so that speakers of minor languages can participate in education, health care, government, and internet without having to give up their languages.

null

94,957

inproceedings

schutz-2001-blueprints

Blueprints for {MT} evolution: reflections on elements of style

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.8/

Sch{\"utz, J{\"org

Workshop on MT2010: Towards a Road Map for MT

null

In this paper, organized in essay style, I first assess the situation of Machine Translation, which is characterized, on the one hand, by unsatisfied user expectations, and, on the other hand, by an ever increasing need for translation technology to fulfil the promises of the global knowledge society, which is promoted by almost all governments and industries worldwide. The assessment is followed by an outline of the design of a blueprint that describes possible steps of an MT evolution regarding short term, mid term and long term developments. Although some user communities might aim at an MT revolution, the evolutionary implementation of the different aspects of the blueprint fit seamless with the foundation that we are faced with in the assessment part. With the blueprint the thesis of this MT evolution essay is established, and the stage is opened for the antithesis in which I develop the points for an MT revolution. Finally, in the synthesis part I develop a combined view which then completes the discussion and the establishment of a blueprint for MT evolution.

null

94,958

inproceedings

tsou-kwong-2001-evaluating

Evaluating {C}hinese-{E}nglish translation systems for personal name coverage

Krauwer, Steven

sep # " 18-22"

2001

Santiago de Compostela, Spain

null

https://aclanthology.org/2001.mtsummit-road.9/

Tsou, Benjamin K. and Kwong, Oi Yee

Workshop on MT2010: Towards a Road Map for MT

null

This paper discusses the challenges which Chinese-English machine translation (MT) systems face in translating personal names. We show that the translation of names between Chinese and English is complicated by different factors, including orthographic, phonetic, geographic and social ones. Four existing systems were tested for their capability in translating personal names from Chinese to English. Test data embodying geographic and sociolinguistic differences were obtained from a synchronous Chinese corpus of news media texts. It is obvious that systems vary considerably in their ability to identify personal names in the source language and render them properly in the target language. Given the criticality of personal name translation to the overall intelligibility of a translated text, the coverage of personal names should be one of the important criteria in the evaluation of MT performance. Moreover, name translation, which calls for a hybrid approach, would remain a central issue to the future development of MT systems, especially for online and real-time applications.

null

94,959

inproceedings

mohri-2001-language

Language Processing with Weighted Transducers

Maurel, Denis

jul

2001

Tours, France

ATALA

https://aclanthology.org/2001.jeptalnrecital-invite.1/

Mohri, Mehryar

Actes de la 8{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Conf{\'e}rences invit{\'e}es

5--14

Weighted automata and transducers are used in a variety of applications ranging from automatic speech recognition and synthesis to computational biology. They give a unifying framework for the representation of the components of complex systems. This provides opportunities for the application of general optimization algorithms such as determinization, epsilon-removal and minimization of weighted transducers. We give a brief survey of recent advances in language processing with weighted automata and transducers, including an overview of speech recognition with weighted transducers and recent algorithmic results in that field. We also present new results related to the approximation of weighted context-free grammars and language recognition with weighted automata.

null

94,961

inproceedings

chuah-2001-aggregation

Aggregation by Conflation of Quasi-Synonymous Units in Author Abstracting

Maurel, Denis

jul

2001

Tours, France

ATALA

https://aclanthology.org/2001.jeptalnrecital-long.12/

Chuah, Choy-Kim

Actes de la 8{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Articles longs

142--151

In text generation, studies on aggregation often focus on the use of connectives to combine short made-up sentences. But connectives restrict the number of units that may be combined at any one time. So, how does information get condensed into fewer units without excessive use of connectives? From a comparison of document and abstract, this reconnaissance study reports on some preferred patterns in aggregation when authors write abstracts for journal articles on biology. The paper also discusses some prerequisites and difficulties anticipated for abstracting systems. More sentences were aggregated without than with the use of an explicit sign, such as a connective or a (semi-)colon.

null

94,975

inproceedings

todirascu-rousselot-2001-ontologies

Ontologies for Information Retrieval

Maurel, Denis

jul

2001

Tours, France

ATALA

https://aclanthology.org/2001.jeptalnrecital-long.28/

Todira{\c{s}}cu, Amalia and Rousselot, Fran{\c{c}}ois

Actes de la 8{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Articles longs

303--312

The paper presents a system for querying (in natural language) a set of text documents from a limited domain. The domain knowledge, represented in description logics (DL), is used for filtering the documents returned as answer and it is extended dynamically (when new concepts are identified in the texts), as result of DL inference mechanisms. The conceptual hierarchy is built semi-automatically from the texts. Concept instances are identified using shallow natural language parsing techniques.

null

94,991

inproceedings

vazov-2001-system-extraction

A System for Extraction of Temporal Expressions from {F}rench Texts

Maurel, Denis

jul

2001

Tours, France

ATALA

https://aclanthology.org/2001.jeptalnrecital-long.29/

Vazov, Nikolai

Actes de la 8{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Articles longs

313--322

We present a system for extraction of temporal expressions from French texts. The identification of the temporal expressions is based on a context-scanning strategy (CSS) which is carried out by two complementary techniques: search for regular expressios and left-to-right and right-to-left local chartparsing. A number of semantic and distant-dependency constraints have been integrated to the chartparsing procedure in order to improve the precision of the system.

null

94,992

inproceedings

chuah-2001-just

Just What May be Deleted or Compressed in Abstracting?

Maurel, Denis

jul

2001

Tours, France

ATALA

https://aclanthology.org/2001.jeptalnrecital-poster.3/

Chuah, Choy-Kim

Actes de la 8{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Posters

337--342

Abstracts constituted from extracted sentences contain unneeded information that may be deleted, or compressed into simpler units. By comparing full text sentences used in abstracting with correspond-ing sentences in abstract, the study found such units to include metadiscourse phrases, parenthetical texts, redundant units inserted for emphasis, or are repetitions. Apposed texts and units such as modifiers and relative clauses which provide details and precision in the full text, but are out of place in an abstract, are also deleted.

null

94,996

inproceedings

sidorov-gelbukh-2001-word

Word Sense Disambiguation in a {S}panish Explanatory Dictionary

Maurel, Denis

jul

2001

Tours, France

ATALA

https://aclanthology.org/2001.jeptalnrecital-poster.12/

Sidorov, Grigori and Gelbukh, Alexander

Actes de la 8{\`e}me conf{\'e}rence sur le Traitement Automatique des Langues Naturelles. Posters

393--398

We apply word sense disambiguation to the definitions in a Spanish explanatory dictionary. To calculate the scores of word senses basing on the context (which in our case is the dictionary definition), we use a modification of Lesk`s algorithm. The algorithm relies on a comparison between two words. In the original Lesk`s algorithm, the comparison is trivial: two words are either the same lexeme or not; our modification consists in fuzzy (weighted) comparison using a large synonym dictionary and a simple derivational morphology system. Application of disambiguation to dictionary definitions (in contrast to usual texts) allows for some simplifications of the algorithm, e.g., we do not have to care of context window size.

null

95,005

inproceedings

brill-etal-2000-automatic

Automatic Grammar Induction: Combining, Reducing and Doing Nothing

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.2/

Brill, Eric and Henderson, John C. and Ngai, Grace

Proceedings of the Sixth International Workshop on Parsing Technologies

1--5

This paper surveys three research directions in parsing. First, we look at methods for both automatically generating a set of diverse parsers and combining the outputs of different parsers into a single parse. Next, we will discuss a parsing method known as transformation-based parsing. This method, though less accurate than the best current corpus-derived parsers, is able to parse quite accurately while learning only a small set of easily understood rules, as opposed to the many-megabyte parameter files learned by other techniques. Finally, we review a recent study exploring how people and machines compare at the task of creating a program to automatically annotate noun phrases.

null

96,133

inproceedings

kay-2000-guides

Guides and Oracles for Linear-Time Parsing

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.3/

Kay, Martin

Proceedings of the Sixth International Workshop on Parsing Technologies

6--10

If chart parsing is taken to include the process of reading out solutions one by one, then it has exponential complexity. The stratagem of separating read-out from chart construction can also be applied to other kinds of parser, in particular, to left-comer parsers that use early composition. When a limit is placed on the size of the stack in such a parser, it becomes context-free equivalent. However, it is not practical to profit directly from this observation because of the large state sets that are involved in otherwise ordinary situations. It may be possible to overcome these problems by means of a guide constructed from a weakened version of the initial grammar.

null

96,134

inproceedings

aldezabal-etal-2000-bootstrapping

A Bootstrapping Approach to Parser Development

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.5/

Aldezabal, Izaskun and Gojenola, Koldo and Sarasola, Kepa

Proceedings of the Sixth International Workshop on Parsing Technologies

17--28

This paper presents a robust parsing system for unrestricted Basque texts. It analyzes a sentence in two stages: a unification-based parser builds basic syntactic units such as NPs, PPs, and sentential complements, while a finite-state parser performs syntactic disambiguation and filtering of the results. The system has been applied to the acquisition of verbal subcategorization information, obtaining 66{\%} recall and 87{\%} precision in the determination of verb subcategorization instances. This information will be later incorporated to the parser, in order to improve its performance.

null

96,136

inproceedings

alonso-etal-2000-new

New Tabular Algorithms for Parsing

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.6/

Alonso, Miguel A. and Gra{\~n}a, Jorge and Vilares, Manuel and de la Clergerie, Eric

Proceedings of the Sixth International Workshop on Parsing Technologies

29--40

We develop a set of new tabular parsing algorithms for Linear Indexed Grammars, including bottom-up algorithms and Earley-like algorithms with and without the valid prefix property, creating a continuum in which one algorithm can in turn be derived from another. The output of these algorithms is a shared forest in the form of a context-free grammar that encodes all possible derivations for a given input string.

null

96,137

inproceedings

basili-etal-2000-customizable

Customizable Modular Lexicalized Parsing

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.7/

Basili, R. and Pazienza, M. T. and Zanzotto, F. M.

Proceedings of the Sixth International Workshop on Parsing Technologies

41--52

Different NLP applications have different efficiency constraints (i.e. quality of the results and throughput) that reflect on each core linguistic component. Syntactic processors are basic modules in some NLP application. A customization that permits the performance control of these components enables their reuse in different application scenarios. Throughput has been commonly improved using partial syntactic processors. On the other hand, specialized lexicons are generally employed to improve the quality of the syntactic material produced by specific parsing (sub)process (e.g. verb argument detection or PP attachment disambiguation) . Building upon the idea of grammar stratification, in this paper a method to push modularity and lexical sensitivity, in parsing, in view of customizable syntactic analysers is presented. A framework for modular parser design is proposed and its main properties are discussed. Parsers (i.e. different parsing module chains) are then presented and their performances are analyzed in an application-driven scenarios.

null

96,138

inproceedings

boullier-2000-range

Range Concatenation Grammars

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.8/

Boullier, Pierre

Proceedings of the Sixth International Workshop on Parsing Technologies

53--64

In this paper we present Range Concatenation Grammars, a syntactic formalism which possesses many attractive features among which we underline here, power and closure properties. For example, Range Concatenation Grammars are more powerful than Linear Context-Free Rewriting Systems though this power is not reached to the detriment of efficiency since its sentences can always be parsed in polynomial time. Range Concatenation Languages are closed both under intersection and complementation and these closure properties may allow to consider novel ways to describe some linguistic processings. We also present a parsing algorithm which is the basis of our current prototype implementation.

null

96,139

inproceedings

chen-vijay-shanker-2000-automated

Automated Extraction of {TAG}s from the {Penn} {Treebank}

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.9/

Chen, John and Vijay-Shanker, K.

Proceedings of the Sixth International Workshop on Parsing Technologies

65--76

The accuracy of statistical parsing models can be improved with the use of lexical information. Statistical parsing using Lexicalized tree adjoining grammar (LTAG), a kind of lexicalized grammar, has remained relatively unexplored. We believe that is largely in part due to the absence of large corpora accurately bracketed in terms of a perspicuous yet broad coverage LTAG. Our work attempts to alleviate this difficulty. We extract different LTAGs from the Penn Treebank. We show that certain strategies yield an improved extracted LTAG in terms of compactness, broad coverage, and supertagging accuracy. Furthermore, we perform a preliminary investigation in smoothing these grammars by means of an external linguistic resource, namely, the tree families of an XTAG grammar, a hand built grammar of English.

null

96,140

inproceedings

fang-2000-cases

From Cases to Rules and Vice Versa: Robust Practical Parsing With Analogy

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.10/

Fang, Alex Chengyu

Proceedings of the Sixth International Workshop on Parsing Technologies

77--88

This article describes the architecture of the Survey Parser and discusses two major components related to the analogy-based parsing of unrestricted English. Firstly, it discusses the automatic generation of a large declarative formal grammar from a corpus that has been syntactically analysed. Secondly, it describes analogy-based parsing that employs both the automatically learned rules and the database of cases to determine the syntactic structure of the input string. Statistics are presented to characterise the performance of the parsing system.

null

96,141

inproceedings

foth-etal-2000-transformation

A Transformation-based Parsing Technique With Anytime Properties

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.11/

Foth, Kilian and Schr{\"oder, Ingo and Menzel, Wolfgang

Proceedings of the Sixth International Workshop on Parsing Technologies

89--100

A transformation-based approach to robust parsing is presented, which achieves a strictly monotonic improvement of its current best hypothesis by repeatedly applying local repair steps to a complex multi-level representation. The transformation process is guided by scores derived from weighted constraints. Besides being interruptible, the procedure exhibits a performance profile typical for anytime procedures and holds great promise for the implementation of time-adaptive behaviour.

null

96,142

inproceedings

gavalda-2000-soup

{SOUP}: A Parser for Real-world Spontaneous Speech

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.12/

Gavald{\`a}, Marsal

Proceedings of the Sixth International Workshop on Parsing Technologies

101--110

This paper describes the key features of SOUP, a stochastic, chart-based, top-down parser, especially engineered for real-time analysis of spoken language with very large, multi-domain semantic grammars. SOUP achieves flexibility by encoding context-free grammars, specified for example in the Java Speech Grammar Format, as probabilistic recursive transition networks, and robustness by allowing skipping of input words at any position and producing ranked interpretations that may consist of multiple parse trees. Moreover, SOUP is very efficient, which allows for practically instantaneous backend response.

null

96,143

inproceedings

harkema-2000-recognizer

A Recognizer for {M}inimalist {G}rammars

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.13/

Harkema, Henk

Proceedings of the Sixth International Workshop on Parsing Technologies

111--122

Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky`s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity.

null

96,144

inproceedings

henderson-2000-neural

A Neural Network Parser that Handles Sparse Data

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.14/

Henderson, James

Proceedings of the Sixth International Workshop on Parsing Technologies

123--134

Previous work has demonstrated the viability of a particular neural network architecture, Simple Synchrony Networks, for syntactic parsing. Here we present additional results on the performance of this type of parser, including direct comparisons on the same dataset with a standard statistical parsing method, Probabilistic Context Free Grammars. We focus these experiments on demonstrating one of the main advantages of the SSN parser over the PCFG, handling sparse data. We use smaller datasets than are typically used with statistical methods, resulting in the PCFG finding parses for under half of the test sentences, while the SSN finds parses for all sentences. Even on the PCFG {\textquoteleft}s parsed half, the SSN performs better than the PCFG, as measure by recall and precision on both constituents and a dependency-like measure.

null

96,145

inproceedings

kiefer-krieger-2000-context

A Context-free Approximation of {H}ead-driven {P}hrase {S}tructure {G}rammar

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.15/

Kiefer, Bernd and Krieger, Hans-Ulrich

Proceedings of the Sixth International Workshop on Parsing Technologies

135--146

We present a context-free approximation of unification-based grammars, such as HPSG or PATR-II. The theoretical underpinning is established through a least fixpoint construction over a certain monotonic function. In order to reach a finite fixpoint, the concrete implementation can be parameterized in several ways , either by specifying a finite iteration depth, by using different restrictors, or by making the symbols of the CFG more complex adding annotations a la GPSG. We also present several methods that speed up the approximation process and help to limit the size of the resulting CF grammar.

null

96,146

inproceedings

lavie-rose-2000-optimal

Optimal Ambiguity Packing in Context-free Parsers with Interleaved Unification

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.16/

Lavie, Alon and Ros{\'e}, Carolyn Penstein

Proceedings of the Sixth International Workshop on Parsing Technologies

147--158

Ambiguity packing is a well known technique for enhancing the efficiency of context-free parsers. However, in the case of unification-augmented context-free parsers where parsing is interleaved with feature unification, the propagation of feature structures imposes difficulties on the ability of the parser to effectively perform ambiguity packing. We demonstrate that a clever heuristic for prioritizing the execution order of grammar rules and parsing actions can achieve a high level of ambiguity packing that is provably optimal. We present empirical evaluations of the proposed technique, performed with both a Generalized LR parser and a chart parser, that demonstrate its effectiveness.

null

96,147

inproceedings

lopez-2000-extended

Extended Partial Parsing for Lexicalized Tree Grammars

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.17/

Lopez, Patrice

Proceedings of the Sixth International Workshop on Parsing Technologies

159--170

Existing parsing algorithms for Lexicalized Tree Grammars (LTG) formalisms (LTAG, TIG, DTG, ... ) are adaptations of algorithms initially dedicated to Context Free Grammars (CFG). They do not really take into account the fact that we do not use context free rules but partial parsing trees that we try to combine. Moreover the lexicalization raises up the important problem of multiplication of structures, a problem which does not exist in CFG. This paper presents parsing techniques for LTG taking into account these two fundamental features. Our approach focuses on robust and pratical purposes. Our parsing algorithm results in more extended partial parsing when the global parsing fails and in an interesting average complexity compared with others bottom-up algorithms.

null

96,148

inproceedings

moore-2000-improved

Improved Left-corner Chart Parsing for Large Context-free Grammars

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.18/

Moore, Robert C.

Proceedings of the Sixth International Workshop on Parsing Technologies

171--182

We develop an improved form of left-corner chart parsing for large context-free grammars, introducing improvements that result in significant speed-ups more compared to previously-known variants of left corner parsing. We also compare our method to several other major parsing approaches, and find that our improved left-corner parsing method outperforms each of these across a range of grammars. Finally, we also describe a new technique for minimizing the extra information needed to efficiently recover parses from the data structures built in the course of parsing.

null

96,149

inproceedings

oepen-callmeier-2000-measure

Measure for Measure: Parser Cross-fertilization - Towards Increased Component Comparability and Exchange

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.19/

Oepen, Stephan and Callmeier, Ulrich

Proceedings of the Sixth International Workshop on Parsing Technologies

183--194

Over the past few years significant progress was accomplished in efficient processing with wide-coverage HPSG grammars. HPSG-based parsing systems are now available that can process medium-complexity sentences (of ten to twenty words, say) in average parse times equivalent to real (i.e. human reading) time. A large number of engineering improvements in current HPSG systems were achieved through collaboration of multiple research centers and mutual exchange of experience, encoding techniques, algorithms, and even pieces of software. This article presents an approach to grammar and system engineering, termed competence {\&} performance profiling, that makes systematic experimentation and the precise empirical study of system properties a focal point in development. Adapting the profiling metaphor familiar from software engineering to constraint-based grammars and parsers, enables developers to maintain an accurate record of system evolution, identify grammar and system deficiencies quickly, and compare to earlier versions or between different systems. We discuss a number of exemplary problems that motivate the experimental approach, and apply the empirical methodology in a fairly detailed discussion of what was achieved during a development period of three years. Given the collaborative nature in setup, the empirical results we present involve research and achievements of a large group of people.

null

96,150

inproceedings

plaehn-2000-computing

Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.20/

Plaehn, Oliver

Proceedings of the Sixth International Workshop on Parsing Technologies

195--206

This paper presents a probabilistic extension of Discontinuous Phrase Structure Grammar (DPSG), a formalism designed to describe discontinuous constituency phenomena adequately and perspicuously by means of trees with crossing branches. We outline an implementation of an agenda-based chart parsing algorithm that is capable of computing the Most Probable Parse for a given input sentence for probabilistic versions of both DPSG and Context-Free Grammar. Experiments were conducted with both types of grammars extracted from the NEGRA corpus. In spite of the much greater complexity of DPSG parsing in terms of the number of (partial) analyses that can be constructed for an input sentence, accuracy results from both experiments are comparable. We also briefly hint at future lines of research aimed at more efficient ways of probabilistic parsing with discontinuous constituents.

null

96,151

inproceedings

prolo-2000-efficient

An Efficient {LR} Parser Generator for {T}ree {A}djoining {G}rammars

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.21/

Prolo, Carlos A.

Proceedings of the Sixth International Workshop on Parsing Technologies

207--218

The first published LR algorithm for Tree Adjoining Grammars (TAGs [Joshi and Schabes, 1996]) was due to Schabes and Vijay-Shanker [1990] . Nederhof [1998] showed that it was incorrect (after [Kinyon, 1997]), and proposed a new one. Experimenting with his new algorithm over the XTAG English Grammar [XTAG Research Group, 1998] he concluded that LR parsing was inadequate for use with reasonably sized grammars because the size of the generated table was unmanageable. Also the degree of conflicts is too high. In this paper we discuss issues involved with LR parsing for TAGs and propose a new version of the algorithm that, by maintaining the degree of prediction while deferring the {\textquotedblleft}subtree reduction{\textquotedblright}, dramatically reduces both the average number of conflicts per state and the size of the parser.

null

96,152

inproceedings

rezaei-2000-parsing

Parsing Scrambling with Path Set: a Graded Grammaticality Approach

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.22/

Rezaei, Siamak

Proceedings of the Sixth International Workshop on Parsing Technologies

219--230

In this work we introduce the notion of path set for parsing free word order languages. The parsing system uses this notion to parse examples of sentences with scrambling. We show that by using path set, the performance constraints on scrambling such as Resource Limitation Principle (RLP) can be represented easily. Our work contrasts with models based on the notion of immediate dominance rule and binary precedence relations. In our work the precedence relations and word order constraints are defined locally for each clause. Our binary precedence relations are examples of fuzzy relations with weights attached to them. As a result, the word order principles in our approach can be violated and each violation contributes to a lowering of the overall acceptability and grammaticality. The work suggests a robust principle-based approach to parsing ambiguous sentences in verb final languages.

null

96,153

inproceedings

sawaf-etal-2000-use

On the Use of Grammar Based Language Models for Statistical Machine Translation

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.23/

Sawaf, Hassan and Sch{\"utz, Kai and Ney, Hermann

Proceedings of the Sixth International Workshop on Parsing Technologies

231--241

In this paper, we describe some concepts of language models beyond the usually used standard trigram and use such language models for statistical machine translation. In statistical machine translation the language model is the a-priori knowledge source of the system about the target language. One important requirement for the language model is the correct word order, given a certain choice of words, and to score the translations generated by the translation model $\textrm{Pr}(f_1^J/e^I_1)$, in view of the syntactic context. In addition to standard $m$-grams with long histories, we examine the use of Part-of-Speech based models as well as linguistically motivated grammars with stochastic parsing as a special type of language model. Translation results are given on the VERBMOBIL task, where translation is performed from German to English, with vocabulary sizes of 6500 and 4000 words, respectively.

null

96,154

inproceedings

schneider-2000-algebraic

Algebraic Construction of Parsing Schemata

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.24/

Schneider, Karl-Michael

Proceedings of the Sixth International Workshop on Parsing Technologies

242--253

We propose an algebraic method for the design of tabular parsing algorithms which uses parsing schemata [7]. The parsing strategy is expressed in a tree algebra. A parsing schema is derived from the tree algebra by means of algebraic operations such as homomorphic images, direct products, subalgebras and quotient algebras. The latter yields a tabular interpretation of the parsing strategy. The proposed method allows simpler and more elegant correctness proofs by using general theorems and is not limited to left-right parsing strategies, unlike current automaton-based approaches. Furthermore, it allows to derive parsing schemata for linear indexed grammars (LIG) from parsing schemata for context-free grammars by means of a correctness preserving algebraic transformation. A new bottom-up head corner parsing schema for LIG is constructed to demonstrate the method.

null

96,155

inproceedings

trivino-morales-bueno-2000-spanish

A {S}panish {POS} Tagger with Variable Memory

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.25/

Trivi{\~n}o, Jos{\'e} and Morales-Bueno, Rafael

Proceedings of the Sixth International Workshop on Parsing Technologies

254--265

An implementation of a Spanish POS tagger is described in this paper. This implementation combines three basic approaches: a single word tagger based on decision trees, a POS tagger based on variable memory Markov models, and a feature structures set of tags. Using decision trees for single word tagging allows the tagger to work without a lexicon that lists only possible tags. Moreover, it decreases the error rate because there are no unknown words. The feature structure set of tags is advantageous when the available training corpus is small and the tag set large, which can be the case with morphologically rich languages like Spanish. Finally, variable memory Markov models training is more efficient than traditional full-order Markov models and achieves better accuracy. In this implementation, 98.58{\%} of tokens are correctly classified.

null

96,156

inproceedings

weng-etal-2000-parsing

Parsing a Lattice with Multiple Grammars

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.26/

Weng, Fuliang and Meng, Helen and Luk, Po Chui

Proceedings of the Sixth International Workshop on Parsing Technologies

266--277

Efficiency, memory, ambiguity, robustness and scalability are the central issues in natural language parsing. Because of the complexity of natural language, different parsers may be suited only to certain subgrammars. In addition, grammar maintenance and updating may have adverse effects on tuned parsers. Motivated by these concerns, [25] proposed a grammar partitioning and top-down parser composition mechanism for loosely restricted Context-Free Grammars (CFGs). In this paper, we report on significant progress, i.e., (1) developing guidelines for the grammar partition through a set of heuristics, (2) devising a new mix-strategy composition algorithms for any rule-based grammar partition in a lattice framework, and 3) initial but encouraging parsing results for Chinese and English queries from an Air Travel Information System (ATIS) corpus.

null

96,157

inproceedings

zajac-amtrup-2000-modular

Modular Unification-based Parsers

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.27/

Zajac, R{\'e}mi and Amtrup, Jan

Proceedings of the Sixth International Workshop on Parsing Technologies

278--290

We present an implementation of the notion of modularity and composition applied to unification based grammars. Monolithic unification grammars can be decomposed into sub-grammars with well defined interfaces. Sub-grammars are applied in a sequential manner at runtime, allowing incremental development and testing of large coverage grammars. The modular approach to grammar development leads us away from the traditional view of parsing a string of input symbols as the recognition of some start symbol, and towards a richer and more flexible view where inputs and outputs share the same structural properties.

null

96,158

inproceedings

becker-heckmann-2000-parsing

Parsing Mildly Context-sensitive {RMS}

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.29/

Becker, Tilman and Heckmann, Dominik

Proceedings of the Sixth International Workshop on Parsing Technologies

293--294

We introduce Recursive Matrix Systems (RMS) which encompass mildly context-sensitive formalisms and present efficient parsing algorithms for linear and context-free variants of RMS. The time complexities are $\mathcal{O}(n^{2h + 1})$, and $\mathcal{O}(n^{3h})$ respectively, where $h$ is the height of the matrix. It is possible to represent Tree Adjoining Grammars (TAG [1], MC-TAG [2], and R-TAG [3]) as RMS uniformly.

null

96,160

inproceedings

elworthy-2000-finite

A Finite-state Parser with Dependency Structure Output

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.33/

Elworthy, David

Proceedings of the Sixth International Workshop on Parsing Technologies

301--302

We show how to augment a finite-state grammar with annotations which allow dependency structures to be extracted. There are some difficulties in determinising the grammar, which is an essential step for computational efficiency, but they can be overcome. The parser also allows syntactically ambiguous structures to be packed into a single representation.

null

96,164

inproceedings

horspool-aycock-2000-analysis

Analysis of Equation Structure using Least Cost Parsing

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.36/

Horspool, R. Nigel and Aycock, John

Proceedings of the Sixth International Workshop on Parsing Technologies

307--308

Mathematical equations in LaTeX are composed with tags that express formatting as opposed to structure. For conversion from LaTeX to other word-processing systems, the structure of each equation must be inferred. We show how a form of least cost parsing used with a very general and ambiguous grammar may be used to select an appropriate structure for a LaTeX equation. MathML provides another application for the same technology; it has two alternative tagging schemes - presentation tags to specify formatting and content tags to specify structure. While conversion from content tagging to presentation tagging is straightforward, the converse is not. Our implementation of least cost parsing is based on Earley`s algorithm.

null

96,167

inproceedings

manousopoulou-etal-2000-partial

Partial Parsing with Grammatical Features

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.38/

Manousopoulou, Natasa and Papakonstantinou, George and Tsanakas, Panayotis

Proceedings of the Sixth International Workshop on Parsing Technologies

311--312

This paper describes a rule based method for partial parsing, particularly for noun phrase recognition, which has been used in the development of a noun phrase recognizer for Modern Greek. This technique is based on a cascade of finite state machines, adding to them a characteristic very crucial in the parsing of words with free word order: the simultaneous examination of part of speech and grammatical feature information, which are deemed equally important during the parsing procedure, in contrast with other methodologies.

null

96,169

inproceedings

placeway-2000-tree

Tree-structured Chart Parsing

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.41/

Placeway, Paul W.

Proceedings of the Sixth International Workshop on Parsing Technologies

317--318

We investigate a method of improving the memory efficiency of a chart parser. Specifically, we propose a technique to reduce the number of active arcs created in the process of parsing. We sketch the differences in the chart algorithm, and provide empirical results that demonstrate the effectiveness of this technique.

null

96,172

inproceedings

uchimoto-etal-2000-dependency

Dependency Model using Posterior Context

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.43/

Uchimoto, Kiyotaka and Murata, Masaki and Sekine, Satoshi and Isahara, Hitoshi

Proceedings of the Sixth International Workshop on Parsing Technologies

321--322

We describe a new model for dependency structure analysis. This model learns the relationship between two phrasal units called bunsetsus as three categories; {\textquoteleft}between', {\textquoteleft}dependent', and {\textquoteleft}beyond', and estimates the dependency likelihood by considering not only the relationship between two bunsetsus but also the relationship between the left bunsetsu and all of the bunsetsus to its right. We implemented this model based on the maximum entropy model. When using the Kyoto University corpus, the dependency accuracy of our model was 88{\%}, which is about 1{\%} higher than that of the conventional model using exactly the same features.

null

96,174

inproceedings

vilares-etal-2000-editing

The Editing Distance in Shared Forest

Lavelli, Alberto and Carroll, John and Berwick, Robert C. and Bunt, Harry C. and Carpenter, Bob and Carroll, John and Church, Ken and Johnson, Mark and Joshi, Aravind and Kaplan, Ronald and Kay, Martin and Lang, Bernard and Lavie, Alon and Nijholt, Anton and Samuelsson, Christer and Steedman, Mark and Stock, Oliviero and Tanaka, Hozumi and Tomita, Masaru and Uszkoreit, Hans and Vijay-Shanker, K. and Weir, David and Wiren, Mats

feb # " 23-25"

2000

Trento, Italy

Association for Computational Linguistics

https://aclanthology.org/2000.iwpt-1.44/

Vilares, Manuel and Cabrero, David and Ribadas, Francisco J.

Proceedings of the Sixth International Workshop on Parsing Technologies

323--324

In an information system indexing can be accomplished by creating a citation based on context-free parses, and matching becomes a natural mechanism to extract patterns. However, the language intended to represent the document can often only be approximately defined, and indices can become shared forests. Queries could also vary from indices and an approximate matching strategy becomes also necessary. We present a proposal intended to prove the applicability of tabulation techniques in this context.

null

96,175

inproceedings

dorr-etal-2000-building

Building a {C}hinese-{E}nglish mapping between verb concepts for multilingual applications

White, John S.

oct # " 10-14"

2000

Cuernavaca, Mexico

Springer

https://aclanthology.org/2000.amta-papers.1/

Dorr, Bonnie J. and Levow, Gina-Anne and Lin, Dekang

Proceedings of the Fourth Conference of the Association for Machine Translation in the Americas: Technical Papers

1--12

This paper addresses the problem of building conceptual resources for multilingual applications. We describe new techniques for large-scale construction of a Chinese-English lexicon for verbs, using thematic-role information to create links between Chinese and English conceptual information. We then present an approach to compensating for gaps in the existing resources. The resulting lexicon is used for multilingual applications such as machine translation and cross-language information retrieval.

null

96,221

inproceedings

fujii-ishikawa-2000-applying

Applying machine translation to two-stage cross-language information retrieval

White, John S.

oct # " 10-14"

2000

Cuernavaca, Mexico

Springer

https://aclanthology.org/2000.amta-papers.2/

Fujii, Atsushi and Ishikawa, Tetsuya

Proceedings of the Fourth Conference of the Association for Machine Translation in the Americas: Technical Papers

13--24

Cross-language information retrieval (CLIR), where queries and documents are in different languages, needs a translation of queries and/or documents, so as to standardize both of them into a common representation. For this purpose, the use of machine translation is an effective approach. However, computational cost is prohibitive in translating large-scale document collections. To resolve this problem, we propose a two-stage CLIR method. First, we translate a given query into the document language, and retrieve a limited number of foreign documents. Second, we machine translate only those documents into the user language, and re-rank them based on the translation result. We also show the effectiveness of our method by way of experiments using Japanese queries and English technical documents.

null

96,222