Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "E09-1021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T10:48:56.107510Z"
},
"title": "Translation and Extension of Concepts Across Languages",
"authors": [
{
"first": "Dmitry",
"middle": [],
"last": "Davidov",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "ICNC The Hebrew University of Jerusalem",
"location": {}
},
"email": "[email protected]"
},
{
"first": "Ari",
"middle": [],
"last": "Rappoport",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "The Hebrew University of Jerusalem",
"location": {}
},
"email": "[email protected]"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We present a method which, given a few words defining a concept in some language, retrieves, disambiguates and extends corresponding terms that define a similar concept in another specified language. This can be very useful for cross-lingual information retrieval and the preparation of multilingual lexical resources. We automatically obtain term translations from multilingual dictionaries and disambiguate them using web counts. We then retrieve web snippets with cooccurring translations, and discover additional concept terms from these snippets. Our term discovery is based on coappearance of similar words in symmetric patterns. We evaluate our method on a set of language pairs involving 45 languages, including combinations of very dissimilar ones such as Russian, Chinese, and Hebrew for various concepts. We assess the quality of the retrieved sets using both human judgments and automatically comparing the obtained categories to corresponding English WordNet synsets.",
"pdf_parse": {
"paper_id": "E09-1021",
"_pdf_hash": "",
"abstract": [
{
"text": "We present a method which, given a few words defining a concept in some language, retrieves, disambiguates and extends corresponding terms that define a similar concept in another specified language. This can be very useful for cross-lingual information retrieval and the preparation of multilingual lexical resources. We automatically obtain term translations from multilingual dictionaries and disambiguate them using web counts. We then retrieve web snippets with cooccurring translations, and discover additional concept terms from these snippets. Our term discovery is based on coappearance of similar words in symmetric patterns. We evaluate our method on a set of language pairs involving 45 languages, including combinations of very dissimilar ones such as Russian, Chinese, and Hebrew for various concepts. We assess the quality of the retrieved sets using both human judgments and automatically comparing the obtained categories to corresponding English WordNet synsets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Numerous NLP tasks utilize lexical databases that incorporate concepts (or word categories): sets of terms that share a significant aspect of their meanings (e.g., terms denoting types of food, tool names, etc). These sets are useful by themselves for improvement of thesauri and dictionaries, and they are also utilized in various applications including textual entailment and question answering. Manual development of lexical databases is labor intensive, error prone, and susceptible to arbitrary human decisions. While databases like WordNet (WN) are invaluable for NLP, for some applications any offline resource would not be extensive enough. Frequently, an application requires data on some very specific topic or on very recent news-related events. In these cases even huge and ever-growing resources like Wikipedia may provide insufficient coverage. Hence applications turn to Web-based on-demand queries to obtain the desired data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The majority of web pages are written in English and a few other salient languages, hence most of the web-based information retrieval studies are done on these languages. However, due to the substantial growth of the multilingual web 1 , queries can be performed and the required information can be found in less common languages, while the query language frequently does not match the language of available information.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Thus, if we are looking for information about some lexical category where terms are given in a relatively uncommon language such as Hebrew, it is likely to find more detailed information and more category instances in a salient language such as English. To obtain such information, we need to discover a word list that represents the desired category in English. This list can be used, for instance, in subsequent focused search in order to obtain pages relevant for the given category. Thus given a few Hebrew words as a description for some category, it can be useful to obtain a similar (and probably more extended) set of English words representing the same category.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In addition, when exploring some lexical category in a common language such as English, it is frequently desired to consider available resources from different countries. Such resources are likely to be written in languages different from English. In order to obtain such resources, as before, it would be beneficial, given a concept definition in English, to obtain word lists denoting the same concept in different languages. In both cases a concept as a set of words should be translated as a whole from one language to another.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper we present an algorithm that given a concept defined as a set of words in some source language discovers and extends a similar set in some specified target language. Our approach comprises three main stages. First, given a few terms, we obtain sets of their translations to the target language from multilingual dictionaries, and use web counts to select the appropriate word senses. Next, we retrieve search engine snippets with the translated terms and extract symmetric patterns that connect these terms. Finally, we use these patterns to extend the translated concept, by obtaining more terms from the snippets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We performed thorough evaluation for various concepts involving 45 languages. The obtained categories were manually verified with two human judges and, when appropriate, automatically compared to corresponding English WN synsets. In all tested cases we discovered dozens of concept terms with state-of-the-art precision.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our major contribution is a novel framework for concept translation across languages. This framework utilizes web queries together with dictionaries for translation, disambiguation and extension of given terms. While our framework relies on the existence of multilingual dictionaries, we show that even with basic 1000 word dictionaries we achieve good performance. Modest time and data requirements allow the incorporation of our method in practical applications.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In Section 2 we discuss related work, Section 3 details the algorithm, Section 4 describes the evaluation protocol and Section 5 presents our results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Substantial efforts have been recently made to manually construct and interconnect WN-like databases for different languages (Pease et al., 2008; Charoenporn et al., 2007) . Some studies (e.g., (Amasyali, 2005) ) use semi-automated methods based on language-specific heuristics and dictionaries.",
"cite_spans": [
{
"start": 125,
"end": 145,
"text": "(Pease et al., 2008;",
"ref_id": "BIBREF23"
},
{
"start": 146,
"end": 171,
"text": "Charoenporn et al., 2007)",
"ref_id": null
},
{
"start": 194,
"end": 210,
"text": "(Amasyali, 2005)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "At the same time, much work has been done on automatic lexical acquisition, and in particular, on the acquisition of concepts. The two main algorithmic approaches are pattern-based discovery, and clustering of context feature vectors. The latter represents word contexts as vectors in some space and use similarity measures and automatic clustering in that space (Deerwester et al., 1990) . Pereira (1993) , Curran (2002) and Lin (1998) use syntactic features in the vector definition. (Pantel and Lin, 2002) improves on the latter by clustering by committee. Caraballo (1999) uses conjunction and appositive annotations in the vector representation. While a great effort has focused on improving the computational complexity of these methods (Gorman and Curran, 2006) , they still remain data and computation intensive.",
"cite_spans": [
{
"start": 363,
"end": 388,
"text": "(Deerwester et al., 1990)",
"ref_id": "BIBREF8"
},
{
"start": 391,
"end": 405,
"text": "Pereira (1993)",
"ref_id": "BIBREF24"
},
{
"start": 408,
"end": 421,
"text": "Curran (2002)",
"ref_id": "BIBREF3"
},
{
"start": 426,
"end": 436,
"text": "Lin (1998)",
"ref_id": "BIBREF16"
},
{
"start": 486,
"end": 508,
"text": "(Pantel and Lin, 2002)",
"ref_id": "BIBREF18"
},
{
"start": 560,
"end": 576,
"text": "Caraballo (1999)",
"ref_id": "BIBREF1"
},
{
"start": 743,
"end": 768,
"text": "(Gorman and Curran, 2006)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "The current major algorithmic approach for concept acquisition is to use lexico-syntactic patterns. Patterns have been shown to produce more accurate results than feature vectors, at a lower computational cost on large corpora (Pantel et al., 2004) . Since (Hearst, 1992) , who used a manually prepared set of initial lexical patterns in order to acquire relationships, numerous pattern-based methods have been proposed for the discovery of concepts from seeds (Pantel et al., 2004; Davidov et al., 2007; Pasca et al., 2006) . Most of these studies were done for English, while some show the applicability of their method to some other languages including Russian, Greek, Czech and French.",
"cite_spans": [
{
"start": 227,
"end": 248,
"text": "(Pantel et al., 2004)",
"ref_id": "BIBREF19"
},
{
"start": 257,
"end": 271,
"text": "(Hearst, 1992)",
"ref_id": "BIBREF13"
},
{
"start": 461,
"end": 482,
"text": "(Pantel et al., 2004;",
"ref_id": "BIBREF19"
},
{
"start": 483,
"end": 504,
"text": "Davidov et al., 2007;",
"ref_id": "BIBREF5"
},
{
"start": 505,
"end": 524,
"text": "Pasca et al., 2006)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "Many papers directly target specific applications, and build lexical resources as a side effect. Named Entity Recognition can be viewed as an instance of the concept acquisition problem where the desired categories contain words that are names of entities of a particular kind, as done in (Freitag, 2004) using co-clustering and in (Etzioni et al., 2005) using predefined pattern types. Many Information Extraction papers discover relationships between words using syntactic patterns (Riloff and Jones, 1999) .",
"cite_spans": [
{
"start": 289,
"end": 304,
"text": "(Freitag, 2004)",
"ref_id": "BIBREF11"
},
{
"start": 332,
"end": 354,
"text": "(Etzioni et al., 2005)",
"ref_id": "BIBREF10"
},
{
"start": 484,
"end": 508,
"text": "(Riloff and Jones, 1999)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "Unlike in the majority of recent studies where the acquisition framework is designed with specific languages in mind, in our task the algorithm should be able to deal well with a wide variety of target languages without any significant manual adaptations. While some of the proposed frameworks could potentially be language-independent, little research has been done to confirm it yet.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "There are a few obstacles that may hinder applying common pattern-based methods to other languages. Many studies utilize parsing or POS tagging, which frequently depends on the availability and quality of language-specific tools. Most studies specify seed patterns in advance, and it is not clear whether translated patterns can work well on different languages. Also, the absence of clear word segmentation in some languages (e.g., Chinese) can make many methods inapplicable.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "A few recently proposed concept acquisition methods require only a handful of seed words (Davidov et al., 2007; Pasca and Van Durme, 2008) . While these studies avoid some of the obstacles above, it still remains unconfirmed whether such methods are indeed language-independent. In the concept extension part of our algorithm we adapt our concept acquisition framework (Davidov and Rappoport, 2006; Davidov et al., 2007; Davidov and Rappoport, 2008a; Davidov and Rappoport, 2008b) to suit diverse languages, including ones without explicit word segmentation. In our evaluation we confirm the applicability of the adapted methods to 45 languages.",
"cite_spans": [
{
"start": 89,
"end": 111,
"text": "(Davidov et al., 2007;",
"ref_id": "BIBREF5"
},
{
"start": 112,
"end": 138,
"text": "Pasca and Van Durme, 2008)",
"ref_id": "BIBREF22"
},
{
"start": 369,
"end": 398,
"text": "(Davidov and Rappoport, 2006;",
"ref_id": "BIBREF4"
},
{
"start": 399,
"end": 420,
"text": "Davidov et al., 2007;",
"ref_id": "BIBREF5"
},
{
"start": 421,
"end": 450,
"text": "Davidov and Rappoport, 2008a;",
"ref_id": "BIBREF6"
},
{
"start": 451,
"end": 480,
"text": "Davidov and Rappoport, 2008b)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "Our study is related to cross-language information retrieval (CLIR/CLEF) frameworks. Both deal with information extracted from a set of languages. However, the majority of CLIR studies pursue different targets. One of the main CLIR goals is the retrieval of documents based on explicit queries, when the document language is not the query language (Volk and Buitelaar, 2002) . These frameworks usually develop language-specific tools and algorithms including parsers, taggers and morphology analyzers in order to integrate multilingual queries and documents (Jagarlamudi and Kumaran, 2007) . Our goal is to develop and evaluate a languageindependent method for the translation and extension of lexical categories. While our goals are different from CLIR, CLIR systems can greatly benefit from our framework, since our translated categories can be directly utilized for subsequent document retrieval.",
"cite_spans": [
{
"start": 348,
"end": 374,
"text": "(Volk and Buitelaar, 2002)",
"ref_id": "BIBREF26"
},
{
"start": 558,
"end": 589,
"text": "(Jagarlamudi and Kumaran, 2007)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "Another field indirectly related to our research is Machine Translation (MT). Many MT tasks require automated creation or improvement of dictionaries (Koehn and Knight, 2001 ). However, MT mainly deals with translation and disambiguation of words at the sentence or document level, while we translate whole concepts defined inde-pendently of contexts. Our primary target is not translation of given words, but the discovery and extension of a concept in a target language when the concept definition is given in some different source language.",
"cite_spans": [
{
"start": 150,
"end": 173,
"text": "(Koehn and Knight, 2001",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "Our framework has three main stages: (1) given a set of words in a source language as definition for some concept, we automatically translate them to the target language with multilingual dictionaries, disambiguating translations using web counts;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-lingual Concept Translation Framework",
"sec_num": "3"
},
{
"text": "(2) we retrieve from the web snippets where these translations co-appear;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-lingual Concept Translation Framework",
"sec_num": "3"
},
{
"text": "(3) we apply a patternbased concept extension algorithm for discovering additional terms from the retrieved data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cross-lingual Concept Translation Framework",
"sec_num": "3"
},
{
"text": "We start from a set of words denoting a category in a source language. Thus we may use words like (apple, banana, ...) as the definition of fruits or (bear, wolf, fox, ...) as the definition of wild animals 2 . Each of these words can be ambiguous. Multilingual dictionaries usually provide many translations, one or more for each sense. We need to select the appropriate translation for each term. In practice, some or even most of the category terms may be absent in available dictionaries. In these cases, we attempt to extract \"chain\" translations, i.e., if we cannot find Source\u2192Target translation, we can still find some indirect Source\u2192Intermediate1\u2192Intermediate2\u2192Target paths. Such translations are generally much more ambiguous, hence we allow up to two intermediate languages in a chain. We collect all possible translations at the chains having minimal length, and skip category terms for whom this process results in no translations. Then we use the conjecture that terms of the same concept tend to co-appear more frequently than ones belonging to different concepts 3 . Thus, we select a translation of a term co-appearing most frequently with some translation of a different term of the same concept. We estimate how well translations of different terms are connected to each other. Let C = {C i } be the given seed words for some concept. Let T r(C i , n) be the n-th available translation of word C i and Cnt(s) denote the web count of string s obtained by a search engine. Then we select translation T r(C i ) according to:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Concept words and sense selection",
"sec_num": "3.1"
},
{
"text": "F (w1, w2) = Cnt(\"w1 * w2\") \u00d7 Cnt(\"w2 * w1\") Cnt(w1) \u00d7 Cnt(w2) T r(Ci) = argmax si max s j j =i (F (T r(Ci, si), T r(Cj, sj)))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Concept words and sense selection",
"sec_num": "3.1"
},
{
"text": "We utilize the Y ahoo! \"x * y\" wildcard that allows to count only co-appearances where x and y are separated by a single word. As a result, we obtain a set of disambiguated term translations. The number of queries in this stage depends on the ambiguity of concept terms translation to the target language. Unlike many existing disambiguation methods based on statistics obtained from parallel corpora, we take a rather simplistic query-based approach. This approach is powerful (as shown in our evaluation) and only relies on a few web queries in a language independent manner.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Concept words and sense selection",
"sec_num": "3.1"
},
{
"text": "We need to restrict web mining to specific target languages. This restriction is straightforward if the alphabet or term translations are languagespecific or if the search API supports restriction to this language 4 . In case where there are no such natural restrictions, we attempt to detect and add to our queries a few language-specific frequent words. Using our dictionaries, we find 1-3 of the 15 most frequent words in a desired language that are unique to that language, and we 'and' them with the queries to ensure selection of the proper language. While some languages as Esperanto do not satisfy any of these requirements, more than 60 languages do.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Web mining for translation contexts",
"sec_num": "3.2"
},
{
"text": "For each pair A, B of disambiguated term translations, we construct and execute the following 2 queries: {\"A * B\", \"B * A\"} 5 . When we have 3 or more terms we also add {A B C . . .}-like conjunction queries which include 3-5 terms. For languages with Lim mwe > 1, we also construct queries with several \"*\" wildcards between terms. For each query we collect snippets containing text fragments of web pages. Such snippets frequently include the search terms. Since Y ahoo! allows retrieval of up to the 1000 first results (100 in each query), we collect several thousands snippets. For most of the target languages and categories, only a few dozen queries (20 on the average) are required to obtain sufficient data. Thus the relevant data can be downloaded in seconds. This makes our approach practical for on-demand retrieval tasks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Web mining for translation contexts",
"sec_num": "3.2"
},
{
"text": "First we extract from the retrieved snippets contexts where translated terms co-appear, and detect patterns where they co-appear symmetrically. Then we use the detected patterns to discover additional concept terms. In order to define word boundaries, for each target language we manually specify boundary characters such as punctuation/space symbols. This data, along with dictionaries, is the only language-specific data in our framework.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Pattern-based extension of concept terms",
"sec_num": "3.3"
},
{
"text": "Following (Davidov et al., 2007) we seek symmetric patterns to retrieve concept terms. We use two meta-pattern types. First, a Two-Slot pattern type constructed as follows:",
"cite_spans": [
{
"start": 10,
"end": 32,
"text": "(Davidov et al., 2007)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Meta-patterns",
"sec_num": "3.3.1"
},
{
"text": "[P ref ix] C 1 [Inf ix] C 2 [P ostf ix]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Meta-patterns",
"sec_num": "3.3.1"
},
{
"text": "C i are slots for concept terms. We allow up to Lim mwe space-separated 6 words to be in a single slot. Infix may contain punctuation, spaces, and up to Lim mwe \u00d7 4 words. Prefix and Postfix are limited to contain punctuation characters and/or Lim mwe words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Meta-patterns",
"sec_num": "3.3.1"
},
{
"text": "Terms of the same concept frequently co-appear in lists. To utilize this, we introduce two additional List pattern types 7 :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Meta-patterns",
"sec_num": "3.3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "[P ref ix] C 1 [Inf ix] (C i [Inf ix])+ (1) [Inf ix] (C i [Inf ix])+ C n [P ostf ix]",
"eq_num": "(2)"
}
],
"section": "Meta-patterns",
"sec_num": "3.3.1"
},
{
"text": "As in (Widdows and Dorow, 2002; Davidov and Rappoport, 2006) , we define a pattern graph. Nodes correspond to terms and patterns to edges. If term pair (w 1 , w 2 ) appears in pattern P , we add nodes N w 1 , N w 2 to the graph and a directed edge",
"cite_spans": [
{
"start": 6,
"end": 31,
"text": "(Widdows and Dorow, 2002;",
"ref_id": "BIBREF27"
},
{
"start": 32,
"end": 60,
"text": "Davidov and Rappoport, 2006)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Meta-patterns",
"sec_num": "3.3.1"
},
{
"text": "E P (N w 1 , N w 2 ) between them.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Meta-patterns",
"sec_num": "3.3.1"
},
{
"text": "We consider only symmetric patterns. We define a symmetric pattern as a pattern where some category terms C i , C j appear both in left-to-right and right-to-left order. For example, if we consider the terms {apple, pineapple} we select a List pattern \"(one C i , )+ and C n .\" if we find both \"one apple, one pineapple, one guava and orange.\" and \"one watermelon, one pineapple and apple.\". If no such patterns are found, we turn to a weaker definition, considering as symmetric those patterns where the same terms appear in the corpus in at least two different slots. Thus, we select a pattern \"for C 1 and C 2 \" if we see both \"for apple and guava,\" and \"for orange and apple,\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Symmetric patterns",
"sec_num": "3.3.2"
},
{
"text": "We collect terms in two stages. First, we obtain \"high-quality\" core terms and then we retrieve potentially more noisy ones. In the first stage we collect all terms 8 that are bidirectionally connected to at least two different original translations, and call them core concept terms C core . We also add the original ones as core terms. Then we detect the rest of the terms C rest that appear with more different C core terms than with 'out' (non-core) terms as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retrieving concept terms",
"sec_num": "3.3.3"
},
{
"text": "G in (c)={w\u2208C core |E(N w , N c ) \u2228 E(N c , N w )} G out (c)={w / \u2208C core |E(N w , N c ) \u2228 E(N c , N w )} C rest ={c| |G in (c)|>|G out (c)| } where E(N a , N b )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retrieving concept terms",
"sec_num": "3.3.3"
},
{
"text": "correspond to existence of a graph edge denoting that translated terms a and b co-appear in a pattern in this order. Our final term set is the union of C core and C rest .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retrieving concept terms",
"sec_num": "3.3.3"
},
{
"text": "For the sake of simplicity, unlike in the majority of current research, we do not attempt to discover more patterns/instances iteratively by reexamining the data or re-querying the web. If we have enough data, we use windowing to improve result quality. If we obtain more than 400 snippets for some concept, we randomly divide the data into equal parts, each containing up to 400 snippets. We apply our algorithm independently to each part and select only the words that appear in more than one part.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retrieving concept terms",
"sec_num": "3.3.3"
},
{
"text": "We describe here the languages, concepts and dictionaries we used in our experiments. 8 We do not consider as terms the 50 most frequent words.",
"cite_spans": [
{
"start": 86,
"end": 87,
"text": "8",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "One of the main goals in this research is to verify that the proposed basic method can be applied to different languages unmodified. We examined a wide variety of languages and concepts. Table 3 shows a list of 45 languages used in our experiments, including west European languages, Slavic languages, Semitic languages, and diverse Asian languages.",
"cite_spans": [],
"ref_spans": [
{
"start": 187,
"end": 195,
"text": "Table 3",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Languages and categories",
"sec_num": "4.1"
},
{
"text": "Our concept set was based on English WN synsets, while concept definitions for evaluation were based on WN glosses. For automated evaluation we selected as categories 150 synsets/subtrees with at least 10 single-word terms in them. For manual evaluation we used a subset of 24 of these categories. In this subset we tried to select generic categories, such that no domain expert knowledge was required to check their correctness.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Languages and categories",
"sec_num": "4.1"
},
{
"text": "Ten of these categories were equal to ones used in (Widdows and Dorow, 2002; Davidov and Rappoport, 2006) , which allowed us to indirectly compare to recent work. Table 1 shows these 10 concepts along with the sample terms. While the number of tested categories is still modest, it provides a good indication for the quality of our approach. ",
"cite_spans": [
{
"start": 51,
"end": 76,
"text": "(Widdows and Dorow, 2002;",
"ref_id": "BIBREF27"
},
{
"start": 77,
"end": 105,
"text": "Davidov and Rappoport, 2006)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 163,
"end": 170,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Languages and categories",
"sec_num": "4.1"
},
{
"text": "We developed a set of tools for automatic access to several dictionaries. We used Wikipedia crosslanguage links as our main source (60%) for offline translation. These links include translation of Wikipedia terms into dozens of languages. The main advantage of using Wikipedia is its wide coverage of concepts and languages. However, one problem in using it is that it frequently encodes too specific senses and misses common ones. Thus bear is translated as family Ursidae missing its common \"wild animal\" sense. To overcome these difficulties, we also used Wiktionary and complemented these offline resources with a few automated queries to several (20) online dictionaries. We start with Wikipedia definitions, then if not found, Wiktionary, and then we turn to online dictionaries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Multilingual dictionaries",
"sec_num": "4.2"
},
{
"text": "While there are numerous concept acquisition studies, no framework has been developed so far to evaluate this type of cross-lingual concept discovery, limiting our ability to perform a meaningful comparison to previous work. Fair estimation of translated concept quality is a challenging task. For most languages there are no widely accepted concept databases. Moreover, the contents of the same concept may vary across languages. Fortunately, when English is taken as a target language, the English WN allows an automated evaluation of concepts. We conducted evaluation in three different settings, mostly relying on human judges and utilizing the English WN where possible.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation and Results",
"sec_num": "5"
},
{
"text": "1. English as source language. We applied our algorithm on a subset of 24 categories using each of the 45 languages as a target language. Evaluation is done by two judges 9 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation and Results",
"sec_num": "5"
},
{
"text": "2. English as target language. All other languages served as source languages. In this case human subjects manually provided input terms for 150 concept definitions in each of the target languages using 150 selected English WN glosses. For each gloss they were requested to provide at least 2 terms. Then we ran the algorithm on these term lists. Since the obtained results were English words, we performed both manual evaluation of the 24 categories and automated comparison to the original WN data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation and Results",
"sec_num": "5"
},
{
"text": "3. Language pairs. We created 10 different non-English language pairs for the 24 concepts. Concept definitions were the same as in (2) and manual evaluation followed the same protocol as in (1).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation and Results",
"sec_num": "5"
},
{
"text": "The absence of exhaustive term lists makes recall estimation problematic. In all cases we assess the quality of the discovered lists in terms of precision (P ) and length of retrieved lists (T ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation and Results",
"sec_num": "5"
},
{
"text": "Each discovered concept was evaluated by two judges. All judges were fluent English speakers and for each target language, at least one was a fluent speaker of this language. They were given oneline English descriptions of each category and the full lists obtained by our algorithm for each of the 24 concepts. Table 2 shows the lists obtained by our algorithm for the category described as Relatives (e.g., grandmother) for several language pairs including Hebrew\u2192French and Chinese\u2192Czech. We mixed \"noise\" words into each list of terms 10 . These words were automatically and randomly extracted from the same text. Subjects were required to select all words fitting the provided description. They were unaware of algorithm details and desired results. They were instructed to accept common abbreviations, alternative spellings or misspellings like yelow\u2208color and to accept a term as belonging to a category if at least one of its senses belongs to it, like orange\u2208color and orange\u2208fruit. They were asked to reject terms related or associated but not belonging to the target category, like tasty / \u2208food, or that are too general, like animal / \u2208dogs. The first 4 columns of Table 3 show averaged results of manual evaluation for 24 categories. In the first two columns English is used as a source language and in the next pair of columns English is used as the target. In addition we display in parentheses the amount of terms added during the extension stage. We can see that for all languages, average precision (% of correct terms in concept) is above 80, and frequently above 90, and the average number of extracted terms is above 30. Internal concept quality is in line with values observed on similarly evaluated tasks for recent concept acquisition studies in English. As a baseline, only 3% of the inserted 20-40% noise words were incorrectly labeled by judges. Due to space limitation we do not show the full per-concept behavior; all medians for P and T were close to the average.",
"cite_spans": [],
"ref_spans": [
{
"start": 311,
"end": 318,
"text": "Table 2",
"ref_id": "TABREF2"
},
{
"start": 1176,
"end": 1183,
"text": "Table 3",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Manual evaluation",
"sec_num": "5.1"
},
{
"text": "We can also observe that the majority (> 60%) of target language terms were obtained during the extension stage. Thus, even when considering translation from a rich language such as English (where given concepts frequently contain dozens of terms), most of the discovered target language terms are not discovered through translation but English\u2192Portuguese: afilhada,afilhado,amigo,av\u00f3,av\u00f4,bisav\u00f3,bisav\u00f4, bisneta,bisneto,c\u00f4njuge,cunhada,cunhado,companheiro, descendente,enteado,filha,filho,irm\u00e3,irm\u00e3o,irm\u00e3os,irm\u00e3s, madrasta,madrinha,m\u00e3e,marido,mulher,namorada, namorado,neta,neto,noivo,padrasto,pai,papai,parente, prima,primo,sogra,sogro,sobrinha,sobrinho,tia,tio,vizinho Hebrew\u2192French: amant,ami,amie,amis,arri\u00e8re-grand-m\u00e8re, arri\u00e8re-grand-p\u00e8re,beau-fr\u00e8re,beau-parent,beau-p\u00e8re,bebe, belle-fille,belle-m\u00e8re,belle-soeur,b\u00e8b\u00e8,compagnon, concubin,conjoint,cousin,cousine,demi-fr\u00e8re,demi-soeur, epouse,\u00e9poux,enfant,enfants,famille,femme,fille,fils,foyer, fr\u00e8re,garcon,grand-m\u00e8re,grand-parent,grand-p\u00e8re, grands-parents,maman,mari,m\u00e8re,neveu,ni\u00e8ce,oncle, papa,parent,p\u00e8re,petit-enfant,petit-fils,soeur,tante English\u2192Spanish: abuela,abuelo,amante,amiga,amigo,confidente,bisabuelo, cu\u00f1ada,cu\u00f1ado,c\u00f3nyuge,esposa,esposo,esp\u00edritu,familia, familiar,hermana,hermano,hija,hijo,hijos,madre,marido, mujer,nieta,nieto,ni\u00f1o, novia,padre,pap\u00e1,primo,sobrina, sobrino,suegra,suegro,t\u00eda,t\u00edo,tutor, viuda,viudo Chinese\u2192Czech: babi\u010dka,bratr,br\u00e1cha,chlapec,dcera,d\u011bda,d\u011bde\u010dek,druh, kamar\u00e1d,kamar\u00e1dka,mama,man\u017eel,man\u017eelka,matka, mu\u017e,otec,podnajemnik,p\u0159\u00edtelkyn\u011b, sestra,star\u0161\u00ed,str\u00fdc, str\u00fd\u010dek, syn,s\u00e9gra,tch\u00e1n,tchyn\u011b,teta,vnuk,vnu\u010dka,\u017eena during the subsequent concept extension. In fact, brief examination shows that less than half of source language terms successfully pass translation and disambiguation stage. However, more than 80% of terms which were skipped due to lack of available translations were re-discovered in the target language during the extension stage, along with the discovery of new correct terms not existing in the given source definition.",
"cite_spans": [
{
"start": 337,
"end": 670,
"text": "English\u2192Portuguese: afilhada,afilhado,amigo,av\u00f3,av\u00f4,bisav\u00f3,bisav\u00f4, bisneta,bisneto,c\u00f4njuge,cunhada,cunhado,companheiro, descendente,enteado,filha,filho,irm\u00e3,irm\u00e3o,irm\u00e3os,irm\u00e3s, madrasta,madrinha,m\u00e3e,marido,mulher,namorada, namorado,neta,neto,noivo,padrasto,pai,papai,parente, prima,primo,sogra,sogro,sobrinha,sobrinho,tia,tio,vizinho",
"ref_id": null
},
{
"start": 1000,
"end": 1611,
"text": "grands-parents,maman,mari,m\u00e8re,neveu,ni\u00e8ce,oncle, papa,parent,p\u00e8re,petit-enfant,petit-fils,soeur,tante English\u2192Spanish: abuela,abuelo,amante,amiga,amigo,confidente,bisabuelo, cu\u00f1ada,cu\u00f1ado,c\u00f3nyuge,esposa,esposo,esp\u00edritu,familia, familiar,hermana,hermano,hija,hijo,hijos,madre,marido, mujer,nieta,nieto,ni\u00f1o, novia,padre,pap\u00e1,primo,sobrina, sobrino,suegra,suegro,t\u00eda,t\u00edo,tutor, viuda,viudo Chinese\u2192Czech: babi\u010dka,bratr,br\u00e1cha,chlapec,dcera,d\u011bda,d\u011bde\u010dek,druh, kamar\u00e1d,kamar\u00e1dka,mama,man\u017eel,man\u017eelka,matka, mu\u017e,otec,podnajemnik,p\u0159\u00edtelkyn\u011b, sestra,star\u0161\u00ed,str\u00fdc, str\u00fd\u010dek, syn,s\u00e9gra,tch\u00e1n,tchyn\u011b,teta,vnuk,vnu\u010dka,\u017eena",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Manual evaluation",
"sec_num": "5.1"
},
{
"text": "The first two columns of Table 4 show similar results for non-English language pairs. We can see that these results are only slightly inferior to the ones involving English.",
"cite_spans": [],
"ref_spans": [
{
"start": 25,
"end": 32,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Manual evaluation",
"sec_num": "5.1"
},
{
"text": "We applied our algorithm on 150 concepts with English used as the target language. Since we want to consider common misspellings and morphological combinations of correct terms as hits, we used a basic speller and stemmer to resolve typos and drop some English endings. The WN columns in Table 3 display P and T values for this evaluation. In most cases we obtain > 85% precision. While these results (P=87,T=17) are lower than in manual evaluation, the task is much harder due to the large number (and hence sparseness) of the utilized 150 WN categories and the incomplete nature of WN data. For the 10 categories of Table 1 used in previous work, we have obtained (P=92,T=41 ) which outperforms the seed-based concept acquisition of (Widdows and Dorow, 2002; Davidov and Rappoport, 2006) (P=90,T=35) on the same concepts. However, it should be noted that our task setting is substantially different since we utilize more seeds and they come from languages different from English.",
"cite_spans": [
{
"start": 736,
"end": 761,
"text": "(Widdows and Dorow, 2002;",
"ref_id": "BIBREF27"
},
{
"start": 762,
"end": 790,
"text": "Davidov and Rappoport, 2006)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 288,
"end": 295,
"text": "Table 3",
"ref_id": "TABREF4"
},
{
"start": 618,
"end": 677,
"text": "Table 1 used in previous work, we have obtained (P=92,T=41",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "WordNet based evaluation",
"sec_num": "5.2"
},
{
"text": "The first stage in our framework heavily relies on the existence and quality of dictionaries, whose coverage may be insufficient. In order to check the effect of dictionary coverage on our task, we re-evaluated 10 language pairs using reduced dictionaries containing only the 1000 most frequent words. The last columns in Table 4 show evaluation results for such reduced dictionaries. Surprisingly, while we see a difference in coverage and precision, this difference is below 8%, thus even basic 1000-word dictionaries may be useful for some applications. This may suggest that only a few correct translations are required for successful discovery of the corresponding category. Hence, even a small dictionary containing translations of the most frequent terms could be enough. In order to test this hypothesis, we re-evaluated the 10 language pairs using full dictionaries while reducing the initial concept definition to the 3 most frequent words. The results of this experiment are shown at columns 3-4 of Table 4 . We can see that for most language pairs, 3 seeds were sufficient to achieve equally good results, and providing more extensive concept definitions had little effect on performance.",
"cite_spans": [],
"ref_spans": [
{
"start": 322,
"end": 329,
"text": "Table 4",
"ref_id": null
},
{
"start": 1010,
"end": 1017,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Effect of dictionary size and source category size",
"sec_num": "5.3"
},
{
"text": "We obtained high precision. However, we also observed high variance in the number of terms between different language pairs for the same concept. There are many possible reasons for this outcome. Below we briefly discuss some of them; detailed analysis of inter-language and inter-concept variance is a major target for future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Variance analysis",
"sec_num": "5.4"
},
{
"text": "Web coverage of languages is not uniform (Paolillo et al., 2005) ; e.g. Georgian has much less web hits than English. Indeed, we observed a correlation between reported web coverage and the number of retrieved terms. Concept coverage and Table 4 : Results for non-English pairs. P: precision, T: number of terms. \" [xx] \": number of terms added in the extension stage. Columns 1-2 show results for normal experiment settings, 3-4 show data for experiments where the 3 most frequent terms were used as concept definitions, 5-6 describe results for experiment with 1000-word dictionaries.",
"cite_spans": [
{
"start": 41,
"end": 64,
"text": "(Paolillo et al., 2005)",
"ref_id": "BIBREF20"
},
{
"start": 315,
"end": 319,
"text": "[xx]",
"ref_id": null
}
],
"ref_spans": [
{
"start": 238,
"end": 245,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Variance analysis",
"sec_num": "5.4"
},
{
"text": "Swedish while Rickshaw appears in Hindi.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Variance analysis",
"sec_num": "5.4"
},
{
"text": "Morphology was completely neglected in this research. To co-appear in a text, terms frequently have to be in a certain form different from that shown in dictionaries. Even in English, plurals like spoons, forks co-appear more than spoon, fork. Hence dictionaries that include morphology may greatly improve the quality of our framework. We have conducted initial experiments with promising results in this direction, but we do not report them here due to space limitations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Variance analysis",
"sec_num": "5.4"
},
{
"text": "We proposed a framework that when given a set of terms for a category in some source language uses dictionaries and the web to retrieve a similar category in a desired target language. We showed that the same pattern-based method can successfully extend dozens of different concepts for many languages with high precision. We observed that even when we have very few ambiguous translations available, the target language concept can be discovered in a fast and precise manner without relying on any language-specific preprocessing, databases or parallel corpora. The average concept total processing time, including all web requests, was below 2 minutes 11 . The short running time and the absence of language-specific requirements allow processing queries within minutes and makes it possible to apply our method to on-demand cross-language concept mining.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "6"
},
{
"text": "http://www.internetworldstats.com/stats7.htm",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "In order to reduce noise, we limit the length (in words) of multiword expressions considered as terms. To calculate this limit for a language we randomly take 100 terms from the appropriate dictionary and set a limit as Limmwe = round(avg(length(w))) where length(w) is the number of words in term w. For languages like Chinese without inherent word segmentation, length(w) is the number of characters in w. While for many languages Limmwe = 1, some languages like Vietnamese usually require two words or more to express terms.3 Our results in this paper support this conjecture.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Yahoo! allows restrictions for 42 languages.5 These are Yahoo! queries where enclosing words in \"\" means searching for an exact phrase and \"*\" means a wildcard for exactly one arbitrary word.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "As before, for languages without explicit space-based word separation Limmwe limits the number of characters instead.7 (X)+ means one or more instances of X.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For 19 of the languages, at least one judge was a native speaker. For other languages at least one of the subjects was fluent with this language.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "To reduce annotator bias, we used a different number of noise words, adding 20-40% of the original number of words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We used a single PC with ADSL internet connection.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Automatic Construction of Turkish WordNet",
"authors": [
{
"first": "M",
"middle": [
"Fatih"
],
"last": "Amasyali",
"suffix": ""
}
],
"year": 2005,
"venue": "Signal Processing and Communications Applications Conference",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "M. Fatih Amasyali, 2005. Automatic Construction of Turkish WordNet. Signal Processing and Commu- nications Applications Conference.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Automatic Construction of a Hypernym-Labeled Noun Hierarchy from Text",
"authors": [
{
"first": "Sharon",
"middle": [],
"last": "Caraballo",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sharon Caraballo, 1999. Automatic Construction of a Hypernym-Labeled Noun Hierarchy from Text. ACL '99.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Semi-Automatic Compilation of Asian WordNet. Proceedings of the 14th NLP-2008",
"authors": [
{
"first": "Thatsanee",
"middle": [],
"last": "Charoenporn",
"suffix": ""
},
{
"first": "Virach",
"middle": [],
"last": "Sornlertlamvanich",
"suffix": ""
},
{
"first": "Chumpol",
"middle": [],
"last": "Mokarat",
"suffix": ""
},
{
"first": "Hitoshi",
"middle": [],
"last": "Isahara",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thatsanee Charoenporn, Virach Sornlertlamvanich, Chumpol Mokarat, Hitoshi Isahara, 2008. Semi- Automatic Compilation of Asian WordNet. Pro- ceedings of the 14th NLP-2008, University of Tokyo, Komaba Campus, Japan.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Automatic Thesaurus Extraction. SIGLEX '02",
"authors": [
{
"first": "James",
"middle": [
"R"
],
"last": "Curran",
"suffix": ""
},
{
"first": "Marc",
"middle": [],
"last": "Moens",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "59--66",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "James R. Curran, Marc Moens, 2002. Improvements in Automatic Thesaurus Extraction. SIGLEX '02, 59-66.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Efficient Unsupervised Discovery of Word Categories Using Symmetric Patterns and High Frequency Words. COLING-ACL '06",
"authors": [
{
"first": "Dmitry",
"middle": [],
"last": "Davidov",
"suffix": ""
},
{
"first": "Ari",
"middle": [],
"last": "Rappoport",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dmitry Davidov, Ari Rappoport, 2006. Efficient Unsupervised Discovery of Word Categories Us- ing Symmetric Patterns and High Frequency Words. COLING-ACL '06.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Fully Unsupervised Discovery of Concept-Specific Relationships by Web Mining",
"authors": [
{
"first": "Dmitry",
"middle": [],
"last": "Davidov",
"suffix": ""
},
{
"first": "Ari",
"middle": [],
"last": "Rappoport",
"suffix": ""
},
{
"first": "Moshe",
"middle": [],
"last": "Koppel",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dmitry Davidov, Ari Rappoport, Moshe Koppel, 2007. Fully Unsupervised Discovery of Concept-Specific Relationships by Web Mining. ACL '07.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Unsupervised Discovery of Generic Relationships Using Pattern Clusters and its Evaluation by Automatically Generated SAT Analogy Questions",
"authors": [
{
"first": "Dmitry",
"middle": [],
"last": "Davidov",
"suffix": ""
},
{
"first": "Ari",
"middle": [],
"last": "Rappoport",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dmitry Davidov, Ari Rappoport, 2008a. Unsupervised Discovery of Generic Relationships Using Pattern Clusters and its Evaluation by Automatically Gen- erated SAT Analogy Questions. ACL '08.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Classification of Semantic Relationships between Nominals Using Pattern Clusters",
"authors": [
{
"first": "Dmitry",
"middle": [],
"last": "Davidov",
"suffix": ""
},
{
"first": "Ari",
"middle": [],
"last": "Rappoport",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dmitry Davidov, Ari Rappoport, 2008b. Classification of Semantic Relationships between Nominals Using Pattern Clusters. ACL '08.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Indexing by Latent Semantic Analysis",
"authors": [
{
"first": "Scott",
"middle": [],
"last": "Deerwester",
"suffix": ""
},
{
"first": "Susan",
"middle": [],
"last": "Dumais",
"suffix": ""
},
{
"first": "George",
"middle": [],
"last": "Furnas",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Landauer",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Harshman",
"suffix": ""
}
],
"year": 1990,
"venue": "Journal of the American Society for Info. Science",
"volume": "41",
"issue": "6",
"pages": "391--407",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Scott Deerwester, Susan Dumais, George Furnas, Thomas Landauer, Richard Harshman, 1990. In- dexing by Latent Semantic Analysis. Journal of the American Society for Info. Science, 41(6):391-407.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Using Curvature and Markov Clustering in Graphs for Lexical Acquisition and Word Sense Discrimination",
"authors": [
{
"first": "Beate",
"middle": [],
"last": "Dorow",
"suffix": ""
},
{
"first": "Dominic",
"middle": [],
"last": "Widdows",
"suffix": ""
},
{
"first": "Katarina",
"middle": [],
"last": "Ling",
"suffix": ""
},
{
"first": "Jean-Pierre",
"middle": [],
"last": "Eckmann",
"suffix": ""
},
{
"first": "Danilo",
"middle": [],
"last": "Sergi",
"suffix": ""
},
{
"first": "Elisha",
"middle": [],
"last": "Moses",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Beate Dorow, Dominic Widdows, Katarina Ling, Jean- Pierre Eckmann, Danilo Sergi, Elisha Moses, 2005. Using Curvature and Markov Clustering in Graphs for Lexical Acquisition and Word Sense Discrimi- nation. MEANING '05.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Unsupervised Named-Entity Extraction from the Web: An Experimental Study",
"authors": [
{
"first": "Oren",
"middle": [],
"last": "Etzioni",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Cafarella",
"suffix": ""
},
{
"first": "Doug",
"middle": [],
"last": "Downey",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Kok",
"suffix": ""
},
{
"first": "Ana-Maria",
"middle": [],
"last": "Popescu",
"suffix": ""
},
{
"first": "Tal",
"middle": [],
"last": "Shaked",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Soderland",
"suffix": ""
},
{
"first": "Daniel",
"middle": [
"S"
],
"last": "Weld",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Yates",
"suffix": ""
}
],
"year": 2005,
"venue": "Artificial Intelligence",
"volume": "165",
"issue": "1",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oren Etzioni, Michael Cafarella, Doug Downey, S. Kok, Ana-Maria Popescu, Tal Shaked, Stephen Soderland, Daniel S. Weld, Alexander Yates, 2005. Unsupervised Named-Entity Extraction from the Web: An Experimental Study. Artificial Intelli- gence, 165(1):91134.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Trained Named Entity Recognition Using Distributional lusters",
"authors": [
{
"first": "Dayne",
"middle": [],
"last": "Freitag",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dayne Freitag, 2004. Trained Named Entity Recogni- tion Using Distributional lusters. EMNLP '04.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Scaling Distributional Similarity to Large Corpora COLING-ACL '06",
"authors": [
{
"first": "James",
"middle": [],
"last": "Gorman",
"suffix": ""
},
{
"first": "James",
"middle": [
"R"
],
"last": "Curran",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "James Gorman , James R. Curran, 2006. Scaling Dis- tributional Similarity to Large Corpora COLING- ACL '06.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Automatic Acquisition of Hyponyms from Large Text Corpora",
"authors": [
{
"first": "Marti",
"middle": [],
"last": "Hearst",
"suffix": ""
}
],
"year": 1992,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marti Hearst, 1992. Automatic Acquisition of Hy- ponyms from Large Text Corpora. COLING '92.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Cross-Lingual Information Retrieval System for Indian Languages Working Notes for the CLEF",
"authors": [
{
"first": "Jagadeesh",
"middle": [],
"last": "Jagarlamudi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kumaran",
"suffix": ""
}
],
"year": 2007,
"venue": "Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jagadeesh Jagarlamudi, A Kumaran, 2007. Cross- Lingual Information Retrieval System for Indian Languages Working Notes for the CLEF 2007 Work- shop.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Knowledge Sources for Word-Level Translation Models",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn, Kevin Knight, 2001. Knowl- edge Sources for Word-Level Translation Models. EMNLP '01.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Automatic Retrieval and Clustering of Similar Words",
"authors": [
{
"first": "Dekang",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dekang Lin, 1998. Automatic Retrieval and Cluster- ing of Similar Words. COLING '98.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Discovering Word Senses from Text",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Pantel",
"suffix": ""
},
{
"first": "Dekang",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Patrick Pantel, Dekang Lin, 2002. Discovering Word Senses from Text. SIGKDD '02.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Towards Terascale Knowledge Acquisition. COLING '04",
"authors": [
{
"first": "Patrick",
"middle": [],
"last": "Pantel",
"suffix": ""
},
{
"first": "Deepak",
"middle": [],
"last": "Ravichandran",
"suffix": ""
},
{
"first": "Eduard",
"middle": [],
"last": "Hovy",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Patrick Pantel, Deepak Ravichandran, Eduard Hovy, 2004. Towards Terascale Knowledge Acquisition. COLING '04.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Measuring Linguistic Diversity on the Internet",
"authors": [
{
"first": "John",
"middle": [],
"last": "Paolillo",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Pimienta",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Prado",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "John Paolillo, Daniel Pimienta, Daniel Prado, et al., 2005. Measuring Linguistic Diversity on the In- ternet. UNESCO Institute for Statistics Montreal, Canada.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Names and Similarities on the Web: Fact Extraction in the Fast Lane",
"authors": [
{
"first": "Marius",
"middle": [],
"last": "Pasca",
"suffix": ""
},
{
"first": "Dekang",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Bigham",
"suffix": ""
},
{
"first": "Andrei",
"middle": [],
"last": "Lifchits",
"suffix": ""
},
{
"first": "Alpa",
"middle": [],
"last": "Jain",
"suffix": ""
}
],
"year": 2006,
"venue": "COLING-ACL '06",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marius Pasca, Dekang Lin, Jeffrey Bigham, Andrei Lifchits, Alpa Jain, 2006. Names and Similari- ties on the Web: Fact Extraction in the Fast Lane. COLING-ACL '06.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Weakly-Supervised Acquisition of Open-Domain Classes and Class Attributes from Web Documents and Query Logs",
"authors": [
{
"first": "Marius",
"middle": [],
"last": "Pasca",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [],
"last": "Van Durme",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marius Pasca, Benjamin Van Durme, 2008. Weakly- Supervised Acquisition of Open-Domain Classes and Class Attributes from Web Documents and Query Logs. ACL '08.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Building the Global WordNet Grid",
"authors": [
{
"first": "Adam",
"middle": [],
"last": "Pease",
"suffix": ""
},
{
"first": "Christiane",
"middle": [],
"last": "Fellbaum",
"suffix": ""
},
{
"first": "Piek",
"middle": [],
"last": "Vossen",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "18",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adam Pease, Christiane Fellbaum, Piek Vossen, 2008. Building the Global WordNet Grid. CIL18.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Distributional Clustering of English Words. ACL '93",
"authors": [
{
"first": "Fernando",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "Naftali",
"middle": [],
"last": "Tishby",
"suffix": ""
},
{
"first": "Lillian",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 1993,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fernando Pereira, Naftali Tishby, Lillian Lee, 1993. Distributional Clustering of English Words. ACL '93.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Learning Dictionaries for Information Extraction by Multi-Level Bootstrapping",
"authors": [
{
"first": "Ellen",
"middle": [],
"last": "Riloff",
"suffix": ""
},
{
"first": "Rosie",
"middle": [],
"last": "Jones",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ellen Riloff, Rosie Jones, 1999. Learning Dictionar- ies for Information Extraction by Multi-Level Boot- strapping. AAAI '99.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "A Systematic Evaluation of Concept-Based Cross-Language Information Retrieval in the Medical Domain",
"authors": [
{
"first": "Martin",
"middle": [],
"last": "Volk",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Buitelaar",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. of 3rd Dutch-Belgian Information Retrieval Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Martin Volk, Paul Buitelaar, 2002. A Systematic Eval- uation of Concept-Based Cross-Language Informa- tion Retrieval in the Medical Domain. In: Proc. of 3rd Dutch-Belgian Information Retrieval Workshop. Leuven.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "A Graph Model for Unsupervised Lexical Acquisition",
"authors": [
{
"first": "Dominic",
"middle": [],
"last": "Widdows",
"suffix": ""
},
{
"first": "Beate",
"middle": [],
"last": "Dorow",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dominic Widdows, Beate Dorow, 2002. A Graph Model for Unsupervised Lexical Acquisition. COL- ING '02.",
"links": null
}
},
"ref_entries": {
"TABREF1": {
"type_str": "table",
"content": "<table/>",
"text": "10 of the selected categories with sample terms.",
"html": null,
"num": null
},
"TABREF2": {
"type_str": "table",
"content": "<table/>",
"text": "Sample of results for the Relatives concept. Note that precision is not 100% (e.g. the Portuguese set includes 'friend' and 'neighbor').",
"html": null,
"num": null
},
"TABREF4": {
"type_str": "table",
"content": "<table><tr><td>Language pair</td><td colspan=\"2\">Regular</td><td colspan=\"2\">Reduced</td><td colspan=\"2\">Reduced</td></tr><tr><td>Source-Target</td><td>data</td><td/><td/><td>seed</td><td/><td>dict.</td></tr><tr><td/><td>T[xx]</td><td>P</td><td>T</td><td>P</td><td>T</td><td>P</td></tr><tr><td>Hebrew-French</td><td colspan=\"2\">43[28] 89</td><td colspan=\"2\">39 90</td><td colspan=\"2\">35 87</td></tr><tr><td>Arabic-Hebrew</td><td colspan=\"2\">31[24] 90</td><td colspan=\"2\">25 94</td><td colspan=\"2\">29 82</td></tr><tr><td>Chinese-Czech</td><td colspan=\"2\">35[29] 85</td><td colspan=\"2\">33 84</td><td colspan=\"2\">25 75</td></tr><tr><td>Hindi-Russian</td><td colspan=\"2\">45[33] 89</td><td colspan=\"2\">45 87</td><td colspan=\"2\">38 84</td></tr><tr><td>Danish-Turkish</td><td colspan=\"2\">28[20] 88</td><td colspan=\"2\">24 88</td><td colspan=\"2\">24 80</td></tr><tr><td>Russian-Arabic</td><td colspan=\"2\">28[18] 87</td><td colspan=\"2\">19 91</td><td colspan=\"2\">22 86</td></tr><tr><td>Hebrew-Russian</td><td colspan=\"2\">45[31] 92</td><td colspan=\"2\">44 89</td><td colspan=\"2\">35 84</td></tr><tr><td>Thai-Hebrew</td><td colspan=\"2\">28[25] 90</td><td colspan=\"2\">26 92</td><td colspan=\"2\">23 78</td></tr><tr><td>Finnish-Arabic</td><td colspan=\"2\">21[11] 90</td><td colspan=\"2\">14 92</td><td colspan=\"2\">16 84</td></tr><tr><td>Greek-Russian</td><td colspan=\"2\">48[36] 89</td><td colspan=\"2\">47 87</td><td colspan=\"2\">35 81</td></tr><tr><td>Average</td><td colspan=\"2\">35[26] 89</td><td colspan=\"2\">32 89</td><td colspan=\"2\">28 82</td></tr></table>",
"text": "Concept translation and extension results. The first column shows the 45 tested languages. Bold are languages evaluated with at least one native speaker. P: precision, T: number of retrieved terms. \"[xx]\": number of terms added during the concept extension stage. Columns 1-4 show results for manual evaluation on 24 concepts. Columns 5-6 show automated WN-based evaluation on 150 concepts. For columns 1-2 the input category is given in English, in other columns English served as the target language.content is also different for each language. Thus, concepts involving fantasy creatures were found to have little coverage in Arabic and Hindi, and wide coverage in European languages. For vehicles, Snowmobile was detected in Finnish and",
"html": null,
"num": null
}
}
}
}