ACL-OCL / Base_JSON /prefixR /json /R13 /R13-1019.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "R13-1019",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T14:55:38.023696Z"
},
"title": "A Dictionary-Based Approach for Evaluating Orthographic Methods in Cognates Identification",
"authors": [
{
"first": "Alina",
"middle": [
"Maria"
],
"last": "Ciobanu",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Bucharest",
"location": {}
},
"email": "alina.ciobanu@my.fmi.unibuc.ro"
},
{
"first": "Liviu",
"middle": [
"P"
],
"last": "Dinu",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Bucharest",
"location": {}
},
"email": "ldinu@fmi.unibuc.ro"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this paper we propose a method for identifying cognates based on etymology and etymons. We employ this approach to evaluate the extent to which lexical similarity can be used for automatic detection of cognate pairs. We investigate some orthographic approaches widely used in this research area and some original metrics as well. We apply this procedure for Romanian and its most closely related languages, French and Italian, but our method is applicable to any languages.",
"pdf_parse": {
"paper_id": "R13-1019",
"_pdf_hash": "",
"abstract": [
{
"text": "In this paper we propose a method for identifying cognates based on etymology and etymons. We employ this approach to evaluate the extent to which lexical similarity can be used for automatic detection of cognate pairs. We investigate some orthographic approaches widely used in this research area and some original metrics as well. We apply this procedure for Romanian and its most closely related languages, French and Italian, but our method is applicable to any languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Cognates are words in different languages having the same etymology and a common ancestor. The task of cognates identification is widely used in historical and comparative linguistics, in the study of languages relatedness (Chin et al, 2010) , phylogenetic inference (Atkinson et al, 2005) and in identifying how and to what extent languages changed over time. Besides these research areas, in which the genetic relationships between words are extremely relevant, cognates have been successfully used in other fields, such as language acquisition, bilingual word recognition (Dijkstra et al, 2012) , corpus linguistics (Simard et al, 1992) , cross-lingual information retrieval (Buckley et al, 1998) and machine translation (Knight et al, 2003) . In these domains, the term \"cognates\" is usually used with a somewhat different meaning, denoting words with high orthographic/phonetic and cross-lingual meaning similarity, the condition of common etymology being left aside. Kondrak (2001) makes the distinction between the different interpretations of the notion and Inkpen et al (2005) present the definition of \"genetic cognates\".",
"cite_spans": [
{
"start": 223,
"end": 241,
"text": "(Chin et al, 2010)",
"ref_id": "BIBREF5"
},
{
"start": 267,
"end": 289,
"text": "(Atkinson et al, 2005)",
"ref_id": "BIBREF1"
},
{
"start": 575,
"end": 597,
"text": "(Dijkstra et al, 2012)",
"ref_id": "BIBREF8"
},
{
"start": 619,
"end": 639,
"text": "(Simard et al, 1992)",
"ref_id": "BIBREF20"
},
{
"start": 678,
"end": 699,
"text": "(Buckley et al, 1998)",
"ref_id": "BIBREF3"
},
{
"start": 724,
"end": 744,
"text": "(Knight et al, 2003)",
"ref_id": "BIBREF14"
},
{
"start": 973,
"end": 987,
"text": "Kondrak (2001)",
"ref_id": "BIBREF15"
},
{
"start": 1066,
"end": 1085,
"text": "Inkpen et al (2005)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction and Related Work",
"sec_num": "1"
},
{
"text": "In this paper we focus on genetic relationships between words and we use the term \"cognates\" in a broader meaning, counting as cognates the word-etymon pairs as well. Our motivation is that these pairs of words also share a common ancestor, thus complying with the cognates' definition. For example, the Romanian word campion (meaning champion) has Italian etymology and the etymon campione, which has Latin etymology and the etymon campione(m). Thus, the Romanian word campion and the Italian word campione are cognates, as they share a common Latin ancestor.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction and Related Work",
"sec_num": "1"
},
{
"text": "The paper is organized as follows: we introduce our approach to cognates identification in Section 2. We describe the corpus used for our research in Section 3. We present several orthographic approaches used for cognates identification in Section 4. We evaluate these metrics and analyse the results of our experiments in Section 5. Finally, we draw some conclusion regarding our research in Section 6.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction and Related Work",
"sec_num": "1"
},
{
"text": "We focus on the Romanian language and we investigate its cognate pairs with two other Romance languages, French and Italian. We believe this comparison is interesting for the following reason: the two related languages differ significantly with respect to their orthographic depth: the mapping rules between graphemes and phonemes are more complex for French, which has a deep orthography, than for Italian, which has a highly phonemic orthography.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Our Approach",
"sec_num": "2"
},
{
"text": "We identify the etymologies and etymons of the Romanian words using dexonline 1 machine-readable dictionary, which is an aggregator for over 30 Romanian dictionaries. By parsing its definitions, we are able to automatically extract information regarding words' etymologies and etymons. The most frequently used pattern is shown below.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Our Approach",
"sec_num": "2"
},
{
"text": "<abbr class=\"abbrev\" title=\"limba language_name\"> language_abbreviation </abbr> <b> etymon </b>",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Our Approach",
"sec_num": "2"
},
{
"text": "As an example, we provide below an excerpt from a dexonline entry which uses this pattern to specify the etymology of the Romanian word capitol (which means chapter). When more options are possible for explaining a word's etymology, dexonline provides multiple etymologies. We account for all the given alternatives, enabling our method to provide more accurate results. In our example, the word capitol has double etymology: Latin (with the etymon capitulum) and Italian (with the etymon capitolo).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Our Approach",
"sec_num": "2"
},
{
"text": "<b> CAP\u00cdTOL </b> <abbr class=\"abbrev\" title=\"limba italiana\"> it. </abbr> <b> capitolo </b> <abbr class=\"abbrev\" title=\"limba latina\"> lat. </abbr> <b> capitulum </b> After determining the etymologies of the Romanian words, we translate in French all words without French etymology and in Italian all words without Italian etymology using Google Translate 2 . We consider cognate candidates pairs formed of Romanian words and their translations. Using French 3 and Italian 4 dictionaries, we extract etymology-related information for French and Italian words. To identify cognates we compare, for each pair of candidates, the etymologies and the etymons. If they match, we identify the words as being cognates. Our solution for addressing cognates identification answers Swadesh's question, as cited in (Campbell, 2003) : \"Given a small collection of likely-looking cognates, how can one definitely determine whether they are really the residue of common origin and not the workings of pure chance or some other factor?\", as we limit the analysis only to words that share a common etymology, i.e. words that are known to be related.",
"cite_spans": [
{
"start": 803,
"end": 819,
"text": "(Campbell, 2003)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Our Approach",
"sec_num": "2"
},
{
"text": "For example, for the Romanian word victorie, dexonline reports Latin etymology and the etymon victoria. Because this word does not have Italian etymology, we assume it might have a cognate pair in Italian. Consequently, we translate it in Italian, obtaining the word vittoria. We consider the words victorie and vittoria cognate candidates. Using the Italian dictionary we identify, for this word, Latin etymology and the etymon victoria. We compare etymologies and etymons for the Romanian word and its translation in Italian and, as they match, having a common ancestor (Latin) and the same etymon (victoria), we identify them as a cognate pair.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Our Approach",
"sec_num": "2"
},
{
"text": "We apply our method on a high-quality Romanian corpus comprising of the transcription of the parliamentary debates held between 1996 and 2007 in the Romanian Parliament, recently proposed in (Grozea, 2012) . The sessions deal with a wide variety of topics regarding the political, social and economic fields. In this paper we decided to run our experiments using words extracted from a large corpus of transcribed spoken language, in order to investigate the cognates that are most frequently used in Romanian. This dataset covers particular cases in the task of cognates identification, such as cognates between which the degree of orthographic similarity is low (for example the Romanian word atotputernicie, which means almightiness, and its French cognate pair omnipotence, both sharing the Latin etymon omnipotentia) and vice versa, non-cognates that resemble one another (for example the Romanian word m\u0203n\u0203stire, meaning monastery and having the Old Slavic etymon monastyr\u00ed, and its Italian translation monastero, having the Latin etymon monasteriu(m)).",
"cite_spans": [
{
"start": 191,
"end": 205,
"text": "(Grozea, 2012)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Corpus",
"sec_num": "3"
},
{
"text": "Many words have undergone transformations by the augmentation of language-specific diacritics when entering a new language. From an orthographic perspective, the resemblance of words is higher between words without diacritics than between words with diacritics. For example, the similarity seems lower for the Romanian word amici\u0163ie (which means friendship) and its French cognate pair amiti\u00e9 than for their corresponding forms without diacritics, amicitie and amitie. For this reason, we investigate the performances of the orthographic approaches to the task of cognates identification using two versions of the corpus: with and without diacritics included.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Corpus",
"sec_num": "3"
},
{
"text": "For preprocessing this corpus, we removed words that are irrelevant for our investigation, such as dates and numbers and all the transcribers' descriptions of the parliamentary sessions (such as \"The session began at 8:40.\"), as we focus on the spoken language. We performed word segmentation, using whitespace and punctuation marks as delimiters, we lower-cased all words and we removed stop words, using a list of Romanian stop words provided by Apache Lucene 5 text search engine library . We lemmatized the words using dexonline, which provides information regarding the words' inflected forms and enables us to correctly identify lemmas where no part-of-speech or semantic ambiguities arise (in this case we consider the first occurred lemma).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Corpus",
"sec_num": "3"
},
{
"text": "Various word distances have been used in the task of string similarity computation. They have been applied in many different research areas, besides cognates identification, such as sentence alignment (Brew and McKelvie, 1996) , record linkage (Jaro, 1989) , stemming (Dalbelo and Snajder, 2009 ) and bioinformatics (Dinu and Sgarro, 2006) . In (Kondrak, 2001 ) some of the most widely used measures are analysed, and their flaws and the differences between them are emphasized.",
"cite_spans": [
{
"start": 201,
"end": 226,
"text": "(Brew and McKelvie, 1996)",
"ref_id": null
},
{
"start": 244,
"end": 256,
"text": "(Jaro, 1989)",
"ref_id": "BIBREF13"
},
{
"start": 268,
"end": 294,
"text": "(Dalbelo and Snajder, 2009",
"ref_id": null
},
{
"start": 316,
"end": 339,
"text": "(Dinu and Sgarro, 2006)",
"ref_id": "BIBREF10"
},
{
"start": 345,
"end": 359,
"text": "(Kondrak, 2001",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "The approaches used to evaluate cognate pairs are divided in two groups: phonetic and orthographic. The orthographic approaches are usually used in corpus linguistics (Kondrak, 2001) . We employ our method of identifying cognates to evaluate the extent to which lexical similarity can be used for automatic detection of cognates. We investigate some orthographic approaches widely used in this research area and some original metrics as well.",
"cite_spans": [
{
"start": 167,
"end": 182,
"text": "(Kondrak, 2001)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "In (Inkpen et al, 2005) several orthographic similarity measures are used for the classification of pairs of words as cognates or false friends. For our investigation we chose some of the distances used in this paper, another distance that was successfully employed for record linkage and also an original metric in the field of cognates identification, rank distance.",
"cite_spans": [
{
"start": 3,
"end": 23,
"text": "(Inkpen et al, 2005)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "\u2022 Levenshtein distance (Levenshtein, 1965) , also named the edit distance, counts the minimum number of operations (insertion, deletion and substitution) required to transform one string into another. We use a normalized Levenshtein distance computed as:",
"cite_spans": [
{
"start": 23,
"end": 42,
"text": "(Levenshtein, 1965)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "\u2022 Rank distance (Dinu and Dinu, 2005 ) is used to measure the similarity between two rank lists. A ranking of a set of n objects can be represented as a permutation of the integers 1, 2, ..., n. S is a set of ranking results. \u03c3 \u2208 S. \u03c3(i) represents the rank of object i in the ranking result \u03c3. The rank distance is computed as:",
"cite_spans": [
{
"start": 16,
"end": 36,
"text": "(Dinu and Dinu, 2005",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "RD(\u03c3, \u03c4 ) = i=n i=1 |\u03c3(i) \u2212 \u03c4 (i)|",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "The ranks of the elements are given from bottom up, i.e. from n to 1, in a Borda order. The elements which do not occur in one of the rankings receive the rank 0. To extend the rank distance to strings, we index each occurence of a given letter a with a k , where k is the number of its previous occurences, and then compute the rank distance for the new indexed strings which become in this situation rankings. In order to normalize it, we divide the obtained value by the maximum possible distance between two strings u and v, which is:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "|u|(|u| + 1) 2 + |v|(|v| + 1) 2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "E.g. \u2206(langue, lingua) = 10 42 = 0.23",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "\u2022 Longest common subsequence ratio (Melamed, 1995) computes the similarity between two words dividing the length of the longest common subsequence of the two words by the length of the longer word:",
"cite_spans": [
{
"start": 35,
"end": 50,
"text": "(Melamed, 1995)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "LCSR(wi, wj) = LCS(wi, wj) max(|wi|, |wj|)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "where LCS(w i , w j ) is the longest common subsequence of w i and w j . We subtract this value from 1, in order to obtain the distance between two words. E.g. \u2206(langue, lingua) = 1 \u2212 4 6 = 0.33",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "\u2022 XDice (Brew and McKelvie, 1996) is a version of Dice's coefficient (Adamson and Boreham, 1972) which counts the number of shared character bigrams between two words and divides it by the number of bigrams in both words, allowing also extended bigrams (formed by the first and third letter of trigrams):",
"cite_spans": [
{
"start": 8,
"end": 33,
"text": "(Brew and McKelvie, 1996)",
"ref_id": null
},
{
"start": 69,
"end": 96,
"text": "(Adamson and Boreham, 1972)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "XDICE(wi, wj) = 2 * |xbi(wi) \u2229 xbi(wj)| |xbi(wi) + xbi(wj)|",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "where xbi(w) is a function which determines the multi-set of character bigrams and extended bigrams in w. As XDice computes similarity between words, we subtract its value from 1 to obtain distances.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "E.g. \u2206(langue, lingua) = 1 \u2212 2 * 4 18 = 0.55",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "\u2022 Jaro distance (Jaro, 1989) and its version, Jaro-Winkler distance (Winkler, 1990) , are measures which account for the number and position of common characters between words. These metrics are described in (Delmestri and Dinu, 2012) . Given two strings w i = (w i1 , ..., w im ) and w j = (w j 1 , ..., w j n ), the number of common characters for w i and w j is the number of charachters w ik in w i which satisfy the condition:",
"cite_spans": [
{
"start": 16,
"end": 28,
"text": "(Jaro, 1989)",
"ref_id": "BIBREF13"
},
{
"start": 68,
"end": 83,
"text": "(Winkler, 1990)",
"ref_id": "BIBREF21"
},
{
"start": 208,
"end": 234,
"text": "(Delmestri and Dinu, 2012)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "\u2203wj l in wj : wi k = wj l , |k \u2212 l| \u2264 max(m, n) 2 \u2212 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "Let c be the number of common characters in w i and w j and t the number of character transpositions (i.e. the number of common characters in w i and w j in different positions, divided by 2). Jaro distance is defined as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "J(wi, wj) = 1 3 * c m + c n + c \u2212 t c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "As both Jaro and Jaro-Winkler metrics are string similarity measures, we subtract these values from 1 to obtain distances between words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "E.g. \u2206(langue, lingua) = 1\u2212 1 3 * 4 6 + 4 6 + 4\u22120",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "4 = 0.22",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "Jaro-Winkler distance accounts also for the length l of the common preffix of w i and w j (l \u2264 4) and considers a scaling factor p = 0.1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "JW (wi, wj) = J(wi, wj) + p * l * (1 \u2212 J(wi, wj))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "where J(w i , w j ) is the Jaro distance for words w i and w j .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "E.g. \u2206(langue, lingua) = 1 \u2212 (0.77 + 0.1 * 1 * (1 \u2212 0.77)) = 0.20",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orthographic Approaches",
"sec_num": "4"
},
{
"text": "In order to evaluate the performances of these orthographic approaches to the task of cognates identification, we apply the method presented in Section 2 for determining cognate pairs in Italian and French for each word in the preprocessed corpus. The statistics for this phase of our procedure are listed in Table 1 . Table 1 : Statistics for the Romanian corpus: the total number of type words, token words and lemmas (in column 1) and the number of type words, token words and lemmas having an etymon or a cognate pair in French (column 2) or in Italian (column 3). It can be noticed that the sum of token words with cognate pairs or etymons in French and Italian is higher than the total number of token words after preprocessing the corpus, due to the fact that many of these words have cognate pairs or etymons in both languages Further, we excerpt from the corpus, for each of the two languages, random samples of 5,000 words which have a cognate pair in the related language and 5,000 which do not have such matching pair. We match these latter words with their translations. Thus, we obtain a sample of 10,000 pairs of words for Romanian and Italian, 5,000 pairs of cognates and 5,000 pairs of non-cognates. We obtain a similar set for Romanian and French. For each dataset we also consider the version without diacritics. We compute the lexical distances for each pair of words, setting various thresholds Table 2 : Recall (R), precision (P), accuracy (A) and f-score (F) values (computed as percentages) for orthographic measures in the task of cognates identification when diacritics are accounted for for identifying cognates. The lists of cognates and non-cognates and the values computed by the orthographic distances for all the words in the Romanian-French and Romanian-Italian datasets are available from the authors on request. We count the occurences of each possible outcome: true positive (TP), true negative (TN), false positive (FP) and false negative (FN). In order to analyse and compare the relevance of these metrics, we further use these results to compute the values for recall, precision, accuracy and f-score using the formulas shown below, as presented in (Manning et al, 2008) .",
"cite_spans": [
{
"start": 2189,
"end": 2210,
"text": "(Manning et al, 2008)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [
{
"start": 309,
"end": 316,
"text": "Table 1",
"ref_id": null
},
{
"start": 319,
"end": 326,
"text": "Table 1",
"ref_id": null
},
{
"start": 1416,
"end": 1423,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Evaluation and Results Analysis",
"sec_num": "5"
},
{
"text": "recall = T P T P + F N precision = T P T P + F P accuracy = T P + T N T P + T N + F P + F N f \u2212 score = 2 * precision * recall precision + recall",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation and Results Analysis",
"sec_num": "5"
},
{
"text": "The results of our research are listed in Table 2 for the corpus with diacritics and in Table 3 for the corpus without diacritics. We highlighted the maximum accuracy obtained by each metric for thresholds between 0 and 1. Between Jaro and Jaro-Winkler distances, we decided to use only the latter metric in our analysis, as they are similar to a certain extent and we noticed that Jaro-Winkler distance provides better results.",
"cite_spans": [],
"ref_spans": [
{
"start": 42,
"end": 49,
"text": "Table 2",
"ref_id": null
},
{
"start": 88,
"end": 95,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Evaluation and Results Analysis",
"sec_num": "5"
},
{
"text": "According to the outcome of our investigation, the edit distance identifies Romanian-French and Romanian-Italian cognates with the highest degree of accuracy, reaching its maximum for a threshold value of 0.5 (and 0.6 for French, when diacritics are accounted for), followed closely by Jaro-Winkler distance and the longest common subsequence ratio. An interesting situation can be observed for Jaro-Winkler distance, whose accuracy decreses dramatically starting with 0.5 threshold, especially when diacritics are not taken into consideration. As expected, for each orthographic method the accuracy increases, reaches a maximum and then decreases, due to the precisionrecall tradeoff. However, it is interesting to observe the similarity for the longest common subsequence ratio, rank distance and edit distance with regard to their accuracy curves when diacritics are accounted for. XDice and Jaro-Winkler distances exhibit different behaviours, in that Jaro-Winkler reaches its maximum accuracy for a threshold value lower than the average, while XDice has maximum accuracy for a higher threshold value. This behaviour stands for both languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation and Results Analysis",
"sec_num": "5"
},
{
"text": "It can be noticed that the orthographic approaches we used obtain higher degrees of accuracy for French than for Italian, which implies the fact that the orthographic changes undergone in the process of adapting to the Romanian language are a better indicator of cognacy for words with Table 3 : Recall (R), precision (P), accuracy (A) and f-score (F) values (computed as percentages) for orthographic measures in the task of cognates identification when diacritics are not accounted for French etymons or cognate pairs than for words with Italian etymons or cognate pairs. A possible explanation is that starting with the 19 th century numerous words were imported from French. That period represents a stage in the Romanian's language evolution in which norms for the vocabulary of the literary language were defined, including patterns for adapting neologisms to Romanian, and probably many of the French words which entered the language in the 19 th century are in this situation.",
"cite_spans": [],
"ref_spans": [
{
"start": 286,
"end": 293,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Evaluation and Results Analysis",
"sec_num": "5"
},
{
"text": "In this paper we proposed a dictionary-based approach to identifying cognate pairs. We extracted etymology-related information from online dictionaries and we accounted for etymologies and etymons to detect cognates. We applied our method on a high-volume Romanian corpus and we focused on detecting cognate pairs between Romanian and its most closely related languages, Italian and French. We used this method to investigate to which extent the lexical similarity can be used for automatic detection of cognates, analysing the performances obtained by various orthographic approaches: edit distance, rank distance, longest common subsequence ratio, XDice distance and Jaro-Winkler distance. Our results show that the edit distance classifies pairs of words as cognates or non-cognates with the highest degree of accu-racy, obtaining better results for French than for Italian, with some improvements when diacritics are not accounted for.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "A possible application for cognates identification is native language detection (Popescu and Ionescu, 2013) . We believe that accounting for genetic relationships between words could prove useful for this task. In our future work we intend to further investigate the performances of the orthographic approaches to the task of cognates identification by introducing an additional step of parameter tuning for the threshold value in our procedure. We plan to apply this method of identifying cognates on the entire dexonline dictionary. In this paper we focused on the cognates that are most frequently used in Romanian, but we believe that obtaining an almost exhaustive dataset of Romanian-French and Romanian-Italian cognate pairs would be an important achievement.",
"cite_spans": [
{
"start": 80,
"end": 107,
"text": "(Popescu and Ionescu, 2013)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "6"
},
{
"text": "http://dexonline.ro",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://translate.google.com 3 http://www.cnrtl.fr/etymologie 4 http://www.sapere.it/sapere/dizionari.html",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://lucene.apache.org EDIT (wi, wj) = LD(wi, wj) max(|wi|, |wj|) where LD(w i , w j ) is the Levenshtein distance for words w i and w j . E.g. \u2206(langue, lingua) = 2 6 = 0.33",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "The authors thank the anonymous reviewers for their helpful and constructive comments. The contribution of the authors to this paper is equal. Research supported by a grant of the Romanian National Authority for Scientific Research, CNCS -UEFISCDI, project number PN-II-ID-PCE-2011-3-0959.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "The use of an association measure based on character structure to identify semantically related pairs of words and document titles",
"authors": [
{
"first": "George",
"middle": [
"W"
],
"last": "Adamson",
"suffix": ""
},
{
"first": "Jillian",
"middle": [],
"last": "Boreham",
"suffix": ""
}
],
"year": 1974,
"venue": "Information Storage and Retrieval",
"volume": "10",
"issue": "",
"pages": "253--260",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "George.W. Adamson and Jillian Boreham. 1974. The use of an association measure based on character structure to identify semantically related pairs of words and document titles. Information Storage and Retrieval, 10: 253-260.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "From words to dates: water into wine, mathemagic or phylogenetic inference?",
"authors": [
{
"first": "Quentin",
"middle": [
"D"
],
"last": "Atkinson",
"suffix": ""
},
{
"first": "Russell",
"middle": [
"D"
],
"last": "Gray",
"suffix": ""
},
{
"first": "Geoff",
"middle": [
"K"
],
"last": "Nicholls",
"suffix": ""
},
{
"first": "David",
"middle": [
"J"
],
"last": "Welch",
"suffix": ""
}
],
"year": 2005,
"venue": "Transactions of the Philological Society",
"volume": "103",
"issue": "",
"pages": "193--219",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Quentin D. Atkinson, Russell D. Gray and Geoff K. Nicholls, David J. Welch. 2005. From words to dates: water into wine, mathemagic or phylogenetic inference? Transactions of the Philological Society, 103: 193-219.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Word-pair extraction for lexicography",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Brew",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Mckelvie",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the 2nd International Conference on New Methods in Language Processing",
"volume": "",
"issue": "",
"pages": "45--55",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Brew and David McKelvie. 1998. Word-pair extraction for lexicography. Proceedings of the 2nd International Conference on New Methods in Lan- guage Processing, Ankara, Turkey, 45-55.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Using Clustering and SuperConcepts within SMART: TREC 6",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Buckley",
"suffix": ""
},
{
"first": "Claire",
"middle": [],
"last": "Cardie",
"suffix": ""
},
{
"first": "Mandar",
"middle": [],
"last": "Mitra",
"suffix": ""
},
{
"first": "Janet",
"middle": [],
"last": "Walz",
"suffix": ""
}
],
"year": 1998,
"venue": "Proceedings of the Sixth Text Retrieval Conference (TREC-6)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Buckley, Claire Cardie, Mandar Mitra and Janet Walz 1998. Using Clustering and SuperConcepts within SMART: TREC 6. Proceedings of the Sixth Text Retrieval Conference (TREC-6).",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "How to Show Languages are Related: Methods for Distant Genetic Relationship",
"authors": [
{
"first": "Lyle",
"middle": [],
"last": "Campbell",
"suffix": ""
}
],
"year": 2003,
"venue": "The Handbook of Historical Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lyle Campbell. 2003. How to Show Languages are Related: Methods for Distant Genetic Relationship. In Joseph, Brian D. and Richard W. Janda (eds.). The Handbook of Historical Linguistics. Blackwell.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Identification of Closely-Related Indigenous Languages: An Orthographic Approach",
"authors": [
{
"first": "Beatrice",
"middle": [],
"last": "Chin",
"suffix": ""
},
{
"first": "Bali",
"middle": [],
"last": "Ranaivo-Malan\u00e7on",
"suffix": ""
},
{
"first": "Ee-Lee",
"middle": [],
"last": "Ng",
"suffix": ""
},
{
"first": "Alvin",
"middle": [
"W"
],
"last": "Yeo",
"suffix": ""
}
],
"year": 2010,
"venue": "International Journal of Asian Language Processing",
"volume": "20",
"issue": "2",
"pages": "43--62",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Beatrice Chin, Bali Ranaivo-Malan\u00e7on, Ee-Lee Ng and Alvin W. Yeo. 2010. Identification of Closely- Related Indigenous Languages: An Orthographic Approach. International Journal of Asian Language Processing, 20(2): 43-62.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "String distance-based stemming of the highly inflected Croatian language",
"authors": [
{
"first": "Dalbelo",
"middle": [],
"last": "Bojana",
"suffix": ""
},
{
"first": "Jan\u0161najder",
"middle": [],
"last": "Ba\u0161ic",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the International Conference RANLP-2009",
"volume": "",
"issue": "",
"pages": "411--415",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bojana Dalbelo Ba\u0161ic and Jan\u0160najder. 2009. String distance-based stemming of the highly inflected Croatian language. Proceedings of the International Conference RANLP-2009. Borovets, Bulgaria, 411- 415.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "An Assessment of String Similarity Methods for Cognate Identification",
"authors": [
{
"first": "Antonella",
"middle": [],
"last": "Delmestri",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Liviu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Dinu",
"suffix": ""
}
],
"year": 2012,
"venue": "Methods and Applications of Quantitative Linguistics: Selected papers of the VI-IIth International Conference on Quantitative Linguistics (QUALICO)",
"volume": "",
"issue": "",
"pages": "16--19",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Antonella Delmestri and Liviu P. Dinu. 2012. An Assessment of String Similarity Methods for Cog- nate Identification In Methods and Applications of Quantitative Linguistics: Selected papers of the VI- IIth International Conference on Quantitative Lin- guistics (QUALICO), Belgrade, Serbia, April, Ed- itors: Ivan Obradovi\u0107, Emmerich Kelih, Reinhard K\u00f6hler, 16-19.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Distributions of cognates in Europe as based on Levenshtein distance",
"authors": [
{
"first": "Ton",
"middle": [],
"last": "Dijkstra",
"suffix": ""
},
{
"first": "Franc",
"middle": [],
"last": "Grootjen",
"suffix": ""
},
{
"first": "Job",
"middle": [],
"last": "Schepens",
"suffix": ""
}
],
"year": 2012,
"venue": "Bilingualism: Language and Cognition",
"volume": "15",
"issue": "",
"pages": "157--166",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ton Dijkstra, Franc Grootjen and Job Schepens. 2012. Distributions of cognates in Europe as based on Levenshtein distance. Bilingualism: Language and Cognition, 15: 157-166.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "On the Syllabic Similarities of Romance Languages",
"authors": [
{
"first": "Anca",
"middle": [],
"last": "Dinu",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Liviu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Dinu",
"suffix": ""
}
],
"year": 2005,
"venue": "CICLing 2005",
"volume": "3406",
"issue": "",
"pages": "785--789",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anca Dinu and Liviu P. Dinu. 2005. On the Syl- labic Similarities of Romance Languages. A. Gel- bukh (ed.): CICLing 2005, Lecture Notes in Com- puter Science, 3406: 785-789.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "A Lowcomplexity Distance for DNA Strings",
"authors": [
{
"first": "P",
"middle": [],
"last": "Liviu",
"suffix": ""
},
{
"first": "Andrea",
"middle": [],
"last": "Dinu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sgarro",
"suffix": ""
}
],
"year": 2006,
"venue": "Fundam. Inform",
"volume": "73",
"issue": "3",
"pages": "361--372",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liviu P. Dinu and Andrea Sgarro. 2006. A Low- complexity Distance for DNA Strings. Fundam. In- form., 73(3): 361-372.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Automatic Identification of Cognates and False Friends in French and English RANLP-2005",
"authors": [
{
"first": "Diana",
"middle": [],
"last": "Inkpen",
"suffix": ""
},
{
"first": "Oana",
"middle": [],
"last": "Frunza",
"suffix": ""
},
{
"first": "Grzegorz",
"middle": [],
"last": "Kondrak",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "251--257",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diana Inkpen, Oana Frunza and Grzegorz Kondrak. 2005. Automatic Identification of Cognates and False Friends in French and English RANLP-2005, Bulgaria, 251-257.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Experiments and Results with Diacritics Restoration in Romanian",
"authors": [
{
"first": "Cristian",
"middle": [],
"last": "Grozea",
"suffix": ""
}
],
"year": 2012,
"venue": "TSD",
"volume": "2012",
"issue": "",
"pages": "199--206",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cristian Grozea. 2012. Experiments and Results with Diacritics Restoration in Romanian. TSD 2012, 199-206.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Advances in record linkage methodology as applied to the 1985 census of Tampa Florida",
"authors": [
{
"first": "Matthew",
"middle": [
"A"
],
"last": "Jaro",
"suffix": ""
}
],
"year": 1989,
"venue": "Journal of the American Statistical Society",
"volume": "84",
"issue": "406",
"pages": "414--434",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matthew A. Jaro. 1989. Advances in record linkage methodology as applied to the 1985 census of Tampa Florida. Journal of the American Statistical Society, 84(406): 414--20.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Cognates Can Improve Statistical Translation Models",
"authors": [
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
},
{
"first": "Grzegorz",
"middle": [],
"last": "Kondrak",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, Companion volume of the Proceedings of HLT-NAACL 2003",
"volume": "",
"issue": "",
"pages": "46--48",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kevin Knight, Grzegorz Kondrak and Daniel Marcu. 2003. Cognates Can Improve Statistical Translation Models. Proceedings of the Human Language Tech- nology Conference of the North American Chap- ter of the Association for Computational Linguis- tics, Companion volume of the Proceedings of HLT- NAACL 2003, 46-48.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Identifying cognates by phonetic and semantic similarity. NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for",
"authors": [
{
"first": "Grzegorz",
"middle": [],
"last": "Kondrak",
"suffix": ""
}
],
"year": 2001,
"venue": "Computational Linguistics on Language technologies",
"volume": "",
"issue": "",
"pages": "1--8",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Grzegorz Kondrak. 2001. Identifying cognates by phonetic and semantic similarity. NAACL '01 Pro- ceedings of the second meeting of the North Amer- ican Chapter of the Association for Computational Linguistics on Language technologies, 1-8.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Binary Codes Capable of Correcting Deletions",
"authors": [
{
"first": "Vladimir",
"middle": [
"I"
],
"last": "Levenshtein",
"suffix": ""
}
],
"year": 1965,
"venue": "Insertions, and Reversals. Soviet Physics Doklady",
"volume": "10",
"issue": "",
"pages": "707--710",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vladimir I. Levenshtein. 1965. Binary Codes Capable of Correcting Deletions, Insertions, and Reversals. Soviet Physics Doklady, 10: 707-710.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Introduction to Information Retrieval",
"authors": [
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Prabhakar",
"middle": [],
"last": "Raghavan",
"suffix": ""
},
{
"first": "Hinrich",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christopher D. Manning, Prabhakar Raghavan and Hinrich Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press, Cambridge, UK.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Automatic Evaluation and Uniform Filter Cascades for Inducing N-Best Translation Lexicons",
"authors": [
{
"first": "Dan",
"middle": [],
"last": "Melamed",
"suffix": ""
}
],
"year": 1995,
"venue": "Proceedings of the Third Workshop on Very Large Corpora",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dan Melamed. 1995. Automatic Evaluation and Uni- form Filter Cascades for Inducing N-Best Transla- tion Lexicons. In Proceedings of the Third Work- shop on Very Large Corpora.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "The Story of the Characters, the DNA, and the Native Language",
"authors": [
{
"first": "Marius",
"middle": [],
"last": "Popescu",
"suffix": ""
},
{
"first": "Radu Tudor",
"middle": [],
"last": "Ionescu",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the BEA-8 Workshop of NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marius Popescu and Radu Tudor Ionescu. 2013. The Story of the Characters, the DNA, and the Native Language. In Proceedings of the BEA-8 Workshop of NAACL.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Using Cognates to Align Sentences in Bilingual Corpora",
"authors": [
{
"first": "Michel",
"middle": [],
"last": "Simard",
"suffix": ""
},
{
"first": "George",
"middle": [
"F"
],
"last": "Foster",
"suffix": ""
},
{
"first": "Pierre",
"middle": [],
"last": "Isabelle",
"suffix": ""
}
],
"year": 1992,
"venue": "Proceedings of the Fourth International Conference on Theoretical and Methodological Issues in Machine Translation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michel Simard, George F. Foster and Pierre Isabelle. 1992. Using Cognates to Align Sentences in Bilin- gual Corpora. In Proceedings of the Fourth Interna- tional Conference on Theoretical and Methodologi- cal Issues in Machine Translation.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "String Comparator Metrics and Enhanced Decision Rules in the Fellegi-Sunter Model of Record Linkage",
"authors": [
{
"first": "William",
"middle": [
"E"
],
"last": "Winkler",
"suffix": ""
}
],
"year": 1990,
"venue": "Proceedings of the Section on Survey Research Methods (American Statistical Association",
"volume": "",
"issue": "",
"pages": "354--359",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "William E. Winkler. 1990. String Comparator Metrics and Enhanced Decision Rules in the Fellegi-Sunter Model of Record Linkage. Proceedings of the Sec- tion on Survey Research Methods (American Statis- tical Association), 354-359.",
"links": null
}
},
"ref_entries": {}
}
}