acl acl2013 acl2013-269 knowledge-graph by maker-knowledge-mining

269 acl-2013-PLIS: a Probabilistic Lexical Inference System

Source: pdf

Author: Eyal Shnarch ; Erel Segal-haLevi ; Jacob Goldberger ; Ido Dagan

Abstract: This paper presents PLIS, an open source Probabilistic Lexical Inference System which combines two functionalities: (i) a tool for integrating lexical inference knowledge from diverse resources, and (ii) a framework for scoring textual inferences based on the integrated knowledge. We provide PLIS with two probabilistic implementation of this framework. PLIS is available for download and developers of text processing applications can use it as an off-the-shelf component for injecting lexical knowledge into their applications. PLIS is easily configurable, components can be extended or replaced with user generated ones to enable system customization and further research. PLIS includes an online interactive viewer, which is a powerful tool for investigating lexical inference processes. 1 Introduction and background Semantic Inference is the process by which machines perform reasoning over natural language texts. A semantic inference system is expected to be able to infer the meaning of one text from the meaning of another, identify parts of texts which convey a target meaning, and manipulate text units in order to deduce new meanings. Semantic inference is needed for many Natural Language Processing (NLP) applications. For instance, a Question Answering (QA) system may encounter the following question and candidate answer (Example 1): Q: which explorer discovered the New World? A: Christopher Columbus revealed America. As there are no overlapping words between the two sentences, to identify that A holds an answer for Q, background world knowledge is needed to link Christopher Columbus with explorer and America with New World. Linguistic knowledge is also needed to identify that reveal and discover refer to the same concept. Knowledge is needed in order to bridge the gap between text fragments, which may be dissimilar on their surface form but share a common meaning. For the purpose of semantic inference, such knowledge can be derived from various resources (e.g. WordNet (Fellbaum, 1998) and others, detailed in Section 2.1) in a form which we denote as inference links (often called inference/entailment rules), each is an ordered pair of elements in which the first implies the meaning of the second. For instance, the link ship→vessel can be derived from tshtaen hypernym rkel sahtiiopn→ ovfe Wsseolr cdNanet b. Other applications can benefit from utilizing inference links to identify similarity between language expressions. In Information Retrieval, the user’s information need may be expressed in relevant documents differently than it is expressed in the query. Summarization systems should identify text snippets which convey the same meaning. Our work addresses a generic, application in- dependent, setting of lexical inference. We therefore adopt the terminology of Textual Entailment (Dagan et al., 2006), a generic paradigm for applied semantic inference which captures inference needs of many NLP applications in a common underlying task: given two textual fragments, termed hypothesis (H) and text (T), the task is to recognize whether T implies the meaning of H, denoted T→H. For instance, in a QA application, H reprTe→seHnts. Fthoer question, a innd a T Q a c aanpdpilidcaattei answer. pInthis setting, T is likely to hold an answer for the question if it entails the question. It is challenging to properly extract the needed inference knowledge from available resources, and to effectively utilize it within the inference process. The integration of resources, each has its own format, is technically complex and the quality 97 ProceedingSsof oiaf, th Beu 5lg1asrtia A,n Anuuaglu Mst 4ee-9tin 2g0 o1f3. th ?ec A20ss1o3ci Aastisoonci faotrio Cno fomrp Cuotamtipountaalti Loinnaglu Lisitnigcsu,is patigcess 97–102, Figure 1: PLIS schema - a text-hypothesis pair is processed by the Lexical Integrator which uses a set of lexical resources to extract inference chains which connect the two. The Lexical Inference component provides probability estimations for the validity of each level of the process. ofthe resulting inference links is often unknown in advance and varies considerably. For coping with this challenge we developed PLIS, a Probabilistic Lexical Inference System1 . PLIS, illustrated in Fig 1, has two main modules: the Lexical Integra- tor (Section 2) accepts a set of lexical resources and a text-hypothesis pair, and finds all the lexical inference relations between any pair of text term ti and hypothesis term hj, based on the available lexical relations found in the resources (and their combination). The Lexical Inference module (Section 3) provides validity scores for these relations. These term-level scores are used to estimate the sentence-level likelihood that the meaning of the hypothesis can be inferred from the text, thus making PLIS a complete lexical inference system. Lexical inference systems do not look into the structure of texts but rather consider them as bag ofterms (words or multi-word expressions). These systems are easy to implement, fast to run, practical across different genres and languages, while maintaining a competitive level of performance. PLIS can be used as a stand-alone efficient inference system or as the lexical component of any NLP application. PLIS is a flexible system, allowing users to choose the set of knowledge resources as well as the model by which inference 1The complete software package is available at http:// www.cs.biu.ac.il/nlp/downloads/PLIS.html and an online interactive viewer is available for examination at http://irsrv2. cs.biu.ac.il/nlp-net/PLIS.html. is done. PLIS can be easily extended with new knowledge resources and new inference models. It comes with a set of ready-to-use plug-ins for many common lexical resources (Section 2.1) as well as two implementation of the scoring framework. These implementations, described in (Shnarch et al., 2011; Shnarch et al., 2012), provide probability estimations for inference. PLIS has an interactive online viewer (Section 4) which provides a visualization of the entire inference process, and is very helpful for analysing lexical inference models and lexical resources usability. 2 Lexical integrator The input for the lexical integrator is a set of lexical resources and a pair of text T and hypothesis H. The lexical integrator extracts lexical inference links from the various lexical resources to connect each text term ti ∈ T with each hypothesis term hj ∈ H2. A lexical i∈nfTer wenicthe elianckh hinydpicoathteess a semantic∈ rHelation between two terms. It could be a directional relation (Columbus→navigator) or a bai ddiirreeccttiioonnaall one (car ←→ automobile). dSirinecceti knowledge resources vary lien) their representation methods, the lexical integrator wraps each lexical resource in a common plug-in interface which encapsulates resource’s inner representation method and exposes its knowledge as a list of inference links. The implemented plug-ins that come with PLIS are described in Section 2.1. Adding a new lexical resource and integrating it with the others only demands the implementation of the plug-in interface. As the knowledge needed to connect a pair of terms, ti and hj, may be scattered across few resources, the lexical integrator combines inference links into lexical inference chains to deduce new pieces of knowledge, such as Columbus −r −e −so −u −rc −e →2 −r −e −so −u −rc −e →1 navigator explorer. Therefore, the only assumption −t −he − l−e −x →ica elx integrator makes, regarding its input lexical resources, is that the inferential lexical relations they provide are transitive. The lexical integrator generates lexical infer- ence chains by expanding the text and hypothesis terms with inference links. These links lead to new terms (e.g. navigator in the above chain example and t0 in Fig 1) which can be further expanded, as all inference links are transitive. A transitivity 2Where iand j run from 1 to the length of the text and hypothesis respectively. 98 limit is set by the user to determine the maximal length for inference chains. The lexical integrator uses a graph-based representation for the inference chains, as illustrates in Fig 1. A node holds the lemma, part-of-speech and sense of a single term. The sense is the ordinal number of WordNet sense. Whenever we do not know the sense of a term we implement the most frequent sense heuristic.3 An edge represents an inference link and is labeled with the semantic relation of this link (e.g. cytokine→protein is larbeellaetdio wni othf tt hheis sW linokrd (Nee.gt .re clayttiookni hypernym). 2.1 Available plug-ins for lexical resources We have implemented plug-ins for the follow- ing resources: the English lexicon WordNet (Fellbaum, 1998)(based on either JWI, JWNL or extJWNL java APIs4), CatVar (Habash and Dorr, 2003), a categorial variations database, Wikipedia-based resource (Shnarch et al., 2009), which applies several extraction methods to derive inference links from the text and structure of Wikipedia, VerbOcean (Chklovski and Pantel, 2004), a knowledge base of fine-grained semantic relations between verbs, Lin’s distributional similarity thesaurus (Lin, 1998), and DIRECT (Kotlerman et al., 2010), a directional distributional similarity thesaurus geared for lexical inference. To summarize, the lexical integrator finds all possible inference chains (of a predefined length), resulting from any combination of inference links extracted from lexical resources, which link any t, h pair of a given text-hypothesis. Developers can use this tool to save the hassle of interfacing with the different lexical knowledge resources, and spare the labor of combining their knowledge via inference chains. The lexical inference model, described next, provides a mean to decide whether a given hypothesis is inferred from a given text, based on weighing the lexical inference chains extracted by the lexical integrator. 3 Lexical inference There are many ways to implement an inference model which identifies inference relations between texts. A simple model may consider the 3This disambiguation policy was better than considering all senses of an ambiguous term in preliminary experiments. However, it is a matter of changing a variable in the configuration of PLIS to switch between these two policies. 4http://wordnet.princeton.edu/wordnet/related-projects/ number of hypothesis terms for which inference chains, originated from text terms, were found. In PLIS, the inference model is a plug-in, similar to the lexical knowledge resources, and can be easily replaced to change the inference logic. We provide PLIS with two implemented baseline lexical inference models which are mathematically based. These are two Probabilistic Lexical Models (PLMs), HN-PLM and M-PLM which are described in (Shnarch et al., 2011; Shnarch et al., 2012) respectively. A PLM provides probability estimations for the three parts of the inference process (as shown in Fig 1): the validity probability of each inference chain (i.e. the probability for a valid inference relation between its endpoint terms) P(ti → hj), the probability of each hypothesis term to →b e i hnferred by the entire text P(T → hj) (term-level probability), eanntdir teh tee probability o hf the entire hypothesis to be inferred by the text P(T → H) (sentencelteov eble probability). HN-PLM describes a generative process by which the hypothesis is generated from the text. Its parameters are the reliability level of each of the resources it utilizes (that is, the prior probability that applying an arbitrary inference link derived from each resource corresponds to a valid inference). For learning these parameters HN-PLM applies a schema of the EM algorithm (Dempster et al., 1977). Its performance on the recognizing textual entailment task, RTE (Bentivogli et al., 2009; Bentivogli et al., 2010), are in line with the state of the art inference systems, including complex systems which perform syntactic analysis. This model is improved by M-PLM, which deduces sentence-level probability from term-level probabilities by a Markovian process. PLIS with this model was used for a passage retrieval for a question answering task (Wang et al., 2007), and outperformed state of the art inference systems. Both PLMs model the following prominent aspects of the lexical inference phenomenon: (i) considering the different reliability levels of the input knowledge resources, (ii) reducing inference chain probability as its length increases, and (iii) increasing term-level probability as we have more inference chains which suggest that the hypothesis term is inferred by the text. Both PLMs only need sentence-level annotations from which they derive term-level inference probabilities. To summarize, the lexical inference module 99 ?(? → ?) Figure 2: PLIS interactive viewer with Example 1 demonstrates knowledge integration of multiple inference chains and resource combination (additional explanations, which are not part of the demo, are provided in orange). provides the setting for interfacing with the lexical integrator. Additionally, the module provides the framework for probabilistic inference models which estimate term-level probabilities and integrate them into a sentence-level inference decision, while implementing prominent aspects of lexical inference. The user can choose to apply another inference logic, not necessarily probabilistic, by plugging a different lexical inference model into the provided inference infrastructure. 4 The PLIS interactive system PLIS comes with an online interactive viewer5 in which the user sets the parameters of PLIS, inserts a text-hypothesis pair and gets a visualization of the entire inference process. This is a powerful tool for investigating knowledge integration and lexical inference models. Fig 2 presents a screenshot of the processing of Example 1. On the right side, the user configures the system by selecting knowledge resources, adjusting their configuration, setting the transitivity limit, and choosing the lexical inference model to be applied by PLIS. After inserting a text and a hypothesis to the appropriate text boxes, the user clicks on the infer button and PLIS generates all lexical inference chains, of length up to the transitivity limit, that connect text terms with hypothesis terms, as available from the combination of the selected input re5http://irsrv2.cs.biu.ac.il/nlp-net/PLIS.html sources. Each inference chain is presented in a line between the text and hypothesis. PLIS also displays the probability estimations for all inference levels; the probability of each chain is presented at the end of its line. For each hypothesis term, term-level probability, which weighs all inference chains found for it, is given below the dashed line. The overall sentence-level probability integrates the probabilities of all hypothesis terms and is displayed in the box at the bottom right corner. Next, we detail the inference process of Example 1, as presented in Fig 2. In this QA example, the probability of the candidate answer (set as the text) to be relevant for the given question (the hypothesis) is estimated. When utilizing only two knowledge resources (WordNet and Wikipedia), PLIS is able to recognize that explorer is inferred by Christopher Columbus and that New World is inferred by America. Each one of these pairs has two independent inference chains, numbered 1–4, as evidence for its inference relation. Both inference chains 1 and 3 include a single inference link, each derived from a different relation of the Wikipedia-based resource. The inference model assigns a higher probability for chain 1since the BeComp relation is much more reliable than the Link relation. This comparison illustrates the ability of the inference model to learn how to differ knowledge resources by their reliability. Comparing the probability assigned by the in100 ference model for inference chain 2 with the probabilities assigned for chains 1 and 3, reveals the sophisticated way by which the inference model integrates lexical knowledge. Inference chain 2 is longer than chain 1, therefore its probability is lower. However, the inference model assigns chain 2 a higher probability than chain 3, even though the latter is shorter, since the model is sensitive enough to consider the difference in reliability levels between the two highly reliable hypernym relations (from WordNet) of chain 2 and the less reliable Link relation (from Wikipedia) of chain 3. Another aspect of knowledge integration is exemplified in Fig 2 by the three circled probabilities. The inference model takes into consideration the multiple pieces of evidence for the inference of New World (inference chains 3 and 4, whose probabilities are circled). This results in a termlevel probability estimation for New World (the third circled probability) which is higher than the probabilities of each chain separately. The third term of the hypothesis, discover, remains uncovered by the text as no inference chain was found for it. Therefore, the sentence-level inference probability is very low, 37%. In order to identify that the hypothesis is indeed inferred from the text, the inference model should be provided with indications for the inference of discover. To that end, the user may increase the transitivity limit in hope that longer inference chains provide the needed information. In addition, the user can examine other knowledge resources in search for the missing inference link. In this example, it is enough to add VerbOcean to the input of PLIS to expose two inference chains which connect reveal with discover by combining an inference link from WordNet and another one from VerbOcean. With this additional information, the sentence-level probability increases to 76%. This is a typical scenario of utilizing PLIS, either via the interactive system or via the software, for analyzing the usability of the different knowledge resources and their combination. A feature of the interactive system, which is useful for lexical resources analysis, is that each term in a chain is clickable and links to another screen which presents all the terms that are inferred from it and those from which it is inferred. Additionally, the interactive system communicates with a server which runs PLIS, in a fullduplex WebSocket connection6. This mode of operation is publicly available and provides a method for utilizing PLIS, without having to install it or the lexical resources it uses. Finally, since PLIS is a lexical system it can easily be adjusted to other languages. One only needs to replace the basic lexical text processing tools and plug in knowledge resources in the target language. If PLIS is provided with bilingual resources,7 it can operate also as a cross-lingual inference system (Negri et al., 2012). For instance, the text in Fig 3 is given in English, while the hypothesis is written in Spanish (given as a list of lemma:part-of-speech). The left side of the figure depicts a cross-lingual inference process in which the only lexical knowledge resource used is a man- ually built English-Spanish dictionary. As can be seen, two Spanish terms, jugador and casa remain uncovered since the dictionary alone cannot connect them to any of the English terms in the text. As illustrated in the right side of Fig 3, PLIS enables the combination of the bilingual dictionary with monolingual resources to produce cross-lingual inference chains, such as footballer−h −y −p −er−n y −m →player− −m −a −nu − →aljugador. Such inferenc−e − c−h −a −in − →s hpalavey trh− e− capability otro. overcome monolingual language variability (the first link in this chain) as well as to provide cross-lingual translation (the second link). 5 Conclusions To utilize PLIS one should gather lexical resources, obtain sentence-level annotations and train the inference model. Annotations are available in common data sets for task such as QA, Information Retrieval (queries are hypotheses and snippets are texts) and Student Response Analysis (reference answers are the hypotheses that should be inferred by the student answers). For developers of NLP applications, PLIS offers a ready-to-use lexical knowledge integrator which can interface with many common lexical knowledge resources and constructs lexical inference chains which combine the knowledge in them. A developer who wants to overcome lexical language variability, or to incorporate background knowledge, can utilize PLIS to inject lex6We used the socket.io implementation. 7A bilingual resource holds inference links which connect terms in different languages (e.g. an English-Spanish dictionary can provide the inference link explorer→explorador). 101 Figure 3 : PLIS as a cross-lingual inference system. Left: the process with a single manual bilingual resource. Right: PLIS composes cross-lingual inference chains to increase hypothesis coverage and increase sentence-level inference probability. ical knowledge into any text understanding application. PLIS can be used as a lightweight inference system or as the lexical component of larger, more complex inference systems. Additionally, PLIS provides scores for infer- ence chains and determines the way to combine them in order to recognize sentence-level inference. PLIS comes with two probabilistic lexical inference models which achieved competitive performance levels in the tasks of recognizing textual entailment and passage retrieval for QA. All aspects of PLIS are configurable. The user can easily switch between the built-in lexical resources, inference models and even languages, or extend the system with additional lexical resources and new inference models. Acknowledgments The authors thank Eden Erez for his help with the interactive viewer and Miquel Espl a` Gomis for the bilingual dictionaries. This work was partially supported by the European Community’s 7th Framework Programme (FP7/2007-2013) under grant agreement no. 287923 (EXCITEMENT) and the Israel Science Foundation grant 880/12. References Luisa Bentivogli, Ido Dagan, Hoa Trang Dang, Danilo Giampiccolo, and Bernardo Magnini. 2009. The fifth PASCAL recognizing textual entailment challenge. In Proc. of TAC. Luisa Bentivogli, Peter Clark, Ido Dagan, Hoa Trang Dang, and Danilo Giampiccolo. 2010. The sixth PASCAL recognizing textual entailment challenge. In Proc. of TAC. Timothy Chklovski and Patrick Pantel. 2004. VerbOcean: Mining the web for fine-grained semantic verb relations. In Proc. of EMNLP. Ido Dagan, Oren Glickman, and Bernardo Magnini. 2006. The PASCAL recognising textual entailment challenge. In Lecture Notes in Computer Science, volume 3944, pages 177–190. A. P. Dempster, N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the royal statistical society, series [B], 39(1): 1–38. Christiane Fellbaum, editor. 1998. WordNet: An Electronic Lexical Database. MIT Press, Cambridge, Massachusetts. Nizar Habash and Bonnie Dorr. 2003. A categorial variation database for English. In Proc. of NAACL. Lili Kotlerman, Ido Dagan, Idan Szpektor, and Maayan Zhitomirsky-Geffet. 2010. Directional distributional similarity for lexical inference. Natural Language Engineering, 16(4):359–389. Dekang Lin. 1998. Automatic retrieval and clustering of similar words. In Proc. of COLOING-ACL. Matteo Negri, Alessandro Marchetti, Yashar Mehdad, Luisa Bentivogli, and Danilo Giampiccolo. 2012. Semeval-2012 task 8: Cross-lingual textual entailment for content synchronization. In Proc. of SemEval. Eyal Shnarch, Libby Barak, and Ido Dagan. 2009. Extracting lexical reference rules from Wikipedia. In Proc. of ACL. Eyal Shnarch, Jacob Goldberger, and Ido Dagan. 2011. Towards a probabilistic model for lexical entailment. In Proc. of the TextInfer Workshop. Eyal Shnarch, Ido Dagan, and Jacob Goldberger. 2012. A probabilistic lexical model for ranking textual inferences. In Proc. of *SEM. Mengqiu Wang, Noah A. Smith, and Teruko Mitamura. 2007. What is the Jeopardy model? A quasisynchronous grammar for QA. In Proc. of EMNLP. 102

