Presentation is loading. Please wait.

Presentation is loading. Please wait.

RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Cognate or False Friend? Ask the Web! Svetlin Nakov, Sofia University "St. Kliment Ohridski" Preslav.

Published byAdam Barrett Modified over 11 years ago

Similar presentations

Presentation on theme: "RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Cognate or False Friend? Ask the Web! Svetlin Nakov, Sofia University "St. Kliment Ohridski" Preslav."— Presentation transcript:

1 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Cognate or False Friend? Ask the Web! Svetlin Nakov, Sofia University "St. Kliment Ohridski" Preslav Nakov, University of California, Berkeley Elena Paskaleva, Bulgarian Academy of Sciences A Workshop on Acquisition and Management of Multilingual Lexicons

2 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Introduction Cognates and false friends Cognates are pair of words in different languages that sound similar and are translations of each other False friends are pairs of words in two languages that sound similar but differ in their meanings The problem Design an algorithm that can distinguish between cognates and false friends

3 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Cognates and False Friends Examples of cognates ден in Bulgarian = день in Russian (day) idea in English = идея in Bulgarian (idea) Examples of false friends майка in Bulgarian (mother) майка in Russian (vest) prost in German (cheers) прост in Bulgarian (stupid) gift in German (poison) gift in English (present)

4 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria The Paper in One Slide Measuring semantic similarity Analyze the words local contexts Use the Web as a corpus Similarities contexts similar words Context translation cross-lingual similarity Evaluation 200 pairs of words 100 cognates and 100 false friends 11pt average precision: 95.84%

5 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Contextual Web Similarity What is local context? Few words before and after the target word The words in the local context of given word are semantically related to it Need to exclude the stop words: prepositions, pronouns, conjunctions, etc. Stop words appear in all contexts Need of sufficiently big corpus Same day delivery of fresh flowers, roses, and unique gift baskets from our online boutique. Flower delivery online by local florists for birthday flowers.

6 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Contextual Web Similarity Web as a corpus The Web can be used as a corpus to extract the local context for given word The Web is the largest possible corpus Contains big corpora in any language Searching some word in Google can return up to 1 000 excerpts of texts The target word is given along with its local context: few words before and after it Target language can be specified

7 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Contextual Web Similarity Web as a corpus Example: Google query for "flower" Flowers, Plants, Gift Baskets - 1-800-FLOWERS.COM - Your Florist... Flowers, balloons, plants, gift baskets, gourmet food, and teddy bears presented by 1-800-FLOWERS.COM, Your Florist of Choice for over 30 years. Margarita Flowers - Delivers in Bulgaria for you! - gifts, flowers, roses... Wide selection of BOUQUETS, FLORAL ARRANGEMENTS, CHRISTMAS ECORATIONS, PLANTS, CAKES and GIFTS appropriate for various occasions. CREDIT cards acceptable. Flowers, plants, roses, & gifts. Flowers delivery with fewer... Flowers, roses, plants and gift delivery. Order flowers from ProFlowers once, and you will never use flowers delivery from florists again.

8 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Contextual Web Similarity Measuring semantic similarity For given two words their local contexts are extracted from the Web A set of words and their frequencies Semantic similarity is measured as similarity between these local contexts Local contexts are represented as frequency vectors for given set of words Cosine between the frequency vectors in the Euclidean space is calculated

9 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Contextual Web Similarity Example of context words frequencies wordcount fresh217 order204 rose183 delivery165 gift124 welcome98 red87... word: flower wordcount Internet291 PC286 technology252 order185 new174 Web159 site146... word: computer

10 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Contextual Web Similarity Example of frequency vectors Similarity = cosine(v 1, v 2 ) #wordfreq. 0alias3 1alligator2 2amateur0 3apple5... 4999zap0 5000zoo6 v 1 : flower #wordfreq. 0alias7 1alligator0 2amateur8 3apple133... 4999zap3 5000zoo0 v 2 : computer

11 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Cross-Lingual Similarity We are given two words in different languages L 1 and L 2 We have a bilingual glossary G of translation pairs {p L 1, q L 2 } Measuring cross-lingual similarity: 1. We extract the local contexts of the target words from the Web: C 1 L 1 and C 2 L 2 2. We translate the context 3. We measure distance between C 1 * and C 2 C1*C1* C1C1 G

12 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Reverse Context Lookup Local context extracted from the Web can contain arbitrary parasite words like "online", "home", "search", "click", etc. Internet terms appear in any Web page Such words are not likely to be associated with the target word Example (for the word flowers) "send flowers online", "flowers here", "order flowers here" Will the word "flowers" appear in the local context of "send", "online" and "here"?

13 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Reverse Context Lookup If two words are semantically related both should appear in the local contexts of each other Let #{x,y} = number of occurrences of x in the local context of y For any word w and a word from its local context w c, we define their strength of semantic association p(w,w c ) as follows: p(w, w c ) = min{ #(w, w c ), #(w c,w) } We use p(w,wc) as vector coordinates when measuring semantic similarity

