the minds system using context and dialog to enhance speech recognitionquot

Current advances in research and development of spoken language systems2 can be found , for example , in the proceedings of the DARPA speech and natural language workshops , as well as in publications from participants of the ESPRIT SUNDIAL project . Representative systems are described in Boisen et al. ( 1989 ) , De Mattia and Giachin ( 1989 ) , Niedermair ( 1989 ) , Niemann ( 1990 ) , and Young ( 1989 ) . * Spoken Language Systems Group , Laboratoiy for Computer Science , MIT , Cambridge MA 02139 f This research was supported by DARPA under Contract N00014-89 +1332 , monitored through the Office of Naval Research .

Representative systems are described in Boisen et al. ( 1989 ) , De Mattia and Giachin ( 1989 ) , Niedermair ( 1989 ) , Niemann ( 1990 ) , and @@CITATION .


a holistic lexiconbased approach to opinion mining

prosodic structure and spoken word recognition

The boundaries that separate phonological phrases are the candidates for prosodic phrase boundaries , since the prosodic phrases of speech consist of one or more phonological phrases . Our rules for phonological word formation are adopted , for the most part , from G & G , Grosjean and Gee ( 1987 ) , and the account of monosyllabic destressing in Selkirk ( 1984 ) . Thus in our analysis , rules of phonological word formation apply to the non-null terminal nodes in a syntax tree .

Our rules for phonological word formation are adopted , for the most part , from G & G , @@CITATION , and the account of monosyllabic destressing in Selkirk ( 1984 ) .


from dictionary to corpus to selforganizing dictionary learning valency associations in the face of variation and change

which is bound to be less certain than the assignment of frames based entirely on existing examples . As a generalization , Briscoe ( 2001 ) notes that lexicons such as COMLEX tend to demonstrate high precision but low recall . Briscoe and Carroll ( 1997 ) report on manually analyzing an open-class vocabulary of 35,000 head words for predicate subcategorization information and comparing the results against the subcategorization details in COMLEX .

As a generalization , @@CITATION notes that lexicons such as COMLEX tend to demonstrate high precision but low recall .


semantic interpretation of nominalizations

In other methods , lexical resources are specifically tailored to meet the requirements of the domain ( Rosario and Hearst , 2001 ) or the system ( Gomez , 1998 ) . Such systems extract information from some types of syntactic units ( clauses in ( Fillmore and Atkins , 1998 ; Gildea and Jurafsky , 2002 ; Hull and Gomez , 1996 ) ; noun phrases in ( Hull and Gomez , 1996 ; Rosario et al. , 2002 ) ) . Lists of semantic relations are designed to capture salient domain information .

Such systems extract information from some types of syntactic units ( clauses in ( Fillmore and Atkins , 1998 ; Gildea and Jurafsky , 2002 ; @@CITATION ) ; noun phrases in ( Hull and Gomez , 1996 ; Rosario et al. , 2002 ) ) .


semantic similarity based on corpus statistics and lexical taxonomy

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 ( Wu and Palmer , 1994 ; Leacock and Chodorow , 1998 ) , information-based ( Resnik , 1995 ; @@CITATION ) or distributional ( Weeds and Weir , 2005 ) .


recognizing textual entailment rational evaluation and approaches

Ido Dagan
Bill Dolan
Bernardo Magnini
Dan Roth

Paths between concepts and glosses can be used to calculate similarity/relatedness scores between single words , that contribute to the computation of the overall similarity between the text and the hypothesis . Besides WordNet , the RTE literature documents the use of a variety of lexical information sources ( Bentivogli et al. , 2010 ; Dagan et al. , 2009 ) . These include , just to mention the most popular

Besides WordNet , the RTE literature documents the use of a variety of lexical information sources ( Bentivogli et al. , 2010 ; @@CITATION ) .


in question answering two heads are better than one

J Chu-Carroll
K Czuba
J M Prager
A Ittycheriah

