a holistic lexiconbased approach to opinion mining

practical annotation scheme for an hpsg treebank of bulgarian in

If we start by considering languages with a labeled attachment score of 85 % or higher , they are characterized by high precision and recall for root nodes , typically 95/90 , and by a graceful degradation of attachment score as arcs grow longer , typically 95 -- 90 -- 85 , for arcs of length 1 , 2 and 3 -- 6 . Typical examples are Bulgarian ( Simov et al. , 2005 ; Simov and Osenova , 2003 ) , Chinese ( Chen et al. , 2003 ) , Danish ( Kromann , 2003 ) , and Swedish ( Nilsson et al. , 2005 ) . Japanese ( Kawata and Bartels , 2000 ) , despite a very high accuracy , is different in that attachment score drops from 98 % to 85 % , as we go from length 1 to 2 , which may have something to do with the data consisting of transcribed speech with very short utterances .

Typical examples are Bulgarian ( Simov et al. , 2005 ; @@CITATION ) , Chinese ( Chen et al. , 2003 ) , Danish ( Kromann , 2003 ) , and Swedish ( Nilsson et al. , 2005 ) .


generalizing case frames using a thesaurus and the mdl principle

This DAG-like property was responsible for the over-generalisation , and so we removed the link between / per son ) and causal_agent ) . This appeared to solve the problem , and the results presented later for the average degree of generalisation do not show an over-generalisation compared with those given in Li and Abe ( 1998 ) .

This appeared to solve the problem , and the results presented later for the average degree of generalisation do not show an over-generalisation compared with those given in @@CITATION .


on argument structure and the lexical expression of syntactic relations

Often , however , these functional elements responsible for licensing event interpretations are not phonologically realized . These observations and this line of reasoning has not escaped the attention of theoretical linguists : Hale and Keyser ( 1993 ) propose that argument structure is , in fact , encoded syntactically . They describe a cascading verb phrase analysis with multiple phonetically empty verbal projections corresponding to concepts such as inchoativity and agentivity .

These observations and this line of reasoning has not escaped the attention of theoretical linguists : @@CITATION propose that argument structure is , in fact , encoded syntactically .


mining newsgroups using networks arising from social behavior

Previous sentiment-analysis work in different domains has considered inter-document similarity ( Agarwal and Bhattacharyya , 2005 ; Pang and Lee , 2005 ; Goldberg and Zhu , 2006 ) or explicit inter-document references in the form of hyperlinks ( Agrawal et al. , 2003 ) . Notable early papers on graph-based semisupervised learning include Blum and Chawla ( 2001 ) , Bansal et al. ( 2002 ) , Kondor and Lafferty ( 2002 ) , and Joachims ( 2003 ) .

inter-document references in the form of hyperlinks ( @@CITATION ) .


