yxchar's picture
uploads
4ef3e4b
,text,id,label
0,"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 ) .",0,0
1,"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 ) .",1,2
2,"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 .",2,0
3,"inter-document references in the form of hyperlinks ( Agrawal et al. , 2003 ) .",3,0
4,"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 .",4,0
5,"Arabic has two kinds of plurals : broken plurals and sound plurals ( Wightwick and Gaafar , 1998 ; Chen and Gey , 2002 ) .",5,0
6,"Secondly , as ( Blunsom et al. , 2008 ) show , marginalizing out the different segmentations during decoding leads to improved performance .",6,5
7,"Nivre ( 2008 ) reports experiments on Arabic parsing using his MaltParser ( Nivre et al. 2007 ) , trained on the PADT .",7,0
8,"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 ) .",8,0
9,"The grammar conversion from LTAG to HPSG ( Yoshinaga and Miyao , 2001 ) is the core portion of the RenTAL system .",9,0
10,"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 .",10,0
11,"Our knowledge extractors rely extensively on MetaMap ( Aronson 2001 ) , a system for identifying segments of text that correspond to concepts in the UMLS Metathesaurus .",11,1
12,"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 ) .",12,2
13,"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 .",13,4
14,"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 .",14,4
15,"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 .",15,0
16,"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 .",16,0
17,"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 .",17,0
18,"To solve these scaling issues , we implement Online Variational Bayesian Inference ( Hoffman et al. , 2010 ; Hoffman et al. , 2012 ) for our models .",18,1
19,"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 .",19,2
20,"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 ) ) .",20,0
21,"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 -",21,0
22,"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 ) .",22,0
23,"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 ) .",23,0
24,"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 .",24,0
25,"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 ) .",25,1
26,"We work with a semi-technical text on meteorological phenomena ( Larrick , 1961 ) , meant for primary school students .",26,1
27,"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 .",27,2
28,The candidate feature templates include : Voice from Sun and Jurafsky ( 2004 ) .,28,1
29,"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 ) .",29,0
30,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 .,30,0
31,The Chinese PropBank has labeled the predicateargument structures of sentences from the Chinese TreeBank ( Xue et al. 2005 ) .,31,1
32,"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 .",32,0
33,"Disjunctive feature descriptions are also possible ; WIT incorporates an efficient method for handling disjunctions ( Nakano , 1991 ) .",33,1
34,Our strategy is based on the approach presented by Johnson et al. ( 2007 ) .,34,1
35,"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 :",35,0
36,"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 ) .",36,0
37,"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",37,1
38,"Both kinds of annotation were carried out using ANVIL ( Kipp , 2004 ) .",38,1
39,The article classifier is a discriminative model that draws on the state-of-the-art approach described in Rozovskaya et al. ( 2012 ) .,39,1
40,"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 ) .",40,0
41,"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 ) . ''",41,0
42,We follow the notation convention of Lari and Young ( 1990 ) .,42,1
43,"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 .",43,0
44,Finkelstein et al. ( 2002 ) did not report inter-subject correlation for their larger dataset .,44,2
45,This is a similar conclusion to our previous work in Salloum and Habash ( 2011 ) .,45,2
46,We then use the program Snob ( Wallace and Boulton 1968 ; Wallace 2005 ) to cluster these experiences .,46,1
47,"The priorities are used for disambiguating interpretation in the incremental understanding method ( Nakano et al. , 1999b ) .",47,1
48,"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 ) .",48,0
49,"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 .",49,0
50,"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 .",50,1
51,"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 ) .",51,2
52,"This confirms that although Kozima 's approach ( Kozima , 1993 ) is computationally expensive , it does produce more precise segmentation .",52,2
53,Park and Byrd ( 2001 ) recently described a hybrid method for finding abbreviations and their definitions .,53,0
54,"More specifically , the notion of the phrasal lexicon ( used first by Becker 1975 ) has been used successfully in a number of areas :",54,0
55,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 .,55,0
56,"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 .",56,3
57,It would seem therefore that the iteration of the PT operation to form a closure is needed ( cfXXX Zadrozny 1987b ) .,57,2
58,Sedivy et al. ( 1999 ) asked subjects to identify the target of a vague description in a visual scene .,58,0
59,"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 .",59,2
60,"Our recovery policy is modeled on the TargetedHelp ( Hockey et al. , 2003 ) policy used in task-oriented dialogue .",60,3
61,"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 ) .",61,2
62,"` See ( King , 1994 ) for a discussion of the appropriateness of TIG for HPSG and a comparison with other feature logic approaches designed for HPSG .",62,0
63,"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 ) .",63,1
64,"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 ) .",64,0
65,"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 ) .",65,0
66,"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 .",66,4
67,"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 ) .",67,0
68,"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 ) .",68,1
69,"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 .",69,0
70,"Other definitions of predicates may be found in ( Gomez , 1998 ) .",70,0
71,"For the sake of completeness , we report in this section also the results obtained adopting the `` basic solution '' proposed by ( Mehdad et al. , 2010 ) .",71,2
72,"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 .",72,0
73,"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 .",73,3
74,"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 .",74,0
75,"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 .",75,0
76,"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 .",76,0
77,"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 .",77,2
78,"Others include selectional preferences , transitivity ( Schoenmackers et al. , 2008 ) , mutual exclusion , symmetry , etc. .",78,0
79,"• 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 ) ,",79,0
80,"For example , ( Fang et al. , 2001 ) discusses the evaluation of two different text categorization strategies with several variations of their feature spaces .",80,0
81,"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 ) .",81,1
82,"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 ) .",82,0
83,or quotation of messages in emails or postings ( see Mullen and Malouf ( 2006 ) but cfXXX Agrawal et al. ( 2003 ) ) .,83,0
84,The first work to do this with topic models is Feng and Lapata ( 2010b ) .,84,0
85,"The language chosen for semantic representation is a flat semantics along the line of ( Bos , 1995 ; Copestake et al. , 1999 ; Copestake et al. , 2001 ) .",85,2
86,"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 ) .",86,0
87,"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 .",87,5
88,"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 .",88,2
89,"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 .",89,3
90,"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 ) .",90,0
91,"This method of incorporating dictionary information seems simpler than the method proposed by Brown et al. for their models ( Brown et al. , 1993b ) .",91,2
92,"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 .",92,0
93,"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 .",93,2
94,"7 We ignore the rare `` false idafa '' construction ( Habash 2010 , p. 102 ) .",94,0
95,"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 ) .",95,0
96,"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 .",96,0
97,"We follow Lewis and Steedman ( 2014 ) in allowing a small set of generic , linguistically-plausible unary and binary grammar rules .",97,1
98,( 7 ) NEIGHBOR : Research in lexical semantics suggests that the SC of an NP can be inferred from its distributionally similar NPs ( see Lin ( 1998a ) ) .,98,4
99,"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 ) .",99,2
100,"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 .",100,2
101,"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",101,1
102,"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 ) .",102,0
103,"We use the same data setting with Xue ( 2008 ) , however a bit different from Xue and Palmer ( 2005 ) .",103,2
104,"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 ) .",104,4
105,"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 ) .",105,0
106,"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 ) .",106,5
107,"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 ) .",107,0
108,"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 .",108,5
109,"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 ) .",109,1
110,Curran ( 2003 ),110,0
111,"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 .",111,0
112,"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 .",112,0
113,"This result is consistent with other works using this model with these features ( Andrews et al. , 2009 ; Silberer and Lapata , 2012 ) .",113,2