Presentation is loading. Please wait.

Presentation is loading. Please wait.

An integrated platform for high-accuracy word alignment Dan Tufis, Alexandru Ceausu, Radu Ion, Dan Stefanescu RACAI – Research Institute for Artificial.

Published byReanna Allanson Modified over 9 years ago

Similar presentations

Presentation on theme: "An integrated platform for high-accuracy word alignment Dan Tufis, Alexandru Ceausu, Radu Ion, Dan Stefanescu RACAI – Research Institute for Artificial."— Presentation transcript:

1 An integrated platform for high-accuracy word alignment Dan Tufis, Alexandru Ceausu, Radu Ion, Dan Stefanescu RACAI – Research Institute for Artificial Intelligence, Bucharest

2 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages2 COWAL  The main task of COWAL is to combine the output of two or more comparable word-aligners  In order to achieve this task, COWAL is also an integrated platform with modules for: tokenization, POS- tagging, lemmatization, collocation detection, dependency annotation, chunking and word sense disambiguation.

3 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages3 Word alignment algorithms (YAWA)  YAWA starts with all plausible links (those with ll-score higher than 11)  Then, using a competitive linking strategy, retains the links that maximizes sentence translation equivalence score, and minimizing the number of crossing links  In this way, it generates only 1-1 alignments. N-M alignments are possible only with chunking and/or dependency linking available.

4 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages4 Word alignment algorithms (MEBA)  MEBA iterates several times over each pair of aligned sentences, at each iteration adding only the highest score links.  The links already established in previous iterations give support or create restrictions for the links to be added in a subsequent iteration.  MEBA uses different weights and different significance thresholds on each feature and iteration step.

5 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages5 Features characterizing a link  A link is characterized by a set of features, the values of which are real numbers in the [0,1] interval.  context independent features – CIF, they refer only to the tokens of the current link  context dependent features – CDF, they refer to the properties of the current link with respect to the rest of links in a bi-text

6 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages6 Context independent features  Translation equivalents (lemma and/or wordform )  Translation equivalents entropy (lemma)  Part-of-Speech affinity  Cognates