14 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Web Similarity Using Seed Words Adaptation of the Fung&Yee'98 algorithm* We have a bilingual glossary G: L 1 L 2 of translation pairs and target words w 1, w 2 We search in Google the co-occurrences of the target words with the glossary entries Compare the co-occurrence vectors for each {p,q} G compare max (google#("w 1 p") and google#("p w 1 ")) with max (google#"w 2 q") and google#("q w 2 ")) * P. Fung and L. Y. Yee. An IR approach for translating from nonparallel, comparable texts. In Proceedings of ACL, volume 1, pages 414–420, 1998

15 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Evaluation Data Set We use 200 Bulgarian/Russian pairs of words: 100 cognates and 100 false friends Manually assembled by a linguist Manually checked in several large monolingual and bilingual dictionaries Limited to nouns only

16 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Experiments We tested few modifications of our contextual Web similarity algorithm Use of TF.IDF weighting Preserve the stop words Use of lemmatization of the context words Use different context size (2, 3, 4 and 5) Use small and large bilingual glossary Compared it with the seed words algorithm Compared with traditional orthographic similarity measures: LCSR and MEDR

17 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Experiments BASELINE: random MEDR: minimum edit distance ratio LCSR: longest common subsequence ration SEED: the "seed words" algorithm WEB3: the Web-based similarity algorithm with the default parameters: context size = 3, small glossary, stop words filtering, no lemmatization, no reverse context lookup, no TF.IDF-weighting NO-STOP: WEB3 without stop words removal WEB1, WEB2, WEB4 and WEB5: WEB3 with context size of 1, 2, 4 and 5 LEMMA: WEB3 with lemmatization HUGEDICT: WEB3 with the huge glossary REVERSE: the "reverse context lookup" algorithm COMBINED: WEB3 + lemmatization + huge glossary + reverse context lookup

18 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Resources We used the following resources: Bilingual Bulgarian / Russian glossary: 3 794 pairs of translation words Huge bilingual glossary: 59 583 word pairs A list of 599 Bulgarian stop words A list of 508 Russian stop words Bulgarian lemma dictionary: 1 000 000 wordforms and 70 000 lemmata Russian lemma dictionary: 1 500 000 wordforms and 100 000 lemmata

19 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Evaluation We order the pairs of words from the testing dataset by the calculated similarity False friends are expected to appear on the top and the cognates on the bottom We evaluate the 11pt average precision of the obtained ordering

20 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Results (11pt Average Precision) Comparing BASELINE, LCSR, MEDR, SEED and WEB3 algorithms

21 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Results (11pt Average Precision) Comparing different context sizes; keeping the stop words

22 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Results (11pt Average Precision) Comparing different improvements of the WEB3 algorithm

23 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Results (Precision-Recall Graph) Comparing the recall-precision graphs of evaluated algorithms

24 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Results: The Ordering for WEB3 rCandidateBG SenseRU SenseSim.Cogn.?P@rR@r 1 муфта gratismuff0,0085no100.00%1.00% 2 багрене / багренье mottlegaff0,0130no100.00%2.00% 3 добитък / добыток livestockincome0,0143no100.00%3.00% 4 мраз / мразь chillcrud0,0175no100.00%4.00% 5 плет / плеть hedgewhip0,0182no100.00%5.00% … … ……………… 99 вулкан volcano 0,2099yes81.82%81.00% 100 година yeartime0,2101no82.00% 101 бут legrubble0,2130no82.18%83.00% … … ……………… 196 финанси / финансы finance 0,8017yes51.28%100.00% 197 сребро / серебро silver 0,8916yes50.76%100.00% 198 наука science 0,9028yes50.51%100.00% 199 флора flora 0,9171yes50.25%100.00% 200 красота beauty 0,9684yes50.00%100.00%

25 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Discussion Our approach is original because: Introduces semantic similarity measure Not orthographic or phonetic Uses the Web as a corpus Does not rely on any preexisting corpora Uses reverse-context lookup Significant improvement in quality Is applied to original problem Classification of almost identically spelled true/false friends

26 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Discussion Very good accuracy: over 95% It is not 100% accurate Typical mistakes are synonyms, hyponyms, words influenced by cultural, historical and geographical differences The Web as a corpus introduces noise Google returns the first 1 000 results only Google ranks higher news portals, travel agencies and retail sites than books, articles and forums posts Local context could contains noise

27 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Conclusion and Future Work Conclusion Algorithm that can distinguish between cognates and false friends Analyzes words local contexts, using the Web as a corpus Future Work Better glossaries Automatic augmenting the glossary Different language pairs

28 RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Questions? Cognate or False Friend? Ask the Web!

Download ppt "RANLP 2007 – September 27-29, 2007, Borovets, Bulgaria Cognate or False Friend? Ask the Web! Svetlin Nakov, Sofia University "St. Kliment Ohridski" Preslav."

Similar presentations