Reference: text

Summary: the most important sentenses genereted by tfidf model

sentIndex sentText sentNum sentScore

1 Abstract This paper presents PLIS, an open source Probabilistic Lexical Inference System which combines two functionalities: (i) a tool for integrating lexical inference knowledge from diverse resources, and (ii) a framework for scoring textual inferences based on the integrated knowledge. [sent-8, score-0.57]

2 PLIS is available for download and developers of text processing applications can use it as an off-the-shelf component for injecting lexical knowledge into their applications. [sent-10, score-0.206]

3 PLIS includes an online interactive viewer, which is a powerful tool for investigating lexical inference processes. [sent-12, score-0.55]

4 A semantic inference system is expected to be able to infer the meaning of one text from the meaning of another, identify parts of texts which convey a target meaning, and manipulate text units in order to deduce new meanings. [sent-14, score-0.479]

5 Semantic inference is needed for many Natural Language Processing (NLP) applications. [sent-15, score-0.392]

6 As there are no overlapping words between the two sentences, to identify that A holds an answer for Q, background world knowledge is needed to link Christopher Columbus with explorer and America with New World. [sent-18, score-0.276]

7 Linguistic knowledge is also needed to identify that reveal and discover refer to the same concept. [sent-19, score-0.114]

8 For the purpose of semantic inference, such knowledge can be derived from various resources (e. [sent-21, score-0.121]

9 1) in a form which we denote as inference links (often called inference/entailment rules), each is an ordered pair of elements in which the first implies the meaning of the second. [sent-24, score-0.454]