7 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages7 Translation equivalents (TE)  YAWA, TREQ-AL use competitive linking based on ll- scores, plus the Ro-En aligned wordnets  MEBA uses GIZA++ generated candidates filtered with a log-likelihood threshold (11).  The TE candidates search space is limited by lemmatization and POS meta-classes (e.g. meta-class 1 includes only N, V, Aj and Adv; meta-class 8 includes only proper names)  For a pair of languages translation equivalents are computed in both directions. The value of the TE feature of a candidate link is 1/2 (PTR(TOKEN1, TOKEN2) + PTR(TOKEN2, TOKEN1).

8 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages8 Entropy Score (ES)  The entropy of a word's translation equivalents distribution proved to be an important hint on identifying highly reliable links (anchoring links)  Skewed distributions favored against uniform ones  For a link, the link feature value is 0.5(ES(A)+ES(B))

9 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages9 Part-of-speech affinity (PA)  An important clue in word alignment is the fact that the translated words tend to keep their part-of-speech and when they have different POSes, this is not arbitrary.  Tried to use GIZA++ (replacing tokens with their respective POSes) but there was too much noise!  The information was computed based on a gold standard (the revised NAACL2003), in both directions (source-target and target-source).  For a link PA=0.5*(P(cat(A)|cat(B))+P(cat(B)|cat(A))

10 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages10 Cognates (COG)  The cognates feature assigns a string similarity (using Levenstein distance) to the tokens of a candidate link  We estimated the probability of a pair of orthographically similar words, appearing in aligned sentences, to be cognates, with different string similarity thresholds. For the threshold 0.6 we didn’t find any exception. Therefore, the value of this feature is either 1 (if the similarity score is above the threshold or 0 otherwise).  Before computing the string similarity score, the words are normalized (duplicate letters are removed, diacritics are removed, some suffixes are discarded).

11 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages11 Context dependent features  Locality  Links crossed  Relative position/Distortion  Collocation/Fertility  Coherence

12 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages12 Collocation  Bi-gram lists (only content words) were built from each monolingual part of the training corpus, using the log-likelihood score (threshold of 10) and minimal occurrence frequency (3) for candidates filtering. Collocation probabilities are estimated for each surviving bi-gram.  If neither token of a candidate link has a relevant collocation score with the tokens in its neighborhood, the link value of this feature is 0. Otherwise the value is the maximum of the collocation probabilities of the link’s tokens. Competing links (starting or finishing in the same token) are licensed only and only if at least one of them have a non-null collocation score

13 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages13 Distorsion/Relative position  Each token in both sides of a bi-text is characterized by a position index, computed as the ratio between the relative position in the sentence and the length of the sentence. The absolute value of the difference between tokens’ position indexes, gives the link’s “obliqueness”  The distorsion feature of a link is its obliqueness D(link)=OBL(SWi, TWj)

14 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages14 Localization  This feature is relevant with or without chunking or dependency parsing modules. It accounts for the degree of the cohesion of links.  With the chunking module is available, and the chunks are aligned via the linking of their respective heads, the links starting in one chunk should finish in the aligned chunk.  When chunking information is not available, the link localization is judged against a window, the span of which is dependent on the aligned sentences length.  Maximum localization (1) is the one with all the tokens in the source window are linked to all tokens in the target window

15 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages15 Crossed links  The crossed links feature computes (for a window size depending on the categories of the candidates and the sentences lengths) the links that were crossed.  The normalization factor (maximum number of crossable links) is empirically set, based on categories of the link’s tokens

16 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages16 EVALUATION:Official ranking U.RACAI.Combined L.ISI.Run5.vocab. grow

17 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages17

18 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages18

19 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages19

20 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages20 Word alignment combiners  The COWAL(ACL2005) combiner is fine- tuned for the concerned language pair (rule-based)  The SMV filter is a language independent combiner (trainable on positive and negative examples)  Trade-off between human introspection and performance

21 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages21 SVM filter  Combining word alignments requires the ability to distinguish among correct links and incorrect links of the two ore more merged alignments. SVM technology is specifically adequate for this task:  The SVM combiner is a classifier trained on both positive and negative examples.

22 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages22 SVM filter evaluation MEBACOWAL MEBA filtered YAWA & MEBA filtered Precision0.91220.87950.93150.8830 Recall0.69760.77750.67120.7713 F-measure0.79240.82540.78020.8234 SVM filtering results. The SVM model was trained on NAACL 2003 gold standard.

23 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages23 Romanian Acquis  The available Romanian documents were downloaded from CCVISTA (over 12000 Microsoft word documents)  We kept only 11228 files (some of them were different versions of the same document)  The remaining documents were converted into the same XML format of the ACQUIS corpus  From the 11228 Romanian files only 6256 are available for English in the JRC distribution

24 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages24 Romanian Acquis Tokenization Sentence splitting POS-tagging Lemmatization Chunking Sentence aligning

25 Arona, 26.09.2005Exploiting parallel corpora in up to 20 languages25

Download ppt "An integrated platform for high-accuracy word alignment Dan Tufis, Alexandru Ceausu, Radu Ion, Dan Stefanescu RACAI – Research Institute for Artificial."

Similar presentations

Statistical Machine Translation

Statistical Machine Translation
Dependency tree projection across parallel texts David Mareček Charles University in Prague Institute of Formal and Applied Linguistics.

Dependency tree projection across parallel texts David Mareček Charles University in Prague Institute of Formal and Applied Linguistics.
Arnd Christian König Venkatesh Ganti Rares Vernica Microsoft Research Entity Categorization Over Large Document Collections.

Arnd Christian König Venkatesh Ganti Rares Vernica Microsoft Research Entity Categorization Over Large Document Collections.
Text Categorization.

Text Categorization.
1 Minimally Supervised Morphological Analysis by Multimodal Alignment David Yarowsky and Richard Wicentowski.

1 Minimally Supervised Morphological Analysis by Multimodal Alignment David Yarowsky and Richard Wicentowski.
On-line Compilation of Comparable Corpora and Their Evaluation Radu ION, Dan TUFIŞ, Tiberiu BOROŞ, Alexandru CEAUŞU and Dan ŞTEFĂNESCU Research Institute.

On-line Compilation of Comparable Corpora and Their Evaluation Radu ION, Dan TUFIŞ, Tiberiu BOROŞ, Alexandru CEAUŞU and Dan ŞTEFĂNESCU Research Institute.
Mustafa Cayci INFS 795 An Evaluation on Feature Selection for Text Clustering.

Mustafa Cayci INFS 795 An Evaluation on Feature Selection for Text Clustering.
Albert Gatt Corpora and Statistical Methods Lecture 13.

Albert Gatt Corpora and Statistical Methods Lecture 13.
Statistical Machine Translation Part II – Word Alignments and EM Alex Fraser Institute for Natural Language Processing University of Stuttgart 2008.07.22.

Statistical Machine Translation Part II – Word Alignments and EM Alex Fraser Institute for Natural Language Processing University of Stuttgart
WWW 2014 Seoul, April 8 th SNOW 2014 Data Challenge Two-level message clustering for topic detection in Twitter Georgios Petkos, Symeon Papadopoulos, Yiannis.

WWW 2014 Seoul, April 8 th SNOW 2014 Data Challenge Two-level message clustering for topic detection in Twitter Georgios Petkos, Symeon Papadopoulos, Yiannis.
SPED 2007, IaşiDan Tufis, Radu Ion1 Parallel Corpora, Alignment Technologies and Further Prospects in Multilingual Resources and Technology Infrastructure.

SPED 2007, IaşiDan Tufis, Radu Ion1 Parallel Corpora, Alignment Technologies and Further Prospects in Multilingual Resources and Technology Infrastructure.
The University of Wisconsin-Madison Universal Morphological Analysis using Structured Nearest Neighbor Prediction Young-Bum Kim, João V. Graça, and Benjamin.

The University of Wisconsin-Madison Universal Morphological Analysis using Structured Nearest Neighbor Prediction Young-Bum Kim, João V. Graça, and Benjamin.
Identifying Translations Philip Resnik, Noah Smith University of Maryland.

Identifying Translations Philip Resnik, Noah Smith University of Maryland.
Confidence Estimation for Machine Translation J. Blatz et.al, Coling 04 SSLI MTRG 11/17/2004 Takahiro Shinozaki.

Confidence Estimation for Machine Translation J. Blatz et.al, Coling 04 SSLI MTRG 11/17/2004 Takahiro Shinozaki.
CS 47051 Word Sense Disambiguation. 2 Overview A problem for semantic attachment approaches: what happens when a given lexeme has multiple ‘meanings’?

CS Word Sense Disambiguation. 2 Overview A problem for semantic attachment approaches: what happens when a given lexeme has multiple ‘meanings’?
Keyword extraction for metadata annotation of Learning Objects Lothar Lemnitzer, Paola Monachesi RANLP, Borovets 2007.

Keyword extraction for metadata annotation of Learning Objects Lothar Lemnitzer, Paola Monachesi RANLP, Borovets 2007.
Taking the Kitchen Sink Seriously: An Ensemble Approach to Word Sense Disambiguation from Christopher Manning et al.

Taking the Kitchen Sink Seriously: An Ensemble Approach to Word Sense Disambiguation from Christopher Manning et al.
1 LM Approaches to Filtering Richard Schwartz, BBN LM/IR ARDA 2002 September 11-12, 2002 UMASS.

1 LM Approaches to Filtering Richard Schwartz, BBN LM/IR ARDA 2002 September 11-12, 2002 UMASS.
Maximum Entropy Model LING 572 Fei Xia 02/07-02/09/06.

Maximum Entropy Model LING 572 Fei Xia 02/07-02/09/06.
1 The Web as a Parallel Corpus  Parallel corpora are useful  Training data for statistical MT  Lexical correspondences for cross-lingual IR  Early.

1 The Web as a Parallel Corpus  Parallel corpora are useful  Training data for statistical MT  Lexical correspondences for cross-lingual IR  Early.

Similar presentations

Ads by Google