RANLP 2009 – September 12-18, 2009, Borovets, Bulgaria Unsupervised Extraction of False Friends from Parallel Bi-Texts Using the Web as a Corpus Preslav.

RANLP 2009 – September 12-18, 2009, Borovets, Bulgaria Unsupervised Extraction of False Friends from Parallel Bi-Texts Using the Web as a Corpus Preslav.
DSC 2008 – 26-27 June 2008, Thessaloniki, Greece Automatic Acquisition of Synonyms Using the Web as a Corpus Svetlin Nakov, Sofia University St. Kliment.

DSC 2008 – June 2008, Thessaloniki, Greece Automatic Acquisition of Synonyms Using the Web as a Corpus Svetlin Nakov, Sofia University "St. Kliment.
Genre as Noise - Noise in Genre Andrea Stubbe, Christoph Ringlstetter, Klaus U. Schulz CIS: University of Munich AICML: University of Alberta.

Genre as Noise - Noise in Genre Andrea Stubbe, Christoph Ringlstetter, Klaus U. Schulz CIS: University of Munich AICML: University of Alberta.
Rationale for a multilingual corpus for machine translation evaluation Debbie Elliott Anthony Hartley Eric Atwell Corpus Linguistics 2003, Lancaster, England.

Rationale for a multilingual corpus for machine translation evaluation Debbie Elliott Anthony Hartley Eric Atwell Corpus Linguistics 2003, Lancaster, England.
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.
Spelling Correction for Search Engine Queries Bruno Martins, Mario J. Silva In Proceedings of EsTAL-04, España for Natural Language Processing Presenter:

Spelling Correction for Search Engine Queries Bruno Martins, Mario J. Silva In Proceedings of EsTAL-04, España for Natural Language Processing Presenter:
Chapter 5: Introduction to Information Retrieval

Chapter 5: Introduction to Information Retrieval
Automatic Identification of Cognates, False Friends, and Partial Cognates University of Ottawa, Canada University of Ottawa, Canada.

Automatic Identification of Cognates, False Friends, and Partial Cognates University of Ottawa, Canada University of Ottawa, Canada.
Automatic Identification of Cognates and False Friends in French and English Diana Inkpen and Oana Frunza University of Ottawa and Greg Kondrak University.

Automatic Identification of Cognates and False Friends in French and English Diana Inkpen and Oana Frunza University of Ottawa and Greg Kondrak University.
Free construction of a free dictionary of synonyms using computer science Viggo Kann and Magnus Rosell KTH, Stockholm Talk given by Viggo at Amherst College.

Free construction of a free dictionary of synonyms using computer science Viggo Kann and Magnus Rosell KTH, Stockholm Talk given by Viggo at Amherst College.
A New Suffix Tree Similarity Measure for Document Clustering Hung Chim, Xiaotie Deng City University of Hong Kong WWW 2007 Session: Similarity Search April.

A New Suffix Tree Similarity Measure for Document Clustering Hung Chim, Xiaotie Deng City University of Hong Kong WWW 2007 Session: Similarity Search April.
Query Operations: Automatic Local Analysis. Introduction Difficulty of formulating user queries –Insufficient knowledge of the collection –Insufficient.

Query Operations: Automatic Local Analysis. Introduction Difficulty of formulating user queries –Insufficient knowledge of the collection –Insufficient.
Context-Aware Query Classification Huanhuan Cao 1, Derek Hao Hu 2, Dou Shen 3, Daxin Jiang 4, Jian-Tao Sun 4, Enhong Chen 1 and Qiang Yang 2 1 University.

Context-Aware Query Classification Huanhuan Cao 1, Derek Hao Hu 2, Dou Shen 3, Daxin Jiang 4, Jian-Tao Sun 4, Enhong Chen 1 and Qiang Yang 2 1 University.
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.
Gimme’ The Context: Context- driven Automatic Semantic Annotation with CPANKOW Philipp Cimiano et al.

Gimme’ The Context: Context- driven Automatic Semantic Annotation with CPANKOW Philipp Cimiano et al.
Recall: Query Reformulation Approaches 1. Relevance feedback based vector model (Rocchio …) probabilistic model (Robertson & Sparck Jones, Croft…) 2. Cluster.

Recall: Query Reformulation Approaches 1. Relevance feedback based vector model (Rocchio …) probabilistic model (Robertson & Sparck Jones, Croft…) 2. Cluster.
......................................... Patent Search QUERY Log Analysis Shariq Bashir Department of Software Technology and Interactive Systems Vienna.

Patent Search QUERY Log Analysis Shariq Bashir Department of Software Technology and Interactive Systems Vienna.
Comments on Guillaume Pitel: “Using bilingual LSA for FrameNet annotation of French text from generic resources” Gerd Fliedner Computational Linguistics.

Comments on Guillaume Pitel: “Using bilingual LSA for FrameNet annotation of French text from generic resources” Gerd Fliedner Computational Linguistics.
Information Retrieval

Information Retrieval
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