10 Other applications can benefit from utilizing inference links to identify similarity between language expressions. [sent-26, score-0.465]

11 Our work addresses a generic, application in- dependent, setting of lexical inference. [sent-29, score-0.11]

12 , 2006), a generic paradigm for applied semantic inference which captures inference needs of many NLP applications in a common underlying task: given two textual fragments, termed hypothesis (H) and text (T), the task is to recognize whether T implies the meaning of H, denoted T→H. [sent-31, score-0.913]

13 It is challenging to properly extract the needed inference knowledge from available resources, and to effectively utilize it within the inference process. [sent-35, score-0.81]

14 ec A20ss1o3ci Aastisoonci faotrio Cno fomrp Cuotamtipountaalti Loinnaglu Lisitnigcsu,is patigcess 97–102, Figure 1: PLIS schema - a text-hypothesis pair is processed by the Lexical Integrator which uses a set of lexical resources to extract inference chains which connect the two. [sent-38, score-0.798]

15 The Lexical Inference component provides probability estimations for the validity of each level of the process. [sent-39, score-0.159]

16 ofthe resulting inference links is often unknown in advance and varies considerably. [sent-40, score-0.418]

17 These term-level scores are used to estimate the sentence-level likelihood that the meaning of the hypothesis can be inferred from the text, thus making PLIS a complete lexical inference system. [sent-44, score-0.64]

