Unnamed: 0
int64
0
1.69k
text
stringlengths
18
1.09k
id
int64
0
1.69k
label
int64
0
5
0
Thus , over the past few years , along with advances in the use of learning and statistical methods for acquisition of full parsers ( Collins , 1997 ; Charniak , 1997a ; Charniak , 1997b ; Ratnaparkhi , 1997 ) , significant progress has been made on the use of statistical learning methods to recognize shallow parsing patterns syntactic phrases or words that participate in a syntactic relationship ( Church , 1988 ; Ramshaw and Marcus , 1995 ; Argamon et al. , 1998 ; Cardie and Pierce , 1998 ; Munoz et al. , 1999 ; Punyakanok and Roth , 2001 ; Buchholz et al. , 1999 ; Tjong Kim Sang and Buchholz , 2000 ) .
0
0
1
This was done by MERT optimization ( Och , 2003 ) towards post-edits under the TER target metric .
1
1
2
She evaluates 3,000 German verbs with a token frequency between 10 and 2,000 against the Duden ( Dudenredaktion 2001 ) .
2
0
3
The following four components have been identified as the key elements of a question related to patient care ( Richardson et al. 1995 ) :
3
0
4
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 .
4
2
5
This is roughly an 11 % relative reduction in error rate over Charniak ( 2000 ) and Bods PCFG-reduction reported in Table 1 .
5
2
6
Finally , feedback expressions ( head nods and shakes ) are successfully predicted from speech , prosody and eye gaze in interaction with Embodied Communication Agents as well as human communication ( Fujie et al. , 2004 ; Morency et al. , 2005 ; Morency et al. , 2007 ; Morency et al. , 2009 ) .
6
0
7
We use the agreement checker code developed by Alkuhlani and Habash ( 2011 ) and evaluate our baseline ( MaltParser using only CORE12 ) , best performing model ( Easy-First Parser using CORE12 + DET+LMM+PERSON+FN * NGR g + p ) , and the gold reference .
7
1
8
The diagnoser , based on Dzikovska et al. ( 2008b ) , outputs a diagnosis which consists of lists of correct , contradictory and non-mentioned objects and relations from the student 's answer .
8
3
9
The formalization of DLRs provided by Meurers ( 1995 ) defines a formal lexical rule specification language and provides a semantics for that language in two steps : A rewrite system enriches the lexical rule specification into a fully explicit description of the kind shown in Figure 1 .
9
0
10
Similar to our previous work ( Chan and Ng , 2005b ) , we used the supervised WSD approach described in ( Lee and Ng , 2002 ) for our experiments , using the naive Bayes algorithm as our classifier .
10
1
11
Similar to ( Li et al. , 2013a ) , our summarization system is , which consists of three key components : an initial sentence pre-selection module to select some important sentence candidates ; the above compression model to generate n-best compressions for each sentence ; and then an ILP summarization method to select the best summary sentences from the multiple compressed sentences .
11
2
12
The extraction procedure consists of three steps : First , the bracketing of the trees in the Penn Treebank is corrected and extended based on the approaches of Magerman ( 1994 ) and Collins ( 1997 ) .
12
0
13
transition-based dependency parsing framework ( Nivre , 2008 ) using an arc-eager transition strategy and are trained using the perceptron algorithm as in Zhang and Clark ( 2008 ) with a beam size of 8 .
13
1
14
But their importance has grown far beyond machine translation : for instance , transferring annotations between languages ( Yarowsky and Ngai 2001 ; Hwa et al. 2005 ; Ganchev , Gillenwater , and Taskar 2009 ) ; discovery of paraphrases ( Bannard and Callison-Burch 2005 ) ; and joint unsupervised POS and parser induction across languages ( Snyder and Barzilay 2008 ) .
14
4
15
each relevant document is retrieved ( Baeza-Yates and Ribeiro-Neto 1999 ) .
15
1
16
McKnight and Srinivasan ( 2003 ) have previously examined the task of categorizing sentences in medical abstracts using supervised discriminative machine learning techniques .
16
0
17
This recognizer incrementally outputs word hypotheses as soon as they are found in the best-scored path in the forward search ( Hirasawa et al. , 1998 ) using the ISTAR ( Incremental Structure Transmitter And Receiver ) protocol , which conveys word graph information as well as word hypotheses .
17
0
18
The recent great advances in speech and language technologies have made it possible to build fully implemented spoken dialogue systems ( Aust et al. , 1995 ; Allen et al. , 1996 ; Zue et al. , 2000 ; Walker et al. , 2000 ) .
18
0
19
We posit that this would not have a significant effect on the results , in particular for MML-based classification techniques , such as Decision Graphs ( Oliver 1993 ) .
19
0
20
Collins & Duffy ( 2002 ) showed how the perceptron algorithm can be used to efficiently compute the best parse with DOP1 's subtrees , reporting a 5.1 % relative reduction in error rate over the model in Collins ( 1999 ) on the WSJ .
20
0
21
Tateisi et al. also translated LTAG into HPSG ( Tateisi et al. , 1998 ) .
21
2
22
The system utilizes several large size biological databases including three NCBI databases ( GenPept [ 11 ] , RefSeq [ 12 ] , and Entrez GENE [ 13 ] ) , PSD database from Protein Information Resources ( PIR ) [ 14 ] , and
22
1
23
The LM uses the monolingual data and is trained as a five-gram9 using the SRILM-Toolkit ( Stolcke , 2002 ) .
23
1
24
There has also been work focused upon determining the political leaning ( e.g. , `` liberal '' vs. `` conservative '' ) of a document or author , where most previously-proposed methods make no direct use of relationships between the documents to be classified ( the `` unlabeled '' texts ) ( Laver et al. , 2003 ; Efron , 2004 ; Mullen and Malouf , 2006 ) .
24
0
25
A number of speech understanding systems have been developed during the past fifteen years ( Barnett et al. 1980 , Dixon and Martin 1979 , Erman et al. 1980 , Haton and Pierrel 1976 , Lea 1980 , Lowerre and Reddy 1980 , Medress 1980 , Reddy 1976 , Walker 1978 , and Wolf and Woods 1980 ) .
25
2
26
Secondly , the cooperative principle of Grice ( 1975 , 1978 ) , under the assumption that referential levels of a writer and a reader are quite similar , implies that the writer should structure the text in a way that makes the construction of his intended model easy for the reader ; and this seems to imply that he should appeal only to the most direct knowledge of the reader .
26
4
27
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 .
27
0
28
In this paper , inspired by KNN-SVM ( Zhang et al. , 2006 ) , we propose a local training method , which trains sentence-wise weights instead of a single weight , to address the above two problems .
28
4
29
1990 ) , on linguisitic acquisition ( by the use of Part-of-Speech filters hand-crafted by a linguist ) ( Oueslati , 1999 ) or , more frequently , on a combination of the two ( Smadja , 1993 ; Kilgarriff and Tugwell , 2001 , for example ) .
29
2
30
Samuelsson and Voutilainen ( 1997 ) report excellent part-of-speech tagging results using a handcrafted approach that is close to OT .3 More speculatively , imagine an OT grammar for stylistic revision of parsed sentences .
30
0
31
Thus for instance , ( Copestake and Flickinger , 2000 ; Copestake et al. , 2001 ) describes a Head Driven Phrase Structure Grammar ( HPSG ) which supports the parallel construction of a phrase structure ( or derived ) tree and of a semantic representation and ( Dalrymple , 1999 ) show how to equip Lexical Functional grammar ( LFG ) with a glue semantics .
31
0
32
While many linguistic theories state subcategorization requirements in terms of phrase structure ( CFG categories ) , Dalrymple ( 2001 ) questions the viability and universality of such an approach because of the variety of ways in which grammatical functions may be realized at the language-specific constituent structure level .
32
0
33
We are going to make such a comparison with the theories proposed by J. Hobbs ( 1979 , 1982 ) that represent a more computationally oriented approach to coherence , and those of T.A. van Dijk and W. Kintch ( 1983 ) , who are more interested in addressing psychological and cognitive aspects of discourse coherence .
33
2
34
11 From ( Zollmann and Vogel , 2011 ) , we find that the performance of SAMT system is similar with the method of labeling SCFG rules with POS tags .
34
4
35
In this paper we focus on the exploitation of the LDOCE grammar coding system ; Alshawi et al. ( 1985 ) and Alshawi ( 1987 ) describe further research in Cambridge utilising different types of information available in LDOCE .
35
0
36
Gurevych ( 2006 ) observed that some annotators were not familiar with the exact definition of semantic relatedness .
36
4
37
All current approaches to monolingual TE , either syntactically oriented ( Rus et al. , 2005 ) , or applying logical inference ( Tatu and Moldovan , 2005 ) , or adopting transformation-based techniques ( Kouleykov and Magnini , 2005 ; Bar-Haim et al. , 2008 ) , incorporate different types of lexical knowledge to support textual inference .
37
0
38
Although originally developed as a tool to assist in query formulation , Booth ( 2000 ) pointed out that PICO frames can be employed to structure IR results for improving precision .
38
0
39
There has been some controversy , at least for simple stemmers ( Lovins , 1968 ; Porter , 1980 ) , about the effectiveness of morphological analysis for document retrieval ( Harman , 1991 ; Krovetz , 1993 ; Hull , 1996 ) .
39
0
40
in history-based models ( Black et al. , 1993 ) , the probability estimate for each derivation decision di is conditioned on the previous derivation decisions d1 , ... , d , _ 1 , which is called the derivation history at step i .
40
1
41
The reader is referred to Meurers and Minnen ( 1996 ) for a more detailed discussion of our use of constraint propagation .32 We illustrate the result of constraint propagation with our example grammar .
41
0
42
Such tools make it easy to run most current approaches to statistical markup , chunking , normalization , segmentation , alignment , and noisy-channel decoding , ' including classic models for speech recognition ( Pereira and Riley , 1997 ) and machine translation ( Knight and Al-Onaizan , 1998 ) .
42
0
43
Such technologies require significant human input , and are difficult to create and maintain ( Delic and Lahaix 1998 ) .
43
0
44
We can define PCAT using a probabilistic grammar ( Garrette et al. , 2014 ) .
44
0
45
It is these orthographic variations and complex morphological structure that make Arabic language processing challenging ( Xu et al. , 2001 ; Xu et al. , 2002 ) .
45
0
46
The first is the one used in the chunking competition in CoNLL-2000 ( Tjong Kim Sang and Buchholz , 2000 ) .
46
1
47
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 -
47
0
48
For example , Gay et al. ( 2005 ) experimented with abstracts and full article texts in the task of automatically generating index term recommendations and discovered that using full article texts yields at most a 7.4 % improvement in F-score .
48
0
49
The ten most specific nouns have been produced by comparing our corpus of computing to the French corpus Le Monde , composed of newspaper articles ( Lemay et al. , 2004 ) .
49
1
50
Secondly , we need to investigate techniques for identifying identical documents , virtually identical documents and highly repetitive documents , such as those pioneered by Fletcher ( 2004b ) and shingling techniques described by Chakrabarti ( 2002 ) .
50
5
51
Following the work of Stymne and Cancedda ( 2011 ) , we implement a linear-chain CRF merging system using the following features : stemmed ( separated ) surface form , part-of-speech14 and frequencies from the training corpus for bigrams/merging of word and word +1 , word as true prefix , word +1 as true suffix , plus frequency comparisons of these .
51
1
52
Manning ( 1993 ) attempts to improve on the approach of Brent ( 1993 ) by passing raw text through a stochastic tagger and a finite-state parser ( which includes a set of simple rules for subcategorization frame recognition ) in order to extract verbs and the constituents with which they co-occur .
52
0
53
From an IR view , a lot of specialized research has already been carried out for medical applications , with emphasis on the lexico-semantic aspects of dederivation and decomposition ( Pacak et al. , 1980 ; Norton and Pacak , 1983 ; Wolff , 1984 ; Wingert , 1985 ; Dujols et al. , 1991 ; Baud et al. , 1998 ) .
53
0
54
Rather than producing a complete analysis of sentences , the alternative is to perform only partial analysis of the syntactic structures in a text ( Harris , 1957 ; Abney , 1991 ; Greffenstette , 1993 ) .
54
0
55
Thus , over the past few years , along with advances in the use of learning and statistical methods for acquisition of full parsers ( Collins , 1997 ; Charniak , 1997a ; Charniak , 1997b ; Ratnaparkhi , 1997 ) , significant progress has been made on the use of statistical learning methods to recognize shallow parsing patterns syntactic phrases or words that participate in a syntactic relationship ( Church , 1988 ; Ramshaw and Marcus , 1995 ; Argamon et al. , 1998 ; Cardie and Pierce , 1998 ; Munoz et al. , 1999 ; Punyakanok and Roth , 2001 ; Buchholz et al. , 1999 ; Tjong Kim Sang and Buchholz , 2000 ) .
55
0
56
Problems such as these have motivated research on more abstract , dependencybased parser evaluation ( e.g. , Lin 1995 ; Carroll , Briscoe , and Sanfilippo 1998 ; Carroll et al. 2002 ; Clark and Hockenmaier 2002 ; King et al. 2003 ; Preiss 2003 ; Kaplan et al. 2004 ; Miyao and Tsujii 2004 ) .
56
4
57
They are widely used in MT as a way to figure out how to translate input in one language into output in another language ( Koehn et al. , 2003 ) .
57
0
58
Further details about the properties of entropy can be found in textbooks on information theory ( e.g. , Cover and Thomas 1991 ) .
58
0
59
Dale and Reiter ( 1995 ) , for example , discussed the transcripts of a dialogue between people who assemble a piece of garden furniture ( originally recorded by Candy Sidner ) .
59
0
60
Here , PV ( A ) represents an ascent direction chosen as follows : For inequality constraints , it is the projected gradient ( Bertsekas 1999 ) ; for equality constraints with slack , we use conjugate gradient ( Nocedal and Wright 1999 ) , noting that when A = 0 , the objective is not differentiable .
60
1
61
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 .
61
4
62
This idea was inspired by Delisle et al. ( 1993 ) , who used a list of arguments surrounding the main verb together with the verb 's subcategorization information and previously processed examples to analyse semantic roles ( case relations ) .
62
4
63
, `` domain circumscription '' ( cfXXX Etherington and Mercer 1987 ) , and their kin .
63
2
64
While these approaches have been reasonably successful ( see Mitkov ( 2002 ) ) , Kehler et al. ( 2004 ) speculate that deeper linguistic knowledge needs to be made available to resolvers in order to reach the next level of performance .
64
0
65
A parsing experiment shows that an efficient HPSG parser with the obtained grammar achieved a significant speed-up against an existing LTAG parser ( Yoshinaga et al. , 2001 ) .
65
2
66
Features were discovered from the actual sentence plan trees that the SPG generated through the feature derivation process described below , in a manner similar to that used by Collins ( 2000 ) .
66
2
67
Such questions are typically answered by designing appropriate priming experiments ( Marslen-Wilson et al. , 1994 ) or other lexical decision tasks .
67
0
68
The system is in the form of an agenda-driven chart-based parser whose foundation is similar to previous formalizations of Chomsky 's Minimalist Program ( Stabler , 1997 ; Harkema , 2000 ; Niyogi , 2001 ) .
68
2
69
Michiels ( 1982 ) and Akkerman et al. ( 1985 ) provide a more detailed analysis of the information encoded by the LDOCE grammar codes and discuss their efficacy as a system of linguistic description .
69
0
70
The research described below is taking place in the context of three collaborative projects ( Boguraev , 1987 ; Russell et al. , 1986 ; Phillips and Thompson , 1986 ) to develop a general-purpose , wide coverage morphological and syntactic analyser for English .
70
0
71
The EDR has close ties to the named entity recognition ( NER ) and coreference resolution tasks , which have been the focus of several recent investigations ( Bikel et al. , 1997 ; Miller et al. , 1998 ; Borthwick , 1999 ; Mikheev et al. , 1999 ; Soon et al. , 2001 ; Ng and Cardie , 2002 ; Florian et al. , 2004 ) , and have been at the center of evaluations such as : MUC-6 , MUC-7 , and the CoNLL '02 and CoNLL '03 shared tasks .
71
0
72
Viewed in this way , gradable adjectives are an extreme example of the `` efficiency of language '' ( Barwise and Perry 1983 ) : Far from meaning something concrete like `` larger than 8 cm '' -- a concept that would have very limited applicability -- or even something more general like `` larger than the average N , '' a word like large is applicable across a wide range of different situations .
72
2
73
However , since work in this direction has started , a significant progress has also been made in the research on statistical learning of full parsers , both in terms of accuracy and processing time ( Charniak , 1997b ; Charniak , 1997a ; Collins , 1997 ; Ratnaparkhi , 1997 ) .
73
0
74
It is defined on different kinds of textual units , e.g. documents , parts of a document ( e.g. words and their surrounding context ) , words or concepts ( Lebart and Rajman , 2000 ) .2 Linguistic distance between words is inverse to their semantic similarity or relatedness .
74
0
75
However , the greatest increase is in the amount of raw text available to be processed , e.g. the English Gigaword Corpus ( Linguistic Data Consortium , 2003 ) .
75
0
76
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 ) .
76
0
77
Och and Ney ( 2002 ) introduced the log-linear model for statistical machine translation ( SMT ) , in which translation is considered as the following optimization problem :
77
0
78
Representative systems are described in Boisen et al. ( 1989 ) , De Mattia and Giachin ( 1989 ) , Niedermair ( 1989 ) , Niemann ( 1990 ) , and Young ( 1989 ) .
78
0
79
For compound splitting , we follow Fritzinger and Fraser ( 2010 ) , using linguistic knowledge encoded in a rule-based morphological analyser and then selecting the best analysis based on the geometric mean of word part frequencies .
79
1
80
Koehn and Hoang ( 2007 ) showed that the use of a POS factor only results in negligible BLEU improvements , but we need access to the POS in our inflection prediction models .
80
0
81
Over the last decade there has been a lot of interest in developing tutorial dialogue systems that understand student explanations ( Jordan et al. , 2006 ; Graesser et al. , 1999 ; Aleven et al. , 2001 ; Buckley and Wolska , 2007 ; Nielsen et al. , 2008 ; VanLehn et al. , 2007 ) , because high percentages of selfexplanation and student contentful talk are known to be correlated with better learning in humanhuman tutoring ( Chi et al. , 1994 ; Litman et al. , 2009 ; Purandare and Litman , 2008 ; Steinhauser et al. , 2007 ) .
81
0
82
We first identified the most informative unigrams and bigrams using the information gain measure ( Yang and Pedersen 1997 ) , and then selected only the positive outcome predictors using odds ratio ( Mladenic and Grobelnik 1999 ) .
82
1
83
Recently , several alternative , often quite sophisticated approaches to collective classification have been proposed ( Neville and Jensen , 2000 ; Lafferty et al. , 2001 ; Getoor et al. , 2002 ; Taskar et al. , 2002 ; Taskar et al. , 2003 ; Taskar et al. , 2004 ; McCallum and Wellner , 2004 ) .
83
0
84
It compares favorably to other stemming or root extraction algorithms ( Yates and Neto , 1999 ; Al-Shalabi and Evens , 1998 ; and Houmame , 1999 ) , with a performance of over 97 % for extracting the correct root in web documents , and it addresses the challenge of the Arabic broken plural and hollow verbs .
84
4
85
We perceive that these results can be extended to other language models that properly embed bilexical context-free grammars , as for instance the more general history-based models used in ( Ratnaparkhi , 1997 ) and ( Chelba and Jelinek , 1998 ) .
85
5
86
Clearly , what it takes for the adjective to be applicable has not been cast in stone , but is open to fiat : the speaker may decide that 8 cm is enough , or the speaker may set the standards higher ( cfXXX , Kennedy 1999 ) .
86
0
87
Many investigators ( e.g. Allen 1976 ; Elowitz et al. 1976 ; Luce et al. 1983 ; Cahn 1988 ) have suggested that the poor prosody of synthetic speech , in comparison with natural speech , is the primary factor leading to difficulties in the comprehension of fluent synthetic speech .
87
4
88
The PERSIVAL project , the most comprehensive study of such techniques applied on medical texts to date , leverages patient records to generate personalized summaries in response to physicians ' queries ( McKeown , Elhadad , and Hatzivassiloglou 2003 ; Elhadad et al. 2005 ) .
88
2
89
See Lopez and Resnik ( 2006 ) for further discussion .
89
0
90
We gather similar words using Lin ( 1998a ) , mining similar verbs from a comparable-sized parsed corpus , and collecting similar nouns from a broader 10 GB corpus of English text .4 We also use Keller and Lapata ( 2003 ) 's approach to obtaining web-counts .
90
1
91
Thus , for example , it can acquire a `` script '' such as the one for going to a restaurant as defined in Schank and Abelson ( 1977 ) .
91
0
92
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 ) .
92
0
93
There is some literature on procedure acquisition such as the LISP synthesis work described in Biermann et al. ( 1984 ) and the PROLOG synthesis method of Shapiro ( 1982 ) .
93
2
94
The system uses a domain-specific content planner to produce input to the surface realizer based on the strategy decision , and a FUF/SURGE ( Elhadad and Robin , 1992 ) generation system to produce the appropriate text .
94
1
95
However , each of these fields requires further decoding and restructuring to provide client programs with easy access to the information they require ( see Calzolari ( 1984 ) for further discussion ) .
95
0
96
Our results also confirm the insights gained by Blitzer et al. ( 2007 ) , who observed that in crossdomain polarity analysis adding more training data is not always beneficial .
96
2
97
We consider the Creative Commons model as the most suitable one to let each author choose the rights to reserve ( Lessig , 2004 ) .
97
1
98
It compares favorably to other stemming or root extraction algorithms ( Yates and Neto , 1999 ; Al-Shalabi and Evens , 1998 ; and Houmame , 1999 ) , with a performance of over 97 % for extracting the correct root in web documents , and it addresses the challenge of the Arabic broken plural and hollow verbs .
98
4
99
In a similar vein , Steyvers ( 2010 ) showed that a different feature-topic model improved predictions on a fill-in-the-blank task .
99
0