Instead it uses a voting mechanism to select the answer given by the majority of methods . The question answering system developed by Chu-Carroll et al. ( 2003 ) belongs to the merging category of approaches , where the output of an individual method can be used as input to a different method ( this corresponds to Burke 's cascade sub-category ) . Because the results of all the methods are comparable , no learning is required : At each stage of the `` cascade of methods , '' the method that performs best is selected .

The question answering system developed by @@CITATION belongs to the merging category of approaches , where the output of an individual method can be used as input to a different method ( this corresponds to Burke 's cascade sub-category ) .


a family of additive online algorithms for category ranking”

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 ( Joachims , 2002 ) , ( @@CITATION ) , and ( Lewis et al. , 2004 ) .


using registerdiversified corpora for general language studies

where C , is the covariance matrix of x. Using this classification method we can also derive the probability that a case belongs to a particular group ( i.e. , posterior probabilities ) , which is roughly proportional to the Mahalanobis distance from that group centroid . Discriminant analysis has been employed by researchers in automatic text genre detection ( Biber 1993b ; Karlgren and Cutting 1994 ) since it offers a simple and robust solution despite the fact that it presupposes normal distributions of the discriminating variables .

Discriminant analysis has been employed by researchers in automatic text genre detection ( @@CITATIONb ; Karlgren and Cutting 1994 ) since it offers a simple and robust solution despite the fact that it presupposes normal distributions of the discriminating variables .


integrating experiential and distributional data to learn semantic representations

Mark Andrews
Gabriella Vigliocco
David Vinson

Andrews et al. ( 2009 ) and is based on a generalization of Latent Dirichlet Allocation . This model has previously been shown to provide excellent performance on multiple tasks , including prediction of association norms , word substitution errors , semantic inferences , and word similarity ( Andrews et al. , 2009 ; Silberer and Lapata , 2012 ) . While prior work has used the model only with feature norms and visual attributes , we show that low-level image features are directly compatible with the model and provide improved representations of word meaning .

This model has previously been shown to provide excellent performance on multiple tasks , including prediction of association norms , word substitution errors , semantic inferences , and word similarity ( @@CITATION ; Silberer and Lapata , 2012 ) .


Then IA would tend to have little use for this property at all since , presumably , every chihuahua would be small and every alsatian large , making each of the combinations -LCB- large , chihuahua -RCB- ( which denotes the empty set ) and -LCB- large , alsatian -RCB- ( the set of all alsatians ) useless . In other words , existing treatments of gradables in GRE fail to take the `` efficiency of language '' into account ( Barwise and Perry 1983 ; see our Section 2 ) . van Deemter GRE with Gradable Properties

In other words , existing treatments of gradables in GRE fail to take the `` efficiency of language '' into account ( @@CITATION ; see our Section 2 ) .


Michel Galley
Mark Hopkins
Kevin Knight
Daniel Marcu

Although no longer competitive as end-to-end translation models , the IBM Models , as well as the hidden Markov model ( HMM ) of Vogel , Ney , and Tillmann ( 1996 ) , are still widely used for word alignment . Word alignments are used primarily for extracting minimal translation units for machine translation ( MT ) ( e.g. , phrases [ Koehn , Och , and Marcu 2003 ] and rules [ Galley et al. 2004 ; Chiang et al. 2005 ] ) as well as for MT system combination ( Matusov , Ueffing , and Ney 2006 ) .

Word alignments are used primarily for extracting minimal translation units for machine translation ( MT ) ( e.g. , phrases [ Koehn , Och , and Marcu 2003 ] and rules [ @@CITATION ; Chiang et al. 2005 ] ) as well as for


a hidden markov model information retrieval systemquot

Following Miller et al. , 1999 , the IR system ranks documents according to the probability that a document D is relevant given the query Q , P ( D is R IQ ) . Using Bayes Rule , and the fact that P ( Q ) is constant for a given query , and our initial assumption of a uniform a priori

Following @@CITATION , the IR system ranks documents according to the probability that a document D is relevant given the query Q , P ( D is R IQ ) .


In modern syntactic theories ( e.g. , lexical-functional grammar [ LFG ] [ Kaplan and Bresnan 1982 ; Bresnan 2001 ; Dalrymple 2001 ] , head-driven phrase structure grammar [ HPSG ] [ Pollard and Sag 1994 ] , tree-adjoining grammar [ TAG ] [ Joshi 1988 ] , and combinatory categorial grammar [ CCG ] [ Ades and Steedman 1982 ] ) , the lexicon is the central repository for much morphological , syntactic , and semantic information . * National Centre for Language Technology , School of Computing , Dublin City University , Glasnevin , Dublin 9 , Ireland .

In modern syntactic theories ( e.g. , lexical-functional grammar [ LFG ] [ Kaplan and Bresnan 1982 ; @@CITATION ; Dalrymple 2001 ] , head-driven phrase structure grammar [ HPSG ] [ Pollard and Sag 1994 ] , tree-adjoining grammar [ TAG ] [ Joshi 1988 ] , and combinatory categorial grammar [ CCG ] [ Ades and Steedman 1982 ] ) , the lexicon is the central repository for much morphological , syntactic , and semantic information .


intended models circumscription and commonsense reasoningquot

Gricean maxims belong there ; Section 6 will be devoted to a presentation of the metalevel rules corresponding to them . We have shown elsewhere ( Jensen and Binot 1988 ; Zadrozny 1987a , 1987b ) that natural language programs , such as on-line grammars and dictionaries , can be used as referential levels for commonsense reasoning -- for example , to disambiguate PP attachment . This means that information contained in grammars and dictionaries can be used to constrain possible interpretations of the logical predicates of an object-level theory .

We have shown elsewhere ( Jensen and Binot 1988 ; @@CITATIONa , 1987b ) that natural language programs , such as on-line grammars and dictionaries , can be used as referential levels for commonsense reasoning -- for example , to disambiguate PP attachment .


using the web to obtain frequencies for unseen bigrams

In this representation , features for one predicate will be completely independent from those for every other predicate . Thus rather than a single training procedure , we can actually partition the examples by predicate , and train a 1For a fixed verb , MI is proportional to Keller and Lapata ( 2003 ) 's conditional probability scores for pseudodisambiguation of ( v , n , n â² ) triples : Pr ( v | n ) = Pr ( v , n ) / Pr ( n ) , which was shown to be a better measure of association than co-occurrence frequency f ( v , n ) . Normalizing by Pr ( v ) ( yielding MI ) allows us to use a constant threshold across all verbs .

Thus rather than a single training procedure , we can actually partition the examples by predicate , and train a 1For a fixed verb , MI is proportional to @@CITATION 's conditional probability scores for pseudodisambiguation of ( v , n , n â² ) triples : Pr ( v | n ) = Pr ( v , n ) / Pr ( n ) , which was shown to be a better measure of association than co-occurrence frequency f ( v , n ) .