18 Lexical inference systems do not look into the structure of texts but rather consider them as bag ofterms (words or multi-word expressions). [sent-45, score-0.359]

19 PLIS can be used as a stand-alone efficient inference system or as the lexical component of any NLP application. [sent-47, score-0.469]

20 PLIS is a flexible system, allowing users to choose the set of knowledge resources as well as the model by which inference 1The complete software package is available at http:// www. [sent-48, score-0.48]

21 html and an online interactive viewer is available for examination at http://irsrv2. [sent-53, score-0.124]

22 PLIS can be easily extended with new knowledge resources and new inference models. [sent-60, score-0.48]

23 It comes with a set of ready-to-use plug-ins for many common lexical resources (Section 2. [sent-61, score-0.19]

24 PLIS has an interactive online viewer (Section 4) which provides a visualization of the entire inference process, and is very helpful for analysing lexical inference models and lexical resources usability. [sent-66, score-1.183]

25 2 Lexical integrator The input for the lexical integrator is a set of lexical resources and a pair of text T and hypothesis H. [sent-67, score-0.834]

26 The lexical integrator extracts lexical inference links from the various lexical resources to connect each text term ti ∈ T with each hypothesis term hj ∈ H2. [sent-68, score-1.359]

27 A lexical i∈nfTer wenicthe elianckh hinydpicoathteess a semantic∈ rHelation between two terms. [sent-69, score-0.11]

28 dSirinecceti knowledge resources vary lien) their representation methods, the lexical integrator wraps each lexical resource in a common plug-in interface which encapsulates resource’s inner representation method and exposes its knowledge as a list of inference links. [sent-71, score-0.979]

29 Adding a new lexical resource and integrating it with the others only demands the implementation of the plug-in interface. [sent-74, score-0.148]

30 Therefore, the only assumption −t −he − l−e −x →ica elx integrator makes, regarding its input lexical resources, is that the inferential lexical relations they provide are transitive. [sent-76, score-0.42]

31 The lexical integrator generates lexical infer- ence chains by expanding the text and hypothesis terms with inference links. [sent-77, score-1.091]

32 navigator in the above chain example and t0 in Fig 1) which can be further expanded, as all inference links are transitive. [sent-80, score-0.591]

33 A transitivity 2Where iand j run from 1 to the length of the text and hypothesis respectively. [sent-81, score-0.163]

34 98 limit is set by the user to determine the maximal length for inference chains. [sent-82, score-0.417]

35 The lexical integrator uses a graph-based representation for the inference chains, as illustrates in Fig 1. [sent-83, score-0.669]

36 3 An edge represents an inference link and is labeled with the semantic relation of this link (e. [sent-87, score-0.487]

37 , 2010), a directional distributional similarity thesaurus geared for lexical inference. [sent-95, score-0.164]

38 To summarize, the lexical integrator finds all possible inference chains (of a predefined length), resulting from any combination of inference links extracted from lexical resources, which link any t, h pair of a given text-hypothesis. [sent-96, score-1.435]

39 Developers can use this tool to save the hassle of interfacing with the different lexical knowledge resources, and spare the labor of combining their knowledge via inference chains. [sent-97, score-0.601]

40 The lexical inference model, described next, provides a mean to decide whether a given hypothesis is inferred from a given text, based on weighing the lexical inference chains extracted by the lexical integrator. [sent-98, score-1.38]

41 3 Lexical inference There are many ways to implement an inference model which identifies inference relations between texts. [sent-99, score-1.077]

42 edu/wordnet/related-projects/ number of hypothesis terms for which inference chains, originated from text terms, were found. [sent-104, score-0.496]

43 In PLIS, the inference model is a plug-in, similar to the lexical knowledge resources, and can be easily replaced to change the inference logic. [sent-105, score-0.869]

44 We provide PLIS with two implemented baseline lexical inference models which are mathematically based. [sent-106, score-0.469]

45 A PLM provides probability estimations for the three parts of the inference process (as shown in Fig 1): the validity probability of each inference chain (i. [sent-110, score-1.049]

46 Its parameters are the reliability level of each of the resources it utilizes (that is, the prior probability that applying an arbitrary inference link derived from each resource corresponds to a valid inference). [sent-114, score-0.62]

47 Its performance on the recognizing textual entailment task, RTE (Bentivogli et al. [sent-117, score-0.111]

48 , 2010), are in line with the state of the art inference systems, including complex systems which perform syntactic analysis. [sent-119, score-0.359]

49 , 2007), and outperformed state of the art inference systems. [sent-122, score-0.359]

50 Both PLMs only need sentence-level annotations from which they derive term-level inference probabilities. [sent-124, score-0.359]

51 ) Figure 2: PLIS interactive viewer with Example 1 demonstrates knowledge integration of multiple inference chains and resource combination (additional explanations, which are not part of the demo, are provided in orange). [sent-128, score-0.746]

52 provides the setting for interfacing with the lexical integrator. [sent-129, score-0.165]

53 Additionally, the module provides the framework for probabilistic inference models which estimate term-level probabilities and integrate them into a sentence-level inference decision, while implementing prominent aspects of lexical inference. [sent-130, score-0.942]

54 The user can choose to apply another inference logic, not necessarily probabilistic, by plugging a different lexical inference model into the provided inference infrastructure. [sent-131, score-1.226]

55 4 The PLIS interactive system PLIS comes with an online interactive viewer5 in which the user sets the parameters of PLIS, inserts a text-hypothesis pair and gets a visualization of the entire inference process. [sent-132, score-0.56]

56 This is a powerful tool for investigating knowledge integration and lexical inference models. [sent-133, score-0.556]

57 On the right side, the user configures the system by selecting knowledge resources, adjusting their configuration, setting the transitivity limit, and choosing the lexical inference model to be applied by PLIS. [sent-135, score-0.596]

58 Each inference chain is presented in a line between the text and hypothesis. [sent-142, score-0.499]

59 PLIS also displays the probability estimations for all inference levels; the probability of each chain is presented at the end of its line. [sent-143, score-0.638]

60 For each hypothesis term, term-level probability, which weighs all inference chains found for it, is given below the dashed line. [sent-144, score-0.609]

61 The overall sentence-level probability integrates the probabilities of all hypothesis terms and is displayed in the box at the bottom right corner. [sent-145, score-0.19]

62 Next, we detail the inference process of Example 1, as presented in Fig 2. [sent-146, score-0.359]

63 When utilizing only two knowledge resources (WordNet and Wikipedia), PLIS is able to recognize that explorer is inferred by Christopher Columbus and that New World is inferred by America. [sent-148, score-0.346]

64 Each one of these pairs has two independent inference chains, numbered 1–4, as evidence for its inference relation. [sent-149, score-0.718]

65 Both inference chains 1 and 3 include a single inference link, each derived from a different relation of the Wikipedia-based resource. [sent-150, score-0.874]

66 The inference model assigns a higher probability for chain 1since the BeComp relation is much more reliable than the Link relation. [sent-151, score-0.531]

67 This comparison illustrates the ability of the inference model to learn how to differ knowledge resources by their reliability. [sent-152, score-0.48]

68 Comparing the probability assigned by the in100 ference model for inference chain 2 with the probabilities assigned for chains 1 and 3, reveals the sophisticated way by which the inference model integrates lexical knowledge. [sent-153, score-1.177]

69 Inference chain 2 is longer than chain 1, therefore its probability is lower. [sent-154, score-0.29]

70 Another aspect of knowledge integration is exemplified in Fig 2 by the three circled probabilities. [sent-156, score-0.117]

71 The inference model takes into consideration the multiple pieces of evidence for the inference of New World (inference chains 3 and 4, whose probabilities are circled). [sent-157, score-0.914]

72 This results in a termlevel probability estimation for New World (the third circled probability) which is higher than the probabilities of each chain separately. [sent-158, score-0.241]

73 The third term of the hypothesis, discover, remains uncovered by the text as no inference chain was found for it. [sent-159, score-0.562]

74 Therefore, the sentence-level inference probability is very low, 37%. [sent-160, score-0.413]

75 In order to identify that the hypothesis is indeed inferred from the text, the inference model should be provided with indications for the inference of discover. [sent-161, score-0.889]

76 To that end, the user may increase the transitivity limit in hope that longer inference chains provide the needed information. [sent-162, score-0.653]

77 In addition, the user can examine other knowledge resources in search for the missing inference link. [sent-163, score-0.519]

78 In this example, it is enough to add VerbOcean to the input of PLIS to expose two inference chains which connect reveal with discover by combining an inference link from WordNet and another one from VerbOcean. [sent-164, score-1.016]

79 This is a typical scenario of utilizing PLIS, either via the interactive system or via the software, for analyzing the usability of the different knowledge resources and their combination. [sent-166, score-0.213]

80 A feature of the interactive system, which is useful for lexical resources analysis, is that each term in a chain is clickable and links to another screen which presents all the terms that are inferred from it and those from which it is inferred. [sent-167, score-0.546]

81 This mode of operation is publicly available and provides a method for utilizing PLIS, without having to install it or the lexical resources it uses. [sent-169, score-0.242]

82 Finally, since PLIS is a lexical system it can easily be adjusted to other languages. [sent-170, score-0.11]

83 One only needs to replace the basic lexical text processing tools and plug in knowledge resources in the target language. [sent-171, score-0.253]