While IA is generally thought to be consistent with findings on human language production ( Hermann and Deutsch 1976 ; Levelt 1989 ; Pechmann 1989 ; Sonnenschein 1982 ) , the hypothesis that incrementality is a good model of human GRE seems unfalsifiable until a preference order is specified for the properties on which it operates . ( Wildly redundant descriptions can result if the ` wrong ' preference order are chosen . )

While IA is generally thought to be consistent with findings on human language production ( @@CITATION ; Levelt 1989 ; Pechmann 1989 ; Sonnenschein 1982 ) , the hypothesis that incrementality is a good model of human GRE seems unfalsifiable until a preference order is specified for the properties on which it operates .


building an arabic stemmer for information retrieval

Also , the prepositions ( i.e. , and ) not be considered a part of the mention . Arabic has two kinds of plurals : broken plurals and sound plurals ( Wightwick and Gaafar , 1998 ; Chen and Gey , 2002 ) . The formation of broken plurals is common , more complex and often irregular .

Arabic has two kinds of plurals : broken plurals and sound plurals ( Wightwick and Gaafar , 1998 ; @@CITATION ) .


a discriminative latent variable model for statistical machine translation

Firstly , we plan to explore our estimator on other language pairs in order to obtain more evidence on its behavior . Secondly , as ( Blunsom et al. , 2008 ) show , marginalizing out the different segmentations during decoding leads to improved performance . We plan to build our own decoder ( based on ITG ) where different ideas can be tested including tractable ways for achieving a marginalization effect .

Secondly , as ( @@CITATION ) show , marginalizing out the different segmentations during decoding leads to improved performance .


atanas chanev gulsen eryigit sandra kubler svetoslav marinov and erwin marsi

Recently , Green and Manning ( 2010 ) analyzed the PATB for annotation consistency , and introduced an enhanced split-state constituency grammar , including labels for short idafa constructions and verbal or equational clauses . Nivre ( 2008 ) reports experiments on Arabic parsing using his MaltParser ( Nivre et al. 2007 ) , trained on the PADT . His results are not directly comparable to ours because of the different treebank representations , even though all the experiments reported here were performed using the MaltParser .

Nivre ( 2008 ) reports experiments on Arabic parsing using his MaltParser ( @@CITATION ) , trained on the PADT .


A good study comparing document categorization algorithms can be found in ( Yang and Liu , 1999 ) . More recently , ( Sebastiani , 2002 ) has performed a good survey of document categorization ; recent works can also be found in ( Joachims , 2002 ) , ( Crammer and Singer , 2003 ) , and ( Lewis et al. , 2004 ) . Concerning Arabic , one automatic categorizer has been reported to have been put under operational use to classify Arabic documents ; it is referred to as `` Sakhr 's categorizer '' ( Sakhr , 2004 ) .

More recently , ( Sebastiani , 2002 ) has performed a good survey of document categorization ; recent works can also be found in ( @@CITATION ) , ( Crammer and Singer , 2003 ) , and ( Lewis et al. , 2004 ) .


The grammar conversion from LTAG to HPSG ( Yoshinaga and Miyao , 2001 ) is the core portion of the RenTAL system . The conversion algorithm consists of :

The grammar conversion from LTAG to HPSG ( @@CITATION ) is the core portion of the RenTAL system .


what is the jeopardy model a quasisynchronous grammar for qa

The accuracy and speed of state-of-the-art dependency parsers has motivated a resumed interest in utilizing the output of parsing as an input to many downstream natural language processing tasks . This includes work on question answering ( Wang et al. , 2007 ) , sentiment analysis ( Nakagawa et al. , 2010 ) , MT reordering ( Xu et al. , 2009 ) , and many other tasks . In most cases , the accuracy of parsers degrades when run on out-of-domain data ( Gildea , 2001 ; McClosky et al. , 2006 ; Blitzer et al. , 2006 ; Petrov et al. , 2010 ) .

This includes work on question answering ( @@CITATION ) , sentiment analysis ( Nakagawa et al. , 2010 ) , MT reordering ( Xu et al. , 2009 ) , and many other tasks .


effective mapping of biomedical text to the umls metathesaurus the metamap program

Each individual PICO extractor takes as input the abstract text of a MEDLINE citation and identifies the relevant elements : Outcomes are complete sentences , while population , problems , and interventions are short noun phrases . Our knowledge extractors rely extensively on MetaMap ( Aronson 2001 ) , a system for identifying segments of text that correspond to concepts in the UMLS Metathesaurus . Many of our algorithms operate at the level of coarser-grained semantic types called Semantic Groups ( McCray , Burgun , and Bodenreider 2001 ) , which capture higher-level generalizations about entities ( e.g. , CHEMICALS & DRUGS ) .

Our knowledge extractors rely extensively on MetaMap ( @@CITATION ) , a system for identifying segments of text that correspond to concepts in the UMLS Metathesaurus .


using the web to obtain frequencies for unseen bigrams

Finally , we evaluate DSP on a common application of selectional preferences : choosing the correct antecedent for pronouns in text ( Dagan and Itai , 1990 ; Kehler et al. , 2004 ) . We study the cases where a 9Recall that even the Keller and Lapata ( 2003 ) system , built on the world 's largest corpus , achieves only 34 % recall ( Table 1 ) ( with only 48 % of positives and 27 % of all pairs previously observed , but see Footnote 5 ) . pronoun is the direct object of a verb predicate , v .

We study the cases where a 9Recall that even the @@CITATION system , built on the world 's largest corpus , achieves only 34 % recall ( Table 1 ) ( with only 48 % of positives and 27 % of all pairs previously observed , but see Footnote 5 ) .


a bayesian model of syntaxdirected tree to string grammar induction

generating the source string , which contains several source words and variables . Inspired by ( Blunsom et al. , 2009 ) and ( Cohn and Blunsom , 2009 ) , we define P ( str | frag ) as follows : where csw is the number of words in the source string . â¢ s means the source vocabulary set .

Inspired by ( Blunsom et al. , 2009 ) and ( @@CITATION ) , we define P ( str | frag ) as follows : where csw is the number of words in the source string .


a gibbs sampler for phrasal synchronous grammar induction

Phil Blunsom
Trevor Cohn
Chris Dyer
Miles Osborne

Inspired by ( @@CITATION ) and ( Cohn and Blunsom , 2009 ) , we define P ( str | frag ) as follows : where csw is the number of words in the source string .


Other attempts to address efficiency include the fast Transformation Based Learning ( TBL ) Toolkit ( Ngai and Florian , 2001 ) which dramatically speeds up training TBL systems , and the translation of TBL rules into finite state machines for very fast tagging ( Roche and Schabes , 1997 ) . The TNT POS tagger ( Brants , 2000 ) has also been designed to train and run very quickly , tagging between 30,000 and 60,000 words per second . The Weka package ( Witten and Frank , 1999 ) provides a common framework for several existing machine learning methods including decision trees and support vector machines .

The TNT POS tagger ( @@CITATION ) has also been designed to train and run very quickly , tagging between 30,000 and 60,000 words per second .


extracting paraphrase patterns from bilingual parallel corpora

Shiqi Zhao
Haifeng Wang
Ting Liu
Sheng Li

As emerges from the ablation tests reported in ( Bentivogli et al. , 2010 ) , even the most common resources proved to have a positive impact on some systems and a negative impact on others . Some previous works ( Bannard and Callison-Burch , 2005 ; Zhao et al. , 2009 ; Kouylekov et al. , 2009 ) indicate , as main limitations of the mentioned resources , their limited coverage , their low precision , and the fact that they are mostly suitable to capture relations mainly between single words . Addressing CLTE we have to face additional and more problematic issues related to : i ) the stronger need of lexical knowledge , and ii ) the limited availability of multilingual lexical resources .

Some previous works ( Bannard and Callison-Burch , 2005 ; @@CITATION ; Kouylekov et al. , 2009 ) indicate , as main limitations of the mentioned resources , their limited coverage , their low precision , and the fact that they are mostly suitable to capture relations mainly between single words .


morphology and reranking for the statistical parsing of spanish

This may be due to CASE tagging having a lower error rate in Czech ( 5.0 % ) ( HajiËc and VidovÃ¡-HladkÃ¡ 1998 ) compared with Arabic ( â 14.0 % , see Table 3 ) . Similarly , Cowan and Collins ( 2005 ) report that the use of a subset of Spanish morphological features ( number for adjectives , determiners , nouns , pronouns , and verbs ; and mode for verbs ) outperforms other combinations . Our approach is

Similarly , @@CITATION report that the use of a subset of Spanish morphological features ( number for adjectives , determiners , nouns , pronouns , and verbs ; and mode for verbs ) outperforms other combinations .


online learning for latent dirichlet allocation

Matthew Hoffman
David M Blei
Francis Bach

Prior work using mLDA has used Gibbs Sampling to approximate the posterior , but we found this method did not scale with larger values of K , especially when applied to the relatively large deWaC corpus . To solve these scaling issues , we implement Online Variational Bayesian Inference ( Hoffman et al. , 2010 ; Hoffman et al. , 2012 ) for our models . In Variational Bayesian Inference ( VBI ) , one approximates the true posterior using simpler distributions with free variables .

To solve these scaling issues , we implement Online Variational Bayesian Inference ( @@CITATION ; Hoffman et al. , 2012 ) for our models .


on relevance probabilistic indexing and information retrievalquot

Other studies which view lR as a query generation process include Maron and Kuhns , 1960 ; Hiemstra and Kraaij , 1999 ; Ponte and Croft , 1998 ; Miller et al , 1999 . Our work has focused on cross-lingual retrieval .

Other studies which view lR as a query generation process include @@CITATION ; Hiemstra and Kraaij , 1999 ; Ponte and Croft , 1998 ; Miller et al , 1999 .


exploiting semantic role labeling wordnet and wikipedia for coreference resolution

In fact , semantics plays a crucially important role in the resolution of common NPs , allowing us to identify the coreference relation between two lexically dissimilar common nouns ( e.g. , talks and negotiations ) and to eliminate George W. Bush from the list of candidate antecedents of the city , for instance . As a result , researchers have re-adopted the once-popular knowledge-rich approach , investigating a variety of semantic knowledge sources for common noun resolution , such as the semantic relations between two NPs ( e.g. , Ji et al. ( 2005 ) ) , their semantic similarity as computed using WordNet ( e.g. , Poesio et al. ( 2004 ) ) or Wikipedia ( Ponzetto and Strube , 2006 ) , and the contextual role played by an NP ( see Bean and Riloff ( 2004 ) ) . Another type of semantic knowledge that has been employed by coreference resolvers is the semantic class ( SC ) of an NP , which can be used to disallow coreference between semantically incompatible NPs .

As a result , researchers have re-adopted the once-popular knowledge-rich approach , investigating a variety of semantic knowledge sources for common noun resolution , such as the semantic relations between two NPs ( e.g. , Ji et al. ( 2005 ) ) , their semantic similarity as computed using WordNet ( e.g. , Poesio et al. ( 2004 ) ) or Wikipedia ( @@CITATION ) , and the contextual role played by an NP ( see Bean and Riloff ( 2004 ) ) .


Strongly equivalent grammars enable the sharing of ideas developed in each formalism . There have been many studies on parsing techniques ( Poller and Becker , 1998 ; Flickinger et al. , 2000 ) , ones on disambiguation models ( Chiang , 2000 ; Kanayama et al. , 2000 ) , and ones on programming/grammar-development environ - 1In this paper , we use the term LTAG to refer to FBLTAG , if not confusing .

There have been many studies on parsing techniques ( @@CITATION ; Flickinger et al. , 2000 ) , ones on disambiguation models ( Chiang , 2000 ; Kanayama et al. , 2000 ) , and ones on programming/grammar-development environ -


a comparison of algorithms for maximum entropy parameter estimation

However , it will be increasingly important as techniques become more complex and corpus sizes grow . An example of this is the estimation of maximum entropy models , from simple iterative estimation algorithms used by Ratnaparkhi ( 1998 ) that converge very slowly , to complex techniques from the optimisation literature that converge much more rapidly ( Malouf , 2002 ) . Other attempts to address efficiency include the fast Transformation Based Learning ( TBL ) Toolkit ( Ngai and Florian , 2001 ) which dramatically speeds up training TBL systems , and the translation of TBL rules into finite state machines for very fast tagging ( Roche and Schabes , 1997 ) .

An example of this is the estimation of maximum entropy models , from simple iterative estimation algorithms used by Ratnaparkhi ( 1998 ) that converge very slowly , to complex techniques from the optimisation literature that converge much more rapidly ( @@CITATION ) .


Due to these limitations , instead of investigating into the synchronization of two grammars , we propose a flexible annotation schema ( i.e. Synchronous Structured String-Tree Correspondence ( S-SSTC ) ) to realize additional power and flexibility in expressing structural correspondences at the level of language sentence pairs . For example , such schema can serve as a mean to represent translation examples , or find structural correspondences for the purpose of transfer grammar learning ( Menezes & Richardson , 2001 ) , ( Aramaki et al. , 2001 ) , ( Watanabe et al. , 2000 ) , ( Meyers et al. , 2000 ) , ( Matsumoto et al. , 1993 ) , ( kaji et al. , 1992 ) , and example-base machine translation EBMT3 ( Sato & Nagao , 1990 ) , ( Sato , 1991 ) , ( Richardson et al. , 2001 ) , ( Al-Adhaileh & Tang , 1999 ) .

For example , such schema can serve as a mean to represent translation examples , or find structural correspondences for the purpose of transfer grammar learning ( Menezes & Richardson , 2001 ) , ( Aramaki et al. , 2001 ) , ( Watanabe et al. , 2000 ) , ( Meyers et al. , 2000 ) , ( Matsumoto et al. , 1993 ) , ( kaji et al. , 1992 ) , and example-base machine translation EBMT3 ( Sato & Nagao , 1990 ) , ( @@CITATION ) , ( Richardson et al. , 2001 ) , ( Al-Adhaileh & Tang , 1999 ) .


natural language processing for information assurance and security an overview and implementations

Mikhail J Atallah
Craig J McDonough
Victor Raskin
Sergei Nirenburg

The first lexical substitution method was proposed by Chapman and Davida ( 1997 ) . Later works , such as Atallah et al. ( 2001a ) , Bolshakov ( 2004 ) , Taskiran et al. ( 2006 ) and Topkara et al. ( 2006b ) , further made use of part-ofspeech taggers and electronic dictionaries , such as WordNet and VerbNet , to increase the robustness of the method . Taskiran et al. ( 2006 ) attempt to use context by prioritizing the alternatives using an ngram language model ; that is , rather than randomly choose an option from the synonym set , the system relies on the language model to select the synonym .

Later works , such as @@CITATIONa ) , Bolshakov ( 2004 ) , Taskiran et al. ( 2006 ) and Topkara et al. ( 2006b ) , further made use of part-ofspeech taggers and electronic dictionaries , such as WordNet and VerbNet , to increase the robustness of the method .


europarl a parallel corpus for statistical machine translation

Horizontal axis : average number of transferred edges per sentence . results are based on a corpus of movie subtitles ( Tiedemann 2007 ) , and are consequently shorter sentences , whereas the En â Es results are based on a corpus of parliamentary proceedings ( Koehn 2005 ) . We see in Figure 10 that for both domains , the models trained using posterior regularization perform better than the baseline model trained using EM .

results are based on a corpus of movie subtitles ( Tiedemann 2007 ) , and are consequently shorter sentences , whereas the En â Es results are based on a corpus of parliamentary proceedings ( @@CITATION ) .


We work with a semi-technical text on meteorological phenomena ( Larrick , 1961 ) , meant for primary school students . The text gradually introduces concepts related to precipitation , and explains them .

We work with a semi-technical text on meteorological phenomena ( @@CITATION ) , meant for primary school students .


a theory of truth and semantic representationquot

The issues of control are not so important for us at this point ; we restrict ourselves to describing the logic . This Principle of Finitism is also assumed by Johnson-Laird ( 1983 ) , Jackendoff ( 1983 ) , Kamp ( 1981 ) , and implicitly or explicitly by almost all researchers in computational linguistics . As a logical postulate it is not very radical ; it is possible within a finitary framework to develop that part of mathematics that is used or has potential applications in natural science , such as mathematical analysis ( cfXXX Mycielski 1981 ) .

This Principle of Finitism is also assumed by Johnson-Laird ( 1983 ) , Jackendoff ( 1983 ) , @@CITATION , and implicitly or explicitly by almost all researchers in computational linguistics .


Most of the feature templates are standard , so only the new ones will be explained . The candidate feature templates include : Voice from Sun and Jurafsky ( 2004 ) . Head word POS , Head Word of Prepositional Phrases , Constituent tree distance , from Pradhan etc. ( 2004 ) .

The candidate feature templates include : Voice from @@CITATION .


the mathematics of statistical machine translation parameter estimationquot

P F Brown
V J Della Pietra
S A Della Pietra
R L Mercer

Over the past decade , researchers at IBM have developed a series of increasingly sophisticated statistical models for machine translation ( Brown et al. , 1988 ; Brown et al. , 1990 ; Brown et al. , 1993a ) . However , the IBM models , which attempt to capture a broad range of translation phenomena , are computationally expensive to apply .

Over the past decade , researchers at IBM have developed a series of increasingly sophisticated statistical models for machine translation ( Brown et al. , 1988 ; Brown et al. , 1990 ; @@CITATIONa ) .


the wellbuilt clinical question a key to evidencebased decisions

W Scott Richardson
Mark C Wilson
James Nishikawa
Robert S Hayward

Third , the paradigm of evidence-based medicine ( Sackett et al. 2000 ) provides a task-based model of the clinical information-seeking process . The PICO framework ( Richardson et al. 1995 ) for capturing well-formulated clinical queries ( described in Section 2 ) can serve as the basis of a knowledge representation that bridges the needs of clinicians and analytical capabilities of a system . The confluence of these many factors makes clinical question answering a very exciting area of research .

The PICO framework ( @@CITATION ) for capturing well-formulated clinical queries ( described in Section 2 ) can serve as the basis of a knowledge representation that bridges the needs of clinicians and analytical capabilities of a system .


the penn chinese treebank phrase structure annotation of a large corpus

Nianwen Xue
Fei Xia
Fu dong Chiou
Martha Palmer

The Chinese PropBank has labeled the predicateargument structures of sentences from the Chinese TreeBank ( Xue et al. 2005 ) . It is constituted of two parts .

The Chinese PropBank has labeled the predicateargument structures of sentences from the Chinese TreeBank ( @@CITATION ) .


computing semantic relatedness across parts of speech

This is an important property if semantic relatedness is used in information retrieval where users tend to use specific search terms ( Porsche ) rather than general ones ( car ) . Furthermore , manually selected word pairs are often biased towards highly related pairs ( Gurevych , 2006 ) , because human annotators tend to select only highly related pairs connected by relations they are aware of . Automatic corpus-based selection of word pairs is more objective , leading to a balanced dataset with pairs connected by all kinds of lexical-semantic relations .

Furthermore , manually selected word pairs are often biased towards highly related pairs ( @@CITATION ) , because human annotators tend to select only highly related pairs connected by relations they are aware of .


constraint projection an efficient treatment of disjunctive feature descriptions

The domain-dependent knowledge used in this module consists of a unification-based lexicon and phrase structure rules . Disjunctive feature descriptions are also possible ; WIT incorporates an efficient method for handling disjunctions ( Nakano , 1991 ) . When a phrase boundary is detected , the feature structure for a phrase is computed using some built-in rules from the feature structure rules for the words in the phrase .

Disjunctive feature descriptions are also possible ; WIT incorporates an efficient method for handling disjunctions ( @@CITATION ) .


bayesian inference for pcfgs via markov chain monte carlo

Mark Johnson
Thomas Griffiths
Sharon Goldwater

Since there is no way to analytically compute these modes , we resort to Gibbs sampling to find an approximate solution . Our strategy is based on the approach presented by Johnson et al. ( 2007 ) . At a high level , we alternate between resampling model parameters ( Î¸ROOT , Î¸BIN , Î¸UN , Î¸TERM , Î» , Î¸LCTX , Î¸RCTX ) given the current set of parse trees and resampling those trees given the

Our strategy is based on the approach presented by @@CITATION .


a comparative evaluation of collocation extraction techniques

The main benefits of this acquisition technique lie in the inferred patterns . Indeed , contrary to the more classical statistical methods ( Mutual Information , Loglike ... , see below ) used for collocation acquisition ( see ( Pearce , 2002 ) for a review ) , these patterns allow : 1 .

Indeed , contrary to the more classical statistical methods ( Mutual Information , Loglike ... , see below ) used for collocation acquisition ( see ( @@CITATION ) for a review ) , these patterns allow :


( The green chair , said in the presence of two greenish chairs , would refer to the one that is closest to prototypical green . ) A further complication is that different speakers can regard very different values as prototypical , making it difficult to assess which of two objects is greener even on one dimension ( Berlin and Kay 1969 , pages 10 -- 12 ) . ( Ideally , GRE should also take into account that the meaning of color words can differ across different types of referent .

A further complication is that different speakers can regard very different values as prototypical , making it difficult to assess which of two objects is greener even on one dimension ( @@CITATION , pages 10 -- 12 ) .


S Della Pietra
V Della Pietra
J Lafferty

â¢ If arc probabilities ( or even A , v , Âµ , Ï ) have loglinear parameterization , then the E step must compute c = Ei ecf ( xi , yi ) , where ec ( x , y ) denotes the expected vector of total feature counts along a random path in fÎ¸ whose ( input , output ) matches ( x , y ) . The M step then treats c as fixed , observed data and adjusts 0 until the predicted vector of total feature counts equals c , using Improved Iterative Scaling ( Della Pietra et al. , 1997 ; Chen and Rosenfeld , 1999 ) .12 For globally normalized , joint models , the predicted vector is ecf ( E * , A * ) .

The M step then treats c as fixed , observed data and adjusts 0 until the predicted vector of total feature counts equals c , using Improved Iterative Scaling ( Della @@CITATION ; Chen and


gesture generation by imitation  from human behavior to computer character animation

For this study , we added semantic labels -- including dialogue acts -- and gesture annotation . Both kinds of annotation were carried out using ANVIL ( Kipp , 2004 ) . To distinguish among the various functions that feedback expressions have in the dialogues , we selected a subset of the categories defined in the emerging ISO 24617-2 standard for semantic annotation of language resources .

Both kinds of annotation were carried out using ANVIL ( @@CITATION ) .


the ui system in the hoo 2012 shared task on error correction

Because the Google corpus does not contain complete sentences but only n-gram counts of length up to five , training a discriminative model is not desirable , and we thus use NB ( details in Rozovskaya and Roth ( 2011 ) ) . The article classifier is a discriminative model that draws on the state-of-the-art approach described in Rozovskaya et al. ( 2012 ) . The model makes use of the Averaged Perceptron ( AP ) algorithm ( Freund and Schapire , 1996 ) and is trained on the training data of the shared task with rich features .

The article classifier is a discriminative model that draws on the state-of-the-art approach described in @@CITATION .


modeling the shape of the scene a holistic representation of the spatial envelope

The language grounding problem has received significant attention in recent years , owed in part to the wide availability of data sets ( e.g. Flickr , Von Ahn ( 2006 ) ) , computing power , improved computer vision models ( Oliva and Torralba , 2001 ; Lowe , 2004 ; Farhadi et al. , 2009 ; Parikh and Grauman , 2011 ) and neurological evidence of ties between the language , perceptual and motor systems in the brain ( Pulverm Â¨ uller et al. , 2005 ; Tettamanti et al. , 2005 ; Aziz-Zadeh et al. , 2006 ) . Many approaches to multimodal research have succeeded by abstracting away raw perceptual information and using high-level representations instead .

The language grounding problem has received significant attention in recent years , owed in part to the wide availability of data sets ( e.g. Flickr , Von Ahn ( 2006 ) ) , computing power , improved computer vision models ( @@CITATION ; Lowe , 2004 ; Farhadi et al. , 2009 ; Parikh and Grauman , 2011 ) and neurological evidence of ties between the language , perceptual and motor systems in the brain ( Pulverm Â¨ uller et al. , 2005 ; Tettamanti et al. , 2005 ; Aziz-Zadeh et al. , 2006 ) .


The disambiguation of capitalized words in ambiguous positions leads to the identification of proper names ( or their derivatives ) , and in this article we will use these two terms and the term case normalization interchangeably . Church ( 1995 , p. 294 ) studied , among other simple text normalization techniques , the effect of case normalization for different words and showed that `` sometimes case variants refer to the same thing ( hurricane and Hurricane ) , sometimes they refer to different things ( continental and Continental ) and sometimes they do n't refer to much of anything ( e.g. , anytime and Anytime ) . '' Obviously these differences arise because some capitalized words stand for proper names ( such as Continental , the name of an airline ) and some do not .

@@CITATION , p. 294 ) studied , among other simple text normalization techniques , the effect of case normalization for different words and showed that `` sometimes case variants refer to the same thing ( hurricane and Hurricane ) , sometimes they refer to different things ( continental and Continental ) and sometimes they do n't refer to much of anything ( e.g. , anytime and Anytime ) . ''


the estimation of stochastic contextfree grammars using the insideoutside algorithm computer speech and language

The process is similar to that for computing the probability of the entire sentence from the probabilities of substrings ( called Inside Probabilities ) . We follow the notation convention of Lari and Young ( 1990 ) . The inside probability of a nonterminal X generating the substring wi ... wj is denoted as e ( X , i , j ) ; it is the sum of the probabilities of all possible subtrees that have X as the root and wi ... wj as the leaf nodes .

We follow the notation convention of @@CITATION .


words are not enough sentence level natural language watermarking

Mercan Topkara
Umut Topkara
Mikhail J Atallah

The first lexical substitution method was proposed by Chapman and Davida ( 1997 ) . Later works , such as Atallah et al. ( 2001a ) , Bolshakov ( 2004 ) , Taskiran et al. ( 2006 ) and Topkara et al. ( 2006b ) , further made use of part-ofspeech taggers and electronic dictionaries , such as WordNet and VerbNet , to increase the robustness of the method . Taskiran et al. ( 2006 ) attempt to use context by prioritizing the alternatives using an ngram language model ; that is , rather than randomly choose an option from the synonym set , the system relies on the language model to select the synonym .

Later works , such as Atallah et al. ( 2001a ) , Bolshakov ( 2004 ) , Taskiran et al. ( 2006 ) and @@CITATIONb ) , further made use of part-ofspeech taggers and electronic dictionaries , such as WordNet and VerbNet , to increase the robustness of the method .


placing search in context the concept revisited

Lev Finkelstein
Evgeniy Gabrilovich
Yossi Matias
Ehud Rivlin
Zach Solan
Gadi Wolfman

Resnik ( 1995 ) reported a correlation of r = .9026.10 The results are not directly comparable , because he only used noun-noun pairs , words instead of concepts , a much smaller dataset , and measured semantic similarity instead of semantic relatedness . Finkelstein et al. ( 2002 ) did not report inter-subject correlation for their larger dataset . Gurevych ( 2006 ) reported a correlation of r = .69 .

@@CITATION did not report inter-subject correlation for their larger dataset .


dialectal to standard arabic paraphrasing to improve arabicenglish statistical machine translation

Comparing the best performer to the OOV selection mode system shows that translating low frequency in-vocabulary dialectal words and phrases to their MSA paraphrases can improve the English translation . This is a similar conclusion to our previous work in Salloum and Habash ( 2011 ) . 6.1.3 Results on the Blind Test Sets

This is a similar conclusion to our previous work in @@CITATION .


an information measure for classification

We train the system by clustering the `` experiences '' of the response-generation methods in addressing requests , where each experience is characterized by the value of the confidence measure employed by a method and its subsequent performance , reflected by precision and recall ( Equations ( 7 ) and ( 8 ) , respectively ) . We then use the program Snob ( Wallace and Boulton 1968 ; Wallace 2005 ) to cluster these experiences . Figure 8 ( a ) is a projection of the centroids of the clusters produced by Snob into the three most significant dimensions discovered by Principal Component Analysis ( PCA ) -- these dimensions account for 95 % of the variation in the data .

We then use the program Snob ( @@CITATION ; Wallace 2005 ) to cluster these experiences .


understanding unsegmented user utterances in realtime spoken dialogue systems

Mikio Nakano
Noboru Miyazalci
Jun-ichi Hirasawa
Kohji Dohsaka
Takeshi Kawabata

paper . The priorities are used for disambiguating interpretation in the incremental understanding method ( Nakano et al. , 1999b ) . When the command on the right-hand side of the arrow is a frame operation command , phrases to which this rule can be applied can be considered a sentence , and the sentence 's semantic representation is the command for updating the dialogue state .

The priorities are used for disambiguating interpretation in the incremental understanding method ( @@CITATIONb ) .


a program for aligning sentences in bilingual corpora

Aligning English-Chinese parallel texts is already very difficult because of the great differences in the syntactic structures and writing systems of the two languages . A number of alignment techniques have been proposed , varying from statistical methods ( Brown et al. , 1991 ; Gale and Church , 1991 ) to lexical methods ( Kay and Roscheisen , 1993 ; Chen , 1993 ) . The method we adopted is that of Simard et al. ( 1992 ) .

A number of alignment techniques have been proposed , varying from statistical methods ( Brown et al. , 1991 ; @@CITATION ) to lexical methods ( Kay and Roscheisen , 1993 ; Chen , 1993 ) .


The denotational semantics of RQLF structures involving instantiated scope and referent metavariables is given in terms of simple interpretation rules that have the effect of interpreting the quantifiers as having the scopes indicated by the lists of indices , and the pronouns as having the interpretation of the instantiation of the metavariable ( in these cases at least ) . Alshawi and Crouch ( 1992 ) present an illustrative first-order fragment along these lines and are able to supply a coherent formal semantics for the CLF-QLFs themselves , using a technique essentially equivalent to supervaluations : a QLF is true iff all its possible RQLFs are , false iff they are all false , and undefined otherwise . There are many good things about this approach .

@@CITATION present an illustrative first-order fragment along these lines and are able to supply a coherent formal semantics for the CLF-QLFs themselves , using a technique essentially equivalent to supervaluations : a QLF is true iff all its possible RQLFs are , false iff they are all false , and undefined otherwise .


moses open source toolkit for statistical machine translation

Philipp Koehn
Hieu Hoang
Alexandra Birch
Christopher Callison-Burch
Marcello Federico
Nicola Bertoldi
Brooke Cowan
Wade Shen
Christine Moran
Richard Zens
Christopher Dyer
Ondrej Bojar
Alexandra Constantin
Evan Herbst

We use the open-source Moses toolkit ( Koehn et al. , 2007 ) to build a phrase-based SMT system trained on mostly MSA data ( 64M words on the Arabic side ) obtained from several LDC corpora including some limited DA data . Our system uses a standard phrase-based architecture .

We use the open-source Moses toolkit ( @@CITATION ) to build a phrase-based SMT system trained on mostly MSA data ( 64M words on the Arabic side ) obtained from several LDC corpora including some limited DA data .


the representation of lexical semantic information cognitive science research paper csrp 280

Another common approach to lexical rules is to encode them as unary phrase structure rules . This approach is taken , for example , in LKB ( Copestake 1992 ) where lexical rules are introduced on a par with phrase structure rules and the parser makes no distinction between lexical and nonlexical rules ( Copestake 1993 , 31 ) . A similar method is included in PATR-II ( Shieber et al. 1983 ) and can be used to encode lexical rules as binary relations in the CUF system ( Dorre and Eisele 1991 ; Done and Dorna 1993b ) or the TFS system ( Emele and Zajac 1990 ; Emele 1994 ) .

This approach is taken , for example , in LKB ( @@CITATION ) where lexical rules are introduced on a par with phrase structure rules and the parser makes no distinction between lexical and nonlexical rules ( Copestake 1993 , 31 ) .


text segmentation based on similarity between words

Our spread activation based semantic measure ( R98 ( â , sa ) ) improved accuracy . This confirms that although Kozima 's approach ( Kozima , 1993 ) is computationally expensive , it does produce more precise segmentation . The most significant improvement was due to our ranking scheme which linearises the cosine coefficient , .

This confirms that although Kozima 's approach ( @@CITATION ) is computationally expensive , it does produce more precise segmentation .


hybrid text mining for finding abbreviations and their definitions”

that this does not presuppose the existence of a corpus in which the current document is similar to other documents . Park and Byrd ( 2001 ) recently described a hybrid method for finding abbreviations and their definitions . This method first applies an `` abbreviation recognizer '' that generates a set of `` candidate abbreviations '' for a document .

@@CITATION recently described a hybrid method for finding abbreviations and their definitions .


Accordingly , they generate lexical correspondences by means of co-occurrence measures and string similarity metrics . More specifically , the notion of the phrasal lexicon ( used first by Becker 1975 ) has been used successfully in a number of areas : â¢ Learnability ( Zernik and Dyer 1987 ) â¢ Text generation ( Hovy 1988 ; Milosavljevic , Tulloch , and Dale 1996 ) â¢ Speech generation ( Rayner and Carter 1997 ) â¢ Localization ( Sch Â¨ aler 1996 )

More specifically , the notion of the phrasal lexicon ( used first by @@CITATION ) has been used successfully in a number of areas :


the automatic acquisition of frequencies of verb subcategorization frames from tagged corpora

Akira Ushioda
David Evans
Ted Gibson
Alex Waibel

Brent used hypothesis testing on binomial frequency data to statistically filter the induced frames . Ushioda et al. ( 1993 ) run a finite-state NP parser on a POS-tagged corpus to calculate the relative frequency of the same six subcategorization verb classes . The experiment is limited by the fact that all prepositional phrases are treated as adjuncts .

@@CITATION run a finite-state NP parser on a POS-tagged corpus to calculate the relative frequency of the same six subcategorization verb classes .


knowledge extraction for clinical question answering preliminary results

The automatic extraction of PICO elements from MEDLINE citations represents a key capability integral to clinical question answering . This section , which elaborates on preliminary results reported in Demner-Fushman and Lin ( 2005 ) , describes extraction algorithms for population , problems , interventions , outcomes , and the strength of evidence . For an example of a completely annotated abstract , see Figure 2 .

This section , which elaborates on preliminary results reported in @@CITATION , describes extraction algorithms for population , problems , interventions , outcomes , and the strength of evidence .


intended models circumscription and commonsense reasoningquot

This immediate information may be insufficient to decide the truth of certain predicates . It would seem therefore that the iteration of the PT operation to form a closure is needed ( cfXXX Zadrozny 1987b ) . However , there are at least three arguments against iterating PT .

It would seem therefore that the iteration of the PT operation to form a closure is needed ( cfXXX @@CITATIONb ) .


achieving incremental semantic interpretation through contextual representation

Julie Sedivy
Michael Tanenhaus
Craig Chambers
Gregory Carlson

Sedivy et al. ( 1999 ) asked subjects to identify the target of a vague description in a visual scene . Consider the tall cup .

@@CITATION asked subjects to identify the target of a vague description in a visual scene .


products of random latent variable grammars

Second , the diversity of the individual grammars controls the gains that can be obtained by combining multiple grammars into a product model . Our most accurate single grammar achieves an F score of 91.6 on the WSJ test set , rivaling discriminative reranking approaches ( Charniak and Johnson , 2005 ) and products of latent variable grammars ( Petrov , 2010 ) , despite being a single generative PCFG . Our most accurate product model achieves an F score of 92.5 without the use of discriminative reranking and comes close to the best known numbers on this test set ( Zhang et al. , 2009 ) .

Our most accurate single grammar achieves an F score of 91.6 on the WSJ test set , rivaling discriminative reranking approaches ( Charniak and Johnson , 2005 ) and products of latent variable grammars ( @@CITATION ) , despite being a single generative PCFG .


targeted help for spoken dialogue systems intelligent feedback improves naive users’ performance

Beth Ann Hockey
Oliver Lemon
Ellen Campana
Laura Hiatt
Gregory Aist
James Hieronymus
Alexander Gruenstein
John Dowding

Since the system accepts unrestricted input , interpretation errors are unavoidable . Our recovery policy is modeled on the TargetedHelp ( Hockey et al. , 2003 ) policy used in task-oriented dialogue . If the system can not find an interpretation for an utterance , it attempts to produce a message that describes the problem but without giving away the answer , for example , `` I 'm sorry , I 'm having a problem understanding .

Our recovery policy is modeled on the TargetedHelp ( @@CITATION ) policy used in task-oriented dialogue .


efficient contextsensitive generation of referring expressions

It has been argued that , in an incremental approach , gradable properties should be given a low preference ranking because they are difficult to process ( Krahmer and Theune 2002 ) . We have seen in Section 4.3 that generation and interpretation of vague descriptions does have a slightly higher computational complexity than that of nonvague descriptions .

It has been argued that , in an incremental approach , gradable properties should be given a low preference ranking because they are difficult to process ( @@CITATION ) .


typed feature structures as descriptions

Typed feature structures as normal form TFC terms are merely syntactic objects . ` See ( King , 1994 ) for a discussion of the appropriateness of TIG for HPSG and a comparison with other feature logic approaches designed for HPSG . which are used to restrict lexical entries .

` See ( @@CITATION ) for a discussion of the appropriateness of TIG for HPSG and a comparison with other feature logic approaches designed for HPSG .


decision graphs—an extension of decision trees

Hence , throughout the course of this project , the different methods had minor implementational variations , which do not affect the overall insights of this research . Specifically , we used Decision Graphs ( Oliver 1993 ) for Doc-Pred , and SVMs ( Vapnik 1998 ) for Sent-Pred .11 Additionally , we used unigrams for clustering documents and sentences , and unigrams and bigrams for predicting document clusters and sentence clusters ( Sections 3.1.2 and 3.2.2 ) . Because this variation was uniformly implemented for both approaches , it does not affect their relative performance .

Specifically , we used Decision Graphs ( @@CITATION ) for Doc-Pred , and SVMs ( Vapnik 1998 ) for Sent-Pred .11 Additionally , we used unigrams for clustering documents and sentences , and unigrams and bigrams for predicting document clusters and sentence clusters ( Sections 3.1.2 and 3.2.2 ) .


building parallel ltag for french and italian

The above equation holds regardless of how we represent concepts . There are many plausible representations , such as pairs of trees from synchronous tree adjoining grammars ( Abeille et al. 1990 ; Shieber 1994 ; Candito 1998 ) , lexical conceptual structures ( Dorr 1992 ) and WordNet synsets ( Fellbaum 1998 ; Vossen 1998 ) . Of course , for a representation to be used , a method must exist for estimating its distribution in data .

There are many plausible representations , such as pairs of trees from synchronous tree adjoining grammars ( Abeille et al. 1990 ; Shieber 1994 ; @@CITATION ) , lexical conceptual structures ( Dorr 1992 ) and WordNet synsets ( Fellbaum 1998 ; Vossen 1998 ) .


Collin F Baker
Charles J Fillmore
John B Lowe

These include , just to mention the most popular ones , DIRT ( Lin and Pantel , 2001 ) , VerbOcean ( Chklovski and Pantel , 2004 ) , FrameNet ( Baker et al. , 1998 ) , and Wikipedia ( Mehdad et al. , 2010 ; Kouylekov et al. , 2009 ) . DIRT is a collection of statistically learned inference rules , that is often integrated as a source of lexical paraphrases and entailment rules .

ones , DIRT ( Lin and Pantel , 2001 ) , VerbOcean ( Chklovski and Pantel , 2004 ) , FrameNet ( @@CITATION ) , and Wikipedia ( Mehdad et al. , 2010 ; Kouylekov et al. , 2009 ) .


on implementing an hpsg theory aspects of the logical architecture the formalization and the implementation of headdriven phrase structure grammars

In the above example , this would result in two lexical rules : one for words with t1 as their c value and one for those with t2 as their c value . In the latter case , we can also take care of transferring the value of z. However , as discussed by Meurers ( 1994 ) , creating several instances of lexical rules can be avoided . Instead , the disjunctive possibilities introduced by the frame specification are attached as a constraint to a lexical rule .

In the latter case , we can also take care of transferring the value of z. However , as discussed by @@CITATION , creating several instances of lexical rules can be avoided .


automatic stochastic tagging of natural language texts

The combination of likelihood and prior modeling , HMMs , and Viterbi decoding is fundamentally the same as the standard probabilistic approaches to speech recognition ( Bahl , Jelinek , and Mercer 1983 ) and tagging ( Church 1988 ) . It maximizes the probability of getting the entire DA sequence correct , but it does not necessarily find the DA sequence that has the most DA labels correct ( Dermatas and Kokkinakis 1995 ) . To minimize the total number of utterance labeling errors , we need to maximize the probability of getting each DA label correct individually , i.e. , we need to maximize P ( U11E ) for each i = 1 , ... , n .

It maximizes the probability of getting the entire DA sequence correct , but it does not necessarily find the DA sequence that has the most DA labels correct ( @@CITATION ) .


representation trees and stringtree correspondences

An interval is assigned to each word in the sentence , i.e. ( 0-1 ) for `` John '' , ( 1-2 ) for `` picks '' , ( 2-3 ) for `` the '' , ( 3-4 ) for `` box '' and ( 4-5 ) for `` up '' . A substring in the sentence that corresponds to a node in the representation tree is denoted by assigning the interval of the substring to SNODE of 2 These definitions are based on the discussion in ( Tang , 1994 ) and Boitet & Zaharin ( 1988 ) . the node , e.g. the node `` picks up '' with SNODE intervals ( 1-2 +4 -5 ) corresponds to the words `` picks '' and `` up '' in the string with the similar intervals.The correspondence between subtrees and substrings are denoted by the interval assigned to the STREE of each node , e.g. the subtree rooted at node `` picks up '' with STREE interval ( 0-5 ) corresponds to the whole sentence `` John picks the box up '' .

A substring in the sentence that corresponds to a node in the representation tree is denoted by assigning the interval of the substring to SNODE of 2 These definitions are based on the discussion in ( Tang , 1994 ) and @@CITATION .


classbased ngram models of natural language

Peter F Brown
Vincent J Della Pietra
Peter V Desouza
Jennifer C Lai
Robert L Mercer

Finally , we introduced the idea of evaluating induction systems based on their ability to produce useful cluster prototypes . We found that the oldest system ( Brown et al. , 1992 ) yielded the best prototypes , and that using these prototypes gave state-of-the-art performance on WSJ , as well as improvements on nearly all of the non-English corpora . These promising results suggest a new direction for future research : improving POS induction by developing methods targeted towards extracting better prototypes , rather than focusing on improving clustering of the entire data set .

We found that the oldest system ( @@CITATION ) yielded the best prototypes , and that using these prototypes gave state-of-the-art performance on WSJ , as well as improvements on nearly all of the non-English corpora .


linking wordnet verb classes to semantic interpretation

In this section , we explain the predicate communicate so that the algorithm may be followed by the reader . Other definitions of predicates may be found in ( Gomez , 1998 ) . ferences between teach and its superpredicate , communicate are as follows .

Other definitions of predicates may be found in ( @@CITATION ) .


syntacticsemantic structures for textual entailment recognition

Yashar Mehdad
Alessandro Moschitti
Fabio Massimo Zanzotto

Using the same approach discussed in Section 4 , we compare the results achieved with English paraphrase tables with those obtained with other widely used monolingual knowledge resources over two RTE datasets . For the sake of completeness , we report in this section also the results obtained adopting the `` basic solution '' proposed by ( Mehdad et al. , 2010 ) . Although it was presented as an approach to CLTE , the proposed method brings the problem back to the monolingual case by translating H into the language of T .

For the sake of completeness , we report in this section also the results obtained adopting the `` basic solution '' proposed by ( @@CITATION ) .


sentence planning as description using tree adjoining grammar

3The sp-tree is inspired by ( Lavoie and Rambow , 1998 ) . The representations used by Danlos ( 2000 ) , Gardent and Webber ( 1998 ) , or Stone and Doran ( 1997 ) are similar , but do not ( always ) explicitly represent the clause combining operations as labeled nodes . tem5 in Dialog D1 .

The representations used by Danlos ( 2000 ) , Gardent and Webber ( 1998 ) , or @@CITATION are similar , but do not ( always ) explicitly represent the clause combining operations as labeled nodes .


the use of classifiers in sequential inference

The outcomes of these classifiers are then combined in a way that satisfies some constraints -- non-overlapping constraints in this case -- using an efficient constraint satisfaction mechanism that makes use of the confidence in the classifier 's outcomes . Since earlier versions of the SNoW based CSCL were used only to identify single phrases ( Punyakanok and Roth , 2001 ; Munoz et al. , 1999 ) and never to identify a collection of several phrases at the same time , as we do here , we also trained and tested it under the exact conditions of CoNLL-2000 ( Tjong Kim Sang and Buchholz , 2000 ) to compare it to other shallow parsers . Table 1 shows that it ranks among the top shallow parsers evaluated there 1 .

Since earlier versions of the SNoW based CSCL were used only to identify single phrases ( @@CITATION ; Munoz et al. , 1999 ) and never to identify a collection of several phrases at the same time , as we do here , we also trained and tested it under the exact conditions of CoNLL-2000 ( Tjong Kim Sang and Buchholz , 2000 ) to compare it to other shallow parsers .


automatic generation of a coarse grained wordnet

It is also used to add a gloss for each word sense that enables test subjects to distinguish between senses . If differences in meaning between senses are very fine-grained , distinguishing between them is hard even for humans ( Mihalcea and Moldovan , 2001 ) .6 Pairs containing such words are not suitable for evaluation . To limit their impact on the experiment , a threshold for the maximal number of senses can be defined .

If differences in meaning between senses are very fine-grained , distinguishing between them is hard even for humans ( @@CITATION ) .6 Pairs containing such words are not suitable for evaluation .


answering questions in the genomics domain

Fabio Rinaldi
James Dowdall
Gerold Schneider
Andreas Persidis

Patient information is no doubt important to answering clinical questions , and our work could certainly benefit from experiences gained in the PERSIVAL project . The application of domain models and deep semantic knowledge to question answering has been explored by a variety of researchers ( e.g. , Jacquemart and Zweigenbaum 2003 , Rinaldi et al. 2004 ) , and was also the focus of recent workshops on question answering in restricted domains at ACL 2004 and AAAI 2005 . Our work contributes to this ongoing discourse by demonstrating a specific application in the domain of clinical medicine .

The application of domain models and deep semantic knowledge to question answering has been explored by a variety of researchers ( e.g. , Jacquemart and Zweigenbaum 2003 , @@CITATION ) , and was also the focus of recent workshops on question answering in restricted domains at ACL 2004 and AAAI 2005 .


Scott Deerwester
Susan T Dumais
George W Furnas
Thomas K Landauer
Richard Harshman

cue word and name the first ( or several ) associated words that come to mind ( e.g. , Nelson et al. ( 2004 ) ) , and feature norms , where subjects are given a cue word and asked to describe typical properties of the cue concept ( e.g. , McRae et al. ( 2005 ) ) . Griffiths et al. ( 2007 ) helped pave the path for cognitive-linguistic multimodal research , showing that Latent Dirichlet Allocation outperformed Latent Semantic Analysis ( Deerwester et al. , 1990 ) in the prediction of association norms . Andrews et al. ( 2009 ) furthered this work by showing that a bimodal topic model , consisting of both text and feature norms , outperformed models using only one modality on the prediction of association norms , word substitution errors , and semantic interference tasks .

Griffiths et al. ( 2007 ) helped pave the path for cognitive-linguistic multimodal research , showing that Latent Dirichlet Allocation outperformed Latent Semantic Analysis ( @@CITATION ) in the prediction of association norms .


catching the drift probabilistic content models with applications to generation and summarization

Although not the first to employ a generative approach to directly model content , the seminal work of Barzilay and Lee ( 2004 ) is a noteworthy point of reference and comparison . However , our study differs in several important respects .

Although not the first to employ a generative approach to directly model content , the seminal work of @@CITATION is a noteworthy point of reference and comparison .


We release this list for further use by the research community .2 Future Work : Functionality is one of the several properties a relation can possess . Others include selectional preferences , transitivity ( Schoenmackers et al. , 2008 ) , mutual exclusion , symmetry , etc. . These properties are very useful in increasing our understanding about these Open IE relation strings .

Others include selectional preferences , transitivity ( @@CITATION ) , mutual exclusion , symmetry , etc. .


should we translate the documents or the queries in crosslanguage information retrieval

Applications where word order is not essential include â¢ cross-language information retrieval ( e.g. , McCarley 1999 ) , â¢ multilingual document filtering ( e.g. , Oard 1997 ) , â¢ computer-assisted language learning ( e.g. , Nerbonne et al. 1997 ) , â¢ certain machine-assisted translation tools ( e.g. , Macklovitch 1994 ; Melamed 1996a ) , â¢ concordancing for bilingual lexicography ( e.g. , Catizone , Russell , and Warwick 1989 ; Gale and Church 1991 ) , â¢ corpus linguistics ( e.g. , Svartvik 1992 ) , â¢ `` crummy '' machine translation ( e.g. , Church and Hovy 1992 ; Resnik 1997 ) .

â¢ cross-language information retrieval ( e.g. , @@CITATION ) , â¢ multilingual document filtering ( e.g. , Oard 1997 ) , â¢ computer-assisted language learning ( e.g. , Nerbonne et al. 1997 ) , â¢ certain machine-assisted translation tools ( e.g. , Macklovitch 1994 ; Melamed 1996a ) , â¢ concordancing for bilingual lexicography ( e.g. , Catizone , Russell , and Warwick 1989 ; Gale and Church 1991 ) ,


using clustering to boost text classificationquot

The bulk of the text categorization work has been devoted to cope with automatic categorization of English and Latin character documents . For example , ( Fang et al. , 2001 ) discusses the evaluation of two different text categorization strategies with several variations of their feature spaces . A good study comparing document categorization algorithms can be found in ( Yang and Liu , 1999 ) .

For example , ( @@CITATION ) discusses the evaluation of two different text categorization strategies with several variations of their feature spaces .


proceedings of ace evaluation and pi meeting

We want to investigate the usefulness of stem ngram features in the mention detection system . As stated before , the experiments are run in the ACE '04 framework ( NIST , 2004 ) where the system will identify mentions and will label them ( cfXXX Section 4 ) with a type ( person , organization , etc ) , a sub-type ( OrgCommercial , OrgGovernmental , etc ) , a mention level ( named , nominal , etc ) , and a class ( specific , generic , etc ) . Detecting the mention boundaries ( set of consecutive tokens ) and their main type is one of the important steps of our mention detection system .

As stated before , the experiments are run in the ACE '04 framework ( @@CITATION ) where the system will identify mentions and will label them ( cfXXX Section 4 ) with a type ( person , organization , etc ) , a sub-type ( OrgCommercial , OrgGovernmental , etc ) , a mention level ( named , nominal , etc ) , and a class ( specific , generic , etc ) .


a maximum entropy approach to identifying sentence boundaries”

Automatically trainable software is generally seen as a way of producing systems that are quickly retrainable for a new corpus , for a new domain , or even for another language . Thus , the second class of SBD systems employs machine learning techniques such as decision tree classifiers ( Riley 1989 ) , neural networks ( Palmer and Hearst 1994 ) , and maximum-entropy modeling ( Reynar and Ratnaparkhi 1997 ) . Machine learning systems treat the SBD task as a classification problem , using features such as word spelling , capitalization , suffix , and word class found in the local context of a potential sentence-terminating punctuation sign .

Thus , the second class of SBD systems employs machine learning techniques such as decision tree classifiers ( Riley 1989 ) , neural networks ( Palmer and Hearst 1994 ) , and maximum-entropy modeling ( @@CITATION ) .


a preliminary investigation into sentiment analysis of informal political discourse

tween two speakers , such as explicit assertions ( `` I second that ! '' ) or quotation of messages in emails or postings ( see Mullen and Malouf ( 2006 ) but cfXXX Agrawal et al. ( 2003 ) ) . Agreement evidence can be a powerful aid in our classification task : for example , we can easily categorize a complicated ( or overly terse ) document if we find within it indications of agreement with a clearly positive text .

or quotation of messages in emails or postings ( see @@CITATION but cfXXX Agrawal et al. ( 2003 ) ) .


how many words is a picture worth automatic caption generation for news images

As computer vision techniques have improved over the past decade , other research has begun directly using visual information in place of feature norms . The first work to do this with topic models is Feng and Lapata ( 2010b ) . They use a Bag of Visual Words ( BoVW ) model ( Lowe , 2004 ) to create a bimodal vocabulary describing documents .

The first work to do this with topic models is @@CITATIONb ) .


an algebra for semantic construction in constraintbased grammars

In contrast , the bottom feature structure encodes information that remains local to the node at which adjunction takes place . The language chosen for semantic representation is a flat semantics along the line of ( Bos , 1995 ; Copestake et al. , 1999 ; Copestake et al. , 2001 ) . However because we are here focusing on paraphrases rather than fine grained semantic distinctions , the underspecification and the description of the scope relations permitted by these semantics will here be largely ignored and flat semantics will be principally used as a convenient way of describing predicate/arguments and modifiers/modified relationships .

The language chosen for semantic representation is a flat semantics along the line of ( Bos , 1995 ; Copestake et al. , 1999 ; @@CITATION ) .


In particular , both developer-oriented ( e.g. , related to the selection of optimal resolution factors ) and application-oriented ( e.g. , related to the requirement of the application , as in the case of information extraction , where a proper name antecedent is needed ) evaluation metrics should be considered . Tetreault 's contribution features comparative evaluation involving the author 's own centering-based pronoun resolution algorithm called the Left-Right Centering algorithm ( LRC ) as well as three other pronoun resolution methods : Hobbs 's naive algorithm ( Hobbs 1978 ) , BFP ( Brennan , Friedman , and Pollard 1987 ) , and Strube 's 5list approach ( Strube 1998 ) . The LRC is an alternative to the original BFP algorithm in that it processes utterances incrementally .

Tetreault 's contribution features comparative evaluation involving the author 's own centering-based pronoun resolution algorithm called the Left-Right Centering algorithm ( LRC ) as well as three other pronoun resolution methods : Hobbs 's naive algorithm ( @@CITATION ) , BFP ( Brennan , Friedman , and Pollard 1987 ) , and Strube 's 5list approach ( Strube 1998 ) .


biographies bollywood boomboxes and blenders domain adaptation for sentiment classification

John Blitzer
Mark Dredze
Fernando Pereira

The features we employ scale well across domains , given that the opinion target vocabularies are substantially different . For future work , we might investigate how machine learning algorithms , which are specifically designed for the problem of domain adaptation ( Blitzer et al. , 2007 ; Jiang and Zhai , 2007 ) , perform in comparison to our approach . Since three of the features we employed in

For future work , we might investigate how machine learning algorithms , which are specifically designed for the problem of domain adaptation ( @@CITATION ; Jiang and Zhai , 2007 ) , perform in comparison to our approach .


accurate methods for the statistics of surprise and coincidence

figures in brackets give the average number of generalised levels . The X2 statistic is performing at least as well as G2 , throwing doubt on the claim by Dunning ( 1993 ) that the G2 statistic is better suited for use in corpus-based NLP . The results show clearly that the average level of generalisation is slightly higher for G2 than X2 .

The X2 statistic is performing at least as well as G2 , throwing doubt on the claim by @@CITATION that the G2 statistic is better suited for use in corpus-based NLP .


paraphrase fragment extraction from monolingual comparable corpora

All the word alignments ( excluding stop-words ) with positive scores are selected as candidate fragment elements . Provided with the candidate fragment elements , we previously ( Wang and Callison-Burch , 2011 ) used a chunker3 to finalize the output fragments , in order to follow the linguistic definition of a ( para - ) phrase . We extend this step in the current system by applying a dependency parser to constrain the boundary of the fragments ( Sec .

Provided with the candidate fragment elements , we previously ( @@CITATION ) used a chunker3 to finalize the output fragments , in order to follow the linguistic definition of a ( para - ) phrase .


and orthographic similarity in visual word recognition

Their computational significance arises from the issue of their storage in lexical resources like WordNet ( Fellbaum , 1998 ) and raises the questions like , how to store morphologically complex words , in a lexical resource like WordNet keeping in mind the storage and access efficiency . There is a rich literature on organization and lexical access of morphologically complex words where experiments have been conducted mainly for derivational suffixed words of English , Hebrew , Italian , French , Dutch , and few other languages ( Marslen-Wilson et al. , 2008 ; Frost et al. , 1997 ; Grainger , et al. , 1991 ; Drews and Zwitserlood , 1995 ) . However , we do not know of any such investigations for Indian languages , which

There is a rich literature on organization and lexical access of morphologically complex words where experiments have been conducted mainly for derivational suffixed words of English , Hebrew , Italian , French , Dutch , and few other languages ( Marslen-Wilson et al. , 2008 ; Frost et al. , 1997 ; Grainger , et al. , 1991 ; @@CITATION ) .


the mathematics of statistical machine translation parameter estimationquot

P F Brown
V J Della Pietra
S A Della Pietra
R L Mercer

from those that do not . This method of incorporating dictionary information seems simpler than the method proposed by Brown et al. for their models ( Brown et al. , 1993b ) . When the hidden parameters are conditioned on different link classes , the estimation method does not change ; it is just repeated for each link class .

This method of incorporating dictionary information seems simpler than the method proposed by Brown et al. for their models ( @@CITATIONb ) .


a generative constituentcontext model for improved grammar induction

In general , this means constructing inductive biases that take advantage of unannotated data to train probabilistic models . One important example is the constituentcontext model ( CCM ) of Klein and Manning ( 2002 ) , which was specifically designed to capture the linguistic observation made by Radford ( 1988 ) that there are regularities to the contexts in which constituents appear . This phenomenon , known as substitutability , says that phrases of the same type appear in similar contexts .

One important example is the constituentcontext model ( CCM ) of @@CITATION , which was specifically designed to capture the linguistic observation made by Radford ( 1988 ) that there are regularities to the contexts in which constituents appear .


stylebook for the japanese treebank in verbmobil verbmobilreport 240 seminar f¨ur sprachwissenschaft

Typical examples are Bulgarian ( Simov et al. , 2005 ; Simov and Osenova , 2003 ) , Chinese ( Chen et al. , 2003 ) , Danish ( Kromann , 2003 ) , and Swedish ( Nilsson et al. , 2005 ) . Japanese ( Kawata and Bartels , 2000 ) , despite a very high accuracy , is different in that attachment score drops from 98 % to 85 % , as we go from length 1 to 2 , which may have something to do with the data consisting of transcribed speech with very short utterances . A second observation is that a high proportion of non-projective structures leads to fragmentation in the parser output , reflected in lower precision for roots .

Japanese ( @@CITATION ) , despite a very high accuracy , is different in that attachment score drops from 98 % to 85 % , as we go from length 1 to 2 , which may have something to do with the data consisting of transcribed speech with very short utterances .


introduction to arabic natural language processing

In comparison , the tag set of the Buckwalter Morphological Analyzer ( Buckwalter 2004 ) used in the PATB has a core POS set of 44 tags ( CORE44 ) before morphological extension .8 Cross-linguistically , a core set containing around 12 tags is often 7 We ignore the rare `` false idafa '' construction ( Habash 2010 , p. 102 ) . 8 The 44 tags in CORE44 are based on the tokenized version of Arabic words .

7 We ignore the rare `` false idafa '' construction ( @@CITATION , p. 102 ) .


Various approaches for computing semantic relatedness of words or concepts have been proposed , e.g. dictionary-based ( Lesk , 1986 ) , ontology-based ( Wu and Palmer , 1994 ; Leacock and Chodorow , 1998 ) , information-based ( Resnik , 1995 ; Jiang and Conrath , 1997 ) or distributional ( Weeds and Weir , 2005 ) . The knowledge sources used for computing relatedness can be as different as dictionaries , ontologies or large corpora .

Various approaches for computing semantic relatedness of words or concepts have been proposed , e.g. dictionary-based ( Lesk , 1986 ) , ontology-based ( @@CITATION ; Leacock and Chodorow , 1998 ) , information-based ( Resnik , 1995 ; Jiang and Conrath , 1997 ) or distributional ( Weeds and Weir , 2005 ) .


h is a feature vector which is scaled by a weight W. Parameter estimation is one of the most important components in SMT , and various training methods have been proposed to tune W . Some methods are based on likelihood ( Och and Ney , 2002 ; Blunsom et al. , 2008 ) , error rate ( Och , 2003 ; Zhao and Chen , 2009 ; Pauls et al. , 2009 ; Galley and Quirk , 2011 ) , margin ( Watanabe et al. , 2007 ; Chiang et al. , 2008 ) and ranking ( Hopkins and May , 2011 ) , and among which minimum error rate training ( MERT ) ( Och , 2003 ) is the most popular one . All these training methods follow the same pipeline : they train only a single weight on a given development set , and then use it to translate all the sentences in a test set .

Some methods are based on likelihood ( Och and Ney , 2002 ; Blunsom et al. , 2008 ) , error rate ( Och , 2003 ; Zhao and Chen , 2009 ; Pauls et al. , 2009 ; Galley and Quirk , 2011 ) , margin ( Watanabe et al. , 2007 ; Chiang et al. , 2008 ) and ranking ( @@CITATION ) , and among which minimum error rate training ( MERT ) ( Och , 2003 ) is the most popular one .


a ccg parsing with a supertagfactored model

A category ( s \ np ) / pp might describe an intransitive verb with a prepositional phrase complement ; it combines on the right ( / ) with a constituent with category pp , and then on the left ( \ ) with a noun phrase ( np ) that serves as its subject . We follow Lewis and Steedman ( 2014 ) in allowing a small set of generic , linguistically-plausible unary and binary grammar rules . We further add rules for combining with punctuation to the left and right and allow for the merge rule X â X X of Clark and Curran ( 2007 ) .

We follow @@CITATION in allowing a small set of generic , linguistically-plausible unary and binary grammar rules .


automatic retrieval and clustering of similar words

ture for NPi whose value is the most likely NE type . ( 7 ) NEIGHBOR : Research in lexical semantics suggests that the SC of an NP can be inferred from its distributionally similar NPs ( see Lin ( 1998a ) ) . Motivated by this observation , we create for each of NPi 's ten most semantically similar NPs a NEIGHBOR feature whose value is the surface string of the NP .

( 7 ) NEIGHBOR : Research in lexical semantics suggests that the SC of an NP can be inferred from its distributionally similar NPs ( see @@CITATIONa ) ) .


performance structures a psycholinguistic and linguistic appraisal

Thus syntactic and prosodic structure match when the major constituents of a sentence are roughly equal in length ; for example , the main prosodic phrase break corresponds to the subject-predicate boundary in Waiters who remember well II serve orders correctly . Discrepancies in length throw constituents off balance , and so prosodic phrasing will cross constituent boundaries in order to give the phrases similar lengths ; this is the case in Chickens were eating II the remaining green vegetables , where the subject-predicate boundary finds no prosodic correspondent .4 The most explicit version of this approach is the analysis presented in Gee and Grosjean ( 1983 ) ( henceforth G&G ) . Drawing on the psycholinguistic studies mentioned above and on aspects of the grammar of prosody outlined in Selkirk ( 1984 ) , G&G propose an algorithm for mapping syntactic structure onto a hierarchical representation of phrasing ; the rules they present accomplish this by integrating syntactic information ( e.g. constituent structure , left-toright ordering ) with information about constituent length .

Discrepancies in length throw constituents off balance , and so prosodic phrasing will cross constituent boundaries in order to give the phrases similar lengths ; this is the case in Chickens were eating II the remaining green vegetables , where the subject-predicate boundary finds no prosodic correspondent .4 The most explicit version of this approach is the analysis presented in @@CITATION ( henceforth G&G ) .


assessing the discourse factors that influence the quality of machine translation

Junyi Jessy Li
Marine Carpuat
Ani Nenkova

In contrast , the model we propose here can be used to predict when segmentation is at all necessary . Our approach to the problem is more compatible with the empirical evidence we presented in our prior work ( Li et al. , 2014 ) where we analyzed the output of Chinese to English machine translation and found that there is no correlation between sentence length and MT quality . Rather we showed that the quality of translation was markedly inferior , compared to overall translation quality , for sentences that were translated into multiple English sentences .

Our approach to the problem is more compatible with the empirical evidence we presented in our prior work ( @@CITATION ) where we analyzed the output of Chinese to English machine translation and found that there is no correlation between sentence length and MT quality .


an efficient algorithm for projective dependency parsing

Statistics about this split ( after conversion to the CATiB dependency format ) are given in Table 1 . For all experiments reported in this section we used the syntactic dependency parser MaltParser v1 .3 ( Nivre 2003 , 2008 ; KÃ¼bler , McDonald , and Nivre 2009 ) , a transition-based parser with an input buffer and a stack , which uses SVM classifiers 10 We use the term `` dev set '' to denote a non-blind test set , used for model development ( feature selection and feature engineering ) .

For all experiments reported in this section we used the syntactic dependency parser MaltParser v1 .3 ( @@CITATION , 2008 ; KÃ¼bler , McDonald , and Nivre 2009 ) , a transition-based parser with an input buffer and a stack , which uses SVM classifiers


robust reference resolution with limited knowledge high precision genrespecific approach for english and polish

The last decade of the 20th century saw a number of anaphora resolution projects for languages other than English such as French , German , Japanese , Spanish , Portuguese , and Turkish . Against the background of a growing interest in multilingual NLP , multilingual anaphora / coreference resolution has gained considerable momentum in recent years ( Aone and McKee 1993 ; Azzam , Humphreys , and Gaizauskas 1998 ; Harabagiu and Maiorano 2000 ; Mitkov and Barbu 2000 ; Mitkov 1999 ; Mitkov and Stys 1997 ; Mitkov , Belguith , and Stys 1998 ) . Other milestones of recent research include the deployment of probabilistic and machine learning techniques ( Aone and Bennett 1995 ; Kehler 1997 ; Ge , Hale , and Charniak 1998 ; Cardie and Wagstaff 1999 ; the continuing interest in centering , used either in original or in revised form ( Abracos and Lopes 1994 ; Strube and Hahn 1996 ; Hahn and Strube 1997 ; Tetreault 1999 ) ; and proposals related to the evaluation methodology in anaphora resolution ( Mitkov 1998a , 2001b ) .

Against the background of a growing interest in multilingual NLP , multilingual anaphora / coreference resolution has gained considerable momentum in recent years ( Aone and McKee 1993 ; Azzam , Humphreys , and Gaizauskas 1998 ; Harabagiu and Maiorano 2000 ; Mitkov and Barbu 2000 ; Mitkov 1999 ; @@CITATION ; Mitkov , Belguith , and Stys 1998 ) .


automatic semantic role labeling for chinese verbs

The test set includes 72 files , which are chtb_001 to chtb_041 , and chtb_900 to chtb_931 . We use the same data setting with Xue ( 2008 ) , however a bit different from Xue and Palmer ( 2005 ) .

We use the same data setting with Xue ( 2008 ) , however a bit different from @@CITATION .


extending the meteor machine translation evaluation metric to the phrase level

Paraphrase tables ( PPHT ) contain pairs of corresponding phrases in the same language , possibly associated with probabilities . They proved to be useful in a number of NLP applications such as natural language generation ( Iordanskaja et al. , 1991 ) , multidocument summarization ( McKeown et al. , 2002 ) , automatic evaluation of MT ( Denkowski and Lavie , 2010 ) , and TE ( Dinu and Wang , 2009 ) . One of the proposed methods to extract paraphrases relies on a pivot-based approach using phrase alignments in a bilingual parallel corpus ( Bannard and Callison-Burch , 2005 ) .

They proved to be useful in a number of NLP applications such as natural language generation ( Iordanskaja et al. , 1991 ) , multidocument summarization ( McKeown et al. , 2002 ) , automatic evaluation of MT ( @@CITATION ) , and TE ( Dinu and Wang , 2009 ) .


the wiki way  quick collaboration on the web

In wikis every document keeps track of its own history : creating a document means to start a history , editing a document to move ahead , restoring to move back onto the history timeline , destroying a document to stop the history itself . Moreover , a sandbox is a temporary view of a document itself i.e. a sandbox can not cause a change in the history ( Cunningham and Leuf , 2001 ) . Figure 1 shows the model .

Moreover , a sandbox is a temporary view of a document itself i.e. a sandbox can not cause a change in the history ( @@CITATION ) .


effective use of wordnet semantics via kernelbased learning

Roberto Basili
Marco Cammisa
Alessandro Moschitti

Our novel composite kernels , which account for the two syntactic structures , are experimented with the appropriate convolution kernels and show significant improvement with respect to the state-ofthe-art in RE . Regarding future work , there are many research line that may be followed : i ) Capturing more features by employing external knowledge such as ontological , lexical resource or WordNet-based features ( Basili et al. , 2005a ; Basili et al. , 2005b ; Bloehdorn et al. , 2006 ; Bloehdorn and Moschitti , 2007 ) or shallow semantic trees , ( Giuglea and Moschitti , 2004 ; Giuglea and Moschitti , 2006 ; Moschitti and Bejan , 2004 ; Moschitti et al. , 2007 ; Moschitti , 2008 ; Moschitti et al. , 2008 ) . ii ) Design a new tree-based structures , which combines the information of both constituent and dependency parses .

Regarding future work , there are many research line that may be followed : i ) Capturing more features by employing external knowledge such as ontological , lexical resource or WordNet-based features ( @@CITATIONa ; Basili et al. , 2005b ; Bloehdorn et al. , 2006 ; Bloehdorn and Moschitti , 2007 ) or shallow semantic trees , ( Giuglea and Moschitti , 2004 ; Giuglea and Moschitti , 2006 ; Moschitti and Bejan , 2004 ; Moschitti et al. , 2007 ; Moschitti , 2008 ; Moschitti et al. , 2008 ) .


perceptual inference through global lexical similarity

Some efforts have tackled tasks such as automatic image caption generation ( Feng and Lapata , 2010a ; Ordonez et al. , 2011 ) , text illustration ( Joshi et al. , 2006 ) , or automatic location identification of Twitter users ( Eisenstein et al. , 2010 ; Wing and Baldridge , 2011 ; Roller et al. , 2012 ) . Another line of research approaches grounded language knowledge by augmenting distributional approaches of word meaning with perceptual information ( Andrews et al. , 2009 ; Steyvers , 2010 ; Feng and Lapata , 2010b ; Bruni et al. , 2011 ; Silberer and Lapata , 2012 ; Johns and Jones , 2012 ; Bruni et al. , 2012a ; Bruni et al. , 2012b ; Silberer et al. , 2013 ) . Although these approaches have differed in model definition , the general goal in this line of research has been to enhance word meaning with perceptual information in order to address one of the most common criticisms of distributional semantics : that the `` meaning of words is entirely given by other words '' ( Bruni et al. , 2012b ) .

Another line of research approaches grounded language knowledge by augmenting distributional approaches of word meaning with perceptual information ( Andrews et al. , 2009 ; Steyvers , 2010 ; Feng and Lapata , 2010b ; Bruni et al. , 2011 ; Silberer and Lapata , 2012 ; @@CITATION ; Bruni et al. , 2012a ; Bruni et al. , 2012b ; Silberer et al. , 2013 ) .


probabilistic inference for machine translation

This problem is exacerbated by syntax-augmented MT with its thousands of nonterminals , and made even worse by its joint source-and-target extension . Future research should apply the work of Blunsom et al. ( 2008 ) and Blunsom and Osborne ( 2008 ) , who marginalize over derivations to find the most probable translation rather than the most probable derivation , to these multi-nonterminal grammars . All source code underlying this work is available under the GNU Lesser General Public License as part of the ` SAMT ' system at : www.cs.cmu.edu/Ëzollmann/samt

Future research should apply the work of Blunsom et al. ( 2008 ) and @@CITATION , who marginalize over derivations to find the most probable translation rather than the most probable derivation , to these multi-nonterminal grammars .


integration of speech recognition and natural language processing in the mit voyager systemquot

V Zue
J Glass
D Goodine
H Leung
M Phillips
J Polifroni
S Seneff

If the parse failed , then the sentence was rejected . We have since improved the interface by incorporating a capability in the recognizer to propose additional solutions in turn once the first one fails to parse ( Zue et al. 1991 ) To produce these `` N-best '' alternatives , we make use of a standard A * search algorithm ( Hart 1968 , Jelinek 1976 ) . Both the A * and the Viterbi search are left-to-right search algorithms .

We have since improved the interface by incorporating a capability in the recognizer to propose additional solutions in turn once the first one fails to parse ( @@CITATION ) To produce these `` N-best '' alternatives , we make use of a standard A * search algorithm ( Hart 1968 , Jelinek 1976 ) .


Curran ( 2003 )

blueprint for a high performance nlp infrastructure

Clark and Curran 's ( 2004 ) work is in parallelising an implementation of log-linear parsing on the Wall Street Journal Corpus , whereas we focus on part-of-speech tagging of a far larger and more varied web corpus , a technique more widely considered a prerequisite for corpus linguistics research . Curran ( 2003 ) 9 http://pie.usna.edu/


efficient generation in primitive optimality theory

As Kager emphasizes , this interaction of violable constraints can yield complex surface patterns . OT therefore holds out the promise of simplifying grammars , by factoring all complex phenomena into simple surface-level constraints that partially mask one another .1 Whether this is always possible under an appropriate definition of `` simple constraints '' ( e.g. , Eisner 1997b ) is of course an empirical question .

OT therefore holds out the promise of simplifying grammars , by factoring all complex phenomena into simple surface-level constraints that partially mask one another .1 Whether this is always possible under an appropriate definition of `` simple constraints '' ( e.g. , @@CITATIONb ) is of course an empirical question .


written as fully specified relations between words , rather , only what is supposed to be changed is specified . Consider , for example , the lexical rule in Figure 2 , which encodes a passive lexical rule like the one presented by Pollard and Sag ( 1987 , 215 ) in terms of the setup of Pollard and Sag ( 1994 , ch . 9 ) .

Consider , for example , the lexical rule in Figure 2 , which encodes a passive lexical rule like the one presented by Pollard and Sag ( 1987 , 215 ) in terms of the setup of @@CITATION , ch .


integrating experiential and distributional data to learn semantic representations

Mark Andrews
Gabriella Vigliocco
David Vinson

The 2D models employing feature norms and association norms do significantly better than the text-only model ( two-tailed t-test ) . This result is consistent with other works using this model with these features ( Andrews et al. , 2009 ; Silberer and Lapata , 2012 ) . We also see that the SURF visual words are able to provide notable , albeit not significant , improvements over the text-only modality .

This result is consistent with other works using this model with these features ( @@CITATION ; Silberer and Lapata , 2012 ) .