84 If PLIS is provided with bilingual resources,7 it can operate also as a cross-lingual inference system (Negri et al. [sent-172, score-0.383]

85 For instance, the text in Fig 3 is given in English, while the hypothesis is written in Spanish (given as a list of lemma:part-of-speech). [sent-174, score-0.116]

86 The left side of the figure depicts a cross-lingual inference process in which the only lexical knowledge resource used is a man- ually built English-Spanish dictionary. [sent-175, score-0.548]

87 As can be seen, two Spanish terms, jugador and casa remain uncovered since the dictionary alone cannot connect them to any of the English terms in the text. [sent-176, score-0.104]

88 As illustrated in the right side of Fig 3, PLIS enables the combination of the bilingual dictionary with monolingual resources to produce cross-lingual inference chains, such as footballer−h −y −p −er−n y −m →player− −m −a −nu − →aljugador. [sent-177, score-0.463]

89 5 Conclusions To utilize PLIS one should gather lexical resources, obtain sentence-level annotations and train the inference model. [sent-180, score-0.487]

90 For developers of NLP applications, PLIS offers a ready-to-use lexical knowledge integrator which can interface with many common lexical knowledge resources and constructs lexical inference chains which combine the knowledge in them. [sent-182, score-1.281]

91 A developer who wants to overcome lexical language variability, or to incorporate background knowledge, can utilize PLIS to inject lex6We used the socket. [sent-183, score-0.128]

92 7A bilingual resource holds inference links which connect terms in different languages (e. [sent-185, score-0.577]

93 an English-Spanish dictionary can provide the inference link explorer→explorador). [sent-187, score-0.423]

94 101 Figure 3 : PLIS as a cross-lingual inference system. [sent-188, score-0.359]

95 Right: PLIS composes cross-lingual inference chains to increase hypothesis coverage and increase sentence-level inference probability. [sent-190, score-0.968]

96 PLIS can be used as a lightweight inference system or as the lexical component of larger, more complex inference systems. [sent-192, score-0.828]

97 Additionally, PLIS provides scores for infer- ence chains and determines the way to combine them in order to recognize sentence-level inference. [sent-193, score-0.217]

98 PLIS comes with two probabilistic lexical inference models which achieved competitive performance levels in the tasks of recognizing textual entailment and passage retrieval for QA. [sent-194, score-0.666]

99 The user can easily switch between the built-in lexical resources, inference models and even languages, or extend the system with additional lexical resources and new inference models. [sent-196, score-1.075]

100 Acknowledgments The authors thank Eden Erez for his help with the interactive viewer and Miquel Espl a` Gomis for the bilingual dictionaries. [sent-197, score-0.148]

similar papers computed by tfidf model

tfidf for this paper:

wordName wordTfidf (topN-words)

[('plis', 0.763), ('inference', 0.359), ('integrator', 0.2), ('chains', 0.156), ('shnarch', 0.129), ('chain', 0.118), ('lexical', 0.11), ('fig', 0.11), ('hypothesis', 0.094), ('resources', 0.08), ('ido', 0.072), ('link', 0.064), ('hj', 0.064), ('interactive', 0.063), ('viewer', 0.061), ('explorer', 0.059), ('inferred', 0.059), ('links', 0.059), ('connect', 0.056), ('eyal', 0.056), ('bentivogli', 0.056), ('navigator', 0.055), ('plms', 0.055), ('probability', 0.054), ('estimations', 0.053), ('dagan', 0.051), ('circled', 0.048), ('verbocean', 0.048), ('entailment', 0.048), ('transitivity', 0.047), ('textual', 0.042), ('knowledge', 0.041), ('user', 0.039), ('columbus', 0.039), ('resource', 0.038), ('directional', 0.037), ('term', 0.036), ('danilo', 0.033), ('luisa', 0.033), ('qa', 0.033), ('needed', 0.033), ('developers', 0.033), ('israel', 0.033), ('interfacing', 0.032), ('probabilistic', 0.03), ('wordnet', 0.03), ('negri', 0.03), ('validity', 0.029), ('utilizing', 0.029), ('hypernym', 0.029), ('chklovski', 0.028), ('kotlerman', 0.028), ('integration', 0.028), ('uncovered', 0.027), ('reliability', 0.025), ('dempster', 0.024), ('pascal', 0.024), ('bilingual', 0.024), ('provides', 0.023), ('ti', 0.023), ('text', 0.022), ('jacob', 0.022), ('deduce', 0.022), ('discover', 0.022), ('module', 0.022), ('world', 0.022), ('recognizing', 0.021), ('terms', 0.021), ('probabilities', 0.021), ('trang', 0.021), ('rc', 0.021), ('snippets', 0.021), ('habash', 0.021), ('fellbaum', 0.02), ('passage', 0.02), ('holds', 0.02), ('ence', 0.019), ('bernardo', 0.019), ('pieces', 0.019), ('answer', 0.019), ('limit', 0.019), ('schema', 0.019), ('levels', 0.019), ('dang', 0.019), ('categorial', 0.019), ('recognize', 0.019), ('hoa', 0.018), ('visualization', 0.018), ('utilize', 0.018), ('tool', 0.018), ('variability', 0.018), ('switch', 0.018), ('pair', 0.018), ('identify', 0.018), ('meaning', 0.018), ('prominent', 0.018), ('question', 0.017), ('summarize', 0.017), ('thesaurus', 0.017), ('retrieval', 0.017)]

similar papers list:

simIndex simValue paperId paperTitle

same-paper 1 1.0 269 acl-2013-PLIS: a Probabilistic Lexical Inference System

Author: Eyal Shnarch ; Erel Segal-haLevi ; Jacob Goldberger ; Ido Dagan

2 0.13989486 237 acl-2013-Margin-based Decomposed Amortized Inference

Author: Gourab Kundu ; Vivek Srikumar ; Dan Roth

Abstract: Given that structured output prediction is typically performed over entire datasets, one natural question is whether it is possible to re-use computation from earlier inference instances to speed up inference for future instances. Amortized inference has been proposed as a way to accomplish this. In this paper, first, we introduce a new amortized inference algorithm called the Margin-based Amortized Inference, which uses the notion of structured margin to identify inference problems for which previous solutions are provably optimal. Second, we introduce decomposed amortized inference, which is designed to address very large inference problems, where earlier amortization methods become less ef- fective. This approach works by decomposing the output structure and applying amortization piece-wise, thus increasing the chance that we can re-use previous solutions for parts of the output structure. These parts are then combined to a global coherent solution using Lagrangian relaxation. In our experiments, using the NLP tasks of semantic role labeling and entityrelation extraction, we demonstrate that with the margin-based algorithm, we need to call the inference engine only for a third of the test examples. Further, we show that the decomposed variant of margin-based amortized inference achieves a greater reduction in the number of inference calls.

3 0.10727467 297 acl-2013-Recognizing Partial Textual Entailment

Author: Omer Levy ; Torsten Zesch ; Ido Dagan ; Iryna Gurevych

Abstract: Textual entailment is an asymmetric relation between two text fragments that describes whether one fragment can be inferred from the other. It thus cannot capture the notion that the target fragment is “almost entailed” by the given text. The recently suggested idea of partial textual entailment may remedy this problem. We investigate partial entailment under the faceted entailment model and the possibility of adapting existing textual entailment methods to this setting. Indeed, our results show that these methods are useful for rec- ognizing partial entailment. We also provide a preliminary assessment of how partial entailment may be used for recognizing (complete) textual entailment.

4 0.099485502 27 acl-2013-A Two Level Model for Context Sensitive Inference Rules

Author: Oren Melamud ; Jonathan Berant ; Ido Dagan ; Jacob Goldberger ; Idan Szpektor

Abstract: Automatic acquisition of inference rules for predicates has been commonly addressed by computing distributional similarity between vectors of argument words, operating at the word space level. A recent line of work, which addresses context sensitivity of rules, represented contexts in a latent topic space and computed similarity over topic vectors. We propose a novel two-level model, which computes similarities between word-level vectors that are biased by topic-level context representations. Evaluations on a naturallydistributed dataset show that our model significantly outperforms prior word-level and topic-level models. We also release a first context-sensitive inference rule set.

5 0.094305657 245 acl-2013-Modeling Human Inference Process for Textual Entailment Recognition

Author: Hen-Hsen Huang ; Kai-Chun Chang ; Hsin-Hsi Chen

Abstract: This paper aims at understanding what human think in textual entailment (TE) recognition process and modeling their thinking process to deal with this problem. We first analyze a labeled RTE-5 test set and find that the negative entailment phenomena are very effective features for TE recognition. Then, a method is proposed to extract this kind of phenomena from text-hypothesis pairs automatically. We evaluate the performance of using the negative entailment phenomena on both the English RTE-5 dataset and Chinese NTCIR-9 RITE dataset, and conclude the same findings.

6 0.071375102 208 acl-2013-Joint Inference for Heterogeneous Dependency Parsing

7 0.069131844 291 acl-2013-Question Answering Using Enhanced Lexical Semantic Models

8 0.06711226 376 acl-2013-Using Lexical Expansion to Learn Inference Rules from Sparse Data

9 0.066477701 365 acl-2013-Understanding Tables in Context Using Standard NLP Toolkits

10 0.063745387 382 acl-2013-Variational Inference for Structured NLP Models

11 0.057757959 106 acl-2013-Decentralized Entity-Level Modeling for Coreference Resolution

12 0.05360106 75 acl-2013-Building Japanese Textual Entailment Specialized Data Sets for Inference of Basic Sentence Relations

13 0.050774496 306 acl-2013-SPred: Large-scale Harvesting of Semantic Predicates

14 0.050724901 46 acl-2013-An Infinite Hierarchical Bayesian Model of Phrasal Translation

15 0.049674224 307 acl-2013-Scalable Decipherment for Machine Translation via Hash Sampling

16 0.048989229 43 acl-2013-Align, Disambiguate and Walk: A Unified Approach for Measuring Semantic Similarity

17 0.045248993 60 acl-2013-Automatic Coupling of Answer Extraction and Information Retrieval

18 0.043242119 145 acl-2013-Exploiting Qualitative Information from Automatic Word Alignment for Cross-lingual NLP Tasks

19 0.041786563 154 acl-2013-Extracting bilingual terminologies from comparable corpora

20 0.040926982 143 acl-2013-Exact Maximum Inference for the Fertility Hidden Markov Model

similar papers computed by lsi model

lsi for this paper:

topicId topicWeight

[(0, 0.117), (1, 0.023), (2, 0.009), (3, -0.081), (4, -0.026), (5, 0.024), (6, -0.025), (7, -0.039), (8, 0.007), (9, -0.003), (10, 0.012), (11, 0.001), (12, -0.006), (13, -0.057), (14, 0.037), (15, -0.038), (16, 0.038), (17, 0.017), (18, 0.085), (19, -0.026), (20, -0.014), (21, 0.027), (22, -0.065), (23, 0.059), (24, -0.028), (25, 0.103), (26, -0.047), (27, 0.075), (28, 0.06), (29, -0.141), (30, 0.043), (31, 0.117), (32, 0.013), (33, -0.023), (34, 0.052), (35, 0.082), (36, 0.023), (37, -0.034), (38, -0.078), (39, -0.046), (40, 0.025), (41, -0.079), (42, -0.099), (43, -0.045), (44, 0.006), (45, -0.024), (46, 0.039), (47, 0.12), (48, -0.053), (49, 0.048)]

similar papers list:

simIndex simValue paperId paperTitle

same-paper 1 0.95326269 269 acl-2013-PLIS: a Probabilistic Lexical Inference System

Author: Eyal Shnarch ; Erel Segal-haLevi ; Jacob Goldberger ; Ido Dagan

2 0.72705024 297 acl-2013-Recognizing Partial Textual Entailment

Author: Omer Levy ; Torsten Zesch ; Ido Dagan ; Iryna Gurevych

3 0.71720386 237 acl-2013-Margin-based Decomposed Amortized Inference

Author: Gourab Kundu ; Vivek Srikumar ; Dan Roth

4 0.66051787 245 acl-2013-Modeling Human Inference Process for Textual Entailment Recognition

Author: Hen-Hsen Huang ; Kai-Chun Chang ; Hsin-Hsi Chen

5 0.64248514 75 acl-2013-Building Japanese Textual Entailment Specialized Data Sets for Inference of Basic Sentence Relations

Author: Kimi Kaneko ; Yusuke Miyao ; Daisuke Bekki

Abstract: This paper proposes a methodology for generating specialized Japanese data sets for textual entailment, which consists of pairs decomposed into basic sentence relations. We experimented with our methodology over a number of pairs taken from the RITE-2 data set. We compared our methodology with existing studies in terms of agreement, frequencies and times, and we evaluated its validity by investigating recognition accuracy.

6 0.57353222 202 acl-2013-Is a 204 cm Man Tall or Small ? Acquisition of Numerical Common Sense from the Web

7 0.48533094 365 acl-2013-Understanding Tables in Context Using Standard NLP Toolkits

8 0.44718906 382 acl-2013-Variational Inference for Structured NLP Models

9 0.42260832 27 acl-2013-A Two Level Model for Context Sensitive Inference Rules

10 0.42187718 143 acl-2013-Exact Maximum Inference for the Fertility Hidden Markov Model

11 0.42027214 376 acl-2013-Using Lexical Expansion to Learn Inference Rules from Sparse Data

12 0.39238647 170 acl-2013-GlossBoot: Bootstrapping Multilingual Domain Glossaries from the Web

13 0.37408099 279 acl-2013-PhonMatrix: Visualizing co-occurrence constraints of sounds

14 0.34789586 208 acl-2013-Joint Inference for Heterogeneous Dependency Parsing

15 0.34689379 369 acl-2013-Unsupervised Consonant-Vowel Prediction over Hundreds of Languages

16 0.34650195 371 acl-2013-Unsupervised joke generation from big data

17 0.3414897 106 acl-2013-Decentralized Entity-Level Modeling for Coreference Resolution

18 0.34013161 348 acl-2013-The effect of non-tightness on Bayesian estimation of PCFGs

19 0.33693087 145 acl-2013-Exploiting Qualitative Information from Automatic Word Alignment for Cross-lingual NLP Tasks

20 0.33203691 65 acl-2013-BRAINSUP: Brainstorming Support for Creative Sentence Generation

similar papers computed by lda model

lda for this paper:

topicId topicWeight

[(0, 0.444), (6, 0.049), (11, 0.077), (15, 0.01), (24, 0.044), (26, 0.038), (28, 0.016), (35, 0.063), (42, 0.03), (48, 0.031), (70, 0.029), (88, 0.021), (90, 0.01), (95, 0.049)]

similar papers list:

simIndex simValue paperId paperTitle

1 0.98711085 104 acl-2013-DKPro Similarity: An Open Source Framework for Text Similarity

Author: Daniel Bar ; Torsten Zesch ; Iryna Gurevych

Abstract: We present DKPro Similarity, an open source framework for text similarity. Our goal is to provide a comprehensive repository of text similarity measures which are implemented using standardized interfaces. DKPro Similarity comprises a wide variety of measures ranging from ones based on simple n-grams and common subsequences to high-dimensional vector comparisons and structural, stylistic, and phonetic measures. In order to promote the reproducibility of experimental results and to provide reliable, permanent experimental conditions for future studies, DKPro Similarity additionally comes with a set of full-featured experimental setups which can be run out-of-the-box and be used for future systems to built upon.

same-paper 2 0.98564118 269 acl-2013-PLIS: a Probabilistic Lexical Inference System

Author: Eyal Shnarch ; Erel Segal-haLevi ; Jacob Goldberger ; Ido Dagan

3 0.97964317 12 acl-2013-A New Set of Norms for Semantic Relatedness Measures

Author: Sean Szumlanski ; Fernando Gomez ; Valerie K. Sims

Abstract: We have elicited human quantitative judgments of semantic relatedness for 122 pairs of nouns and compiled them into a new set of relatedness norms that we call Rel-122. Judgments from individual subjects in our study exhibit high average correlation to the resulting relatedness means (r = 0.77, σ = 0.09, N = 73), although not as high as Resnik’s (1995) upper bound for expected average human correlation to similarity means (r = 0.90). This suggests that human perceptions of relatedness are less strictly constrained than perceptions of similarity and establishes a clearer expectation for what constitutes human-like performance by a computational measure of semantic relatedness. We compare the results of several WordNet-based similarity and relatedness measures to our Rel-122 norms and demonstrate the limitations of WordNet for discovering general indications of semantic relatedness. We also offer a critique of the field’s reliance upon similarity norms to evaluate relatedness measures.

4 0.97350097 362 acl-2013-Turning on the Turbo: Fast Third-Order Non-Projective Turbo Parsers

Author: Andre Martins ; Miguel Almeida ; Noah A. Smith

Abstract: We present fast, accurate, direct nonprojective dependency parsers with thirdorder features. Our approach uses AD3, an accelerated dual decomposition algorithm which we extend to handle specialized head automata and sequential head bigram models. Experiments in fourteen languages yield parsing speeds competitive to projective parsers, with state-ofthe-art accuracies for the largest datasets (English, Czech, and German).

5 0.96849358 150 acl-2013-Extending an interoperable platform to facilitate the creation of multilingual and multimodal NLP applications

Author: Georgios Kontonatsios ; Paul Thompson ; Riza Theresa Batista-Navarro ; Claudiu Mihaila ; Ioannis Korkontzelos ; Sophia Ananiadou

Abstract: U-Compare is a UIMA-based workflow construction platform for building natural language processing (NLP) applications from heterogeneous language resources (LRs), without the need for programming skills. U-Compare has been adopted within the context of the METANET Network of Excellence, and over 40 LRs that process 15 European languages have been added to the U-Compare component library. In line with METANET’s aims of increasing communication between citizens of different European countries, U-Compare has been extended to facilitate the development of a wider range of applications, including both mul- tilingual and multimodal workflows. The enhancements exploit the UIMA Subject of Analysis (Sofa) mechanism, that allows different facets of the input data to be represented. We demonstrate how our customised extensions to U-Compare allow the construction and testing of NLP applications that transform the input data in different ways, e.g., machine translation, automatic summarisation and text-to-speech.

6 0.96451843 277 acl-2013-Part-of-speech tagging with antagonistic adversaries

7 0.92533118 284 acl-2013-Probabilistic Sense Sentiment Similarity through Hidden Emotions

8 0.8630079 307 acl-2013-Scalable Decipherment for Machine Translation via Hash Sampling

9 0.84241754 118 acl-2013-Development and Analysis of NLP Pipelines in Argo

10 0.79120231 105 acl-2013-DKPro WSD: A Generalized UIMA-based Framework for Word Sense Disambiguation

11 0.77261811 51 acl-2013-AnnoMarket: An Open Cloud Platform for NLP

12 0.72317278 297 acl-2013-Recognizing Partial Textual Entailment

13 0.72052222 304 acl-2013-SEMILAR: The Semantic Similarity Toolkit

14 0.72006637 43 acl-2013-Align, Disambiguate and Walk: A Unified Approach for Measuring Semantic Similarity

15 0.71241432 239 acl-2013-Meet EDGAR, a tutoring agent at MONSERRATE

16 0.69374496 96 acl-2013-Creating Similarity: Lateral Thinking for Vertical Similarity Judgments

17 0.69345319 385 acl-2013-WebAnno: A Flexible, Web-based and Visually Supported System for Distributed Annotations

18 0.68638223 237 acl-2013-Margin-based Decomposed Amortized Inference

19 0.6858362 157 acl-2013-Fast and Robust Compressive Summarization with Dual Decomposition and Multi-Task Learning

20 0.66607034 191 acl-2013-Improved Bayesian Logistic Supervised Topic Models with Data Augmentation