source_text stringlengths 27 368 | label int64 0 1 | target_text stringlengths 1 5.38k |
|---|---|---|
The bias of automatic methods in favour of statistical systems seems to be less pronounced on out-of-domain test data. | 0 | It rewards matches of n-gram sequences, but measures only at most indirectly overall grammatical coherence. |
Bean and Riloff also used bootstrapping to extend their semantic compatibility model, proposed using caseframe network for anaphora resolution, information extraction patterns to identify contextual clues for determining compatibility between NPs. | 0 | BABAR uses a DempsterShafer decision model (Stefik, 1995) to combine the evidence provided by the knowledge sources. |
The authors use linguistic and annotation insights to develop a manually annotated grammar and evaluate it and finally provide a realistic evaluation in which segmentation is performed in a pipeline jointly with parsing. | 0 | Consequently, all three parsers prefer the nominal reading. |
Their empirical results demonstrate that the type-based tagger rivals state-of-the-art tag-level taggers which employ more sophisticated learning mechanisms to exploit similar constraints. | 0 | β is the shared hyperparameter for the tag assignment prior and word feature multinomials. |
The authors cluster NE instance pairs based on the words in the context using bag-of-words methods. | 0 | Notice that the CC-domain is a special case. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | 68 96. |
They proposed a single joint model for performing both morphological segmentation and syntactic disambiguation which bypasses the associated circularity. | 0 | Lexical and Morphological Ambiguity The rich morphological processes for deriving Hebrew stems give rise to a high degree of ambiguity for Hebrew space-delimited tokens. |
They have made use of local and global features to deal with the instances of same token in a document. | 0 | â, because Bush is the first word, the initial caps might be due to its position (as in âThey put a freeze on . . . |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | Finally, other packages implement language model estimation while we are currently dependent on them to generate an ARPA file. |
The evaluation compares the performance of the system with that of several human judges and inter-human agreement on a single correct way to segment a text. | 0 | Email: gale@research. |
For the perplexity and translation tasks, we used SRILM to build a 5-gram English language model on 834 million tokens from Europarl v6 (Koehn, 2005) and the 2011 Workshop on Machine Translation News Crawl corpus with duplicate lines removed. | 0 | Linear probing places at most one entry in each bucket. |
The first method builds on results from (Yarowsky 95) and (Blum and Mitchell 98). | 0 | In a fully supervised setting, the task is to learn a function f such that for all i = 1...m, f (xi,i, 12,i) = yz. |
On the basis of that observation, they described a class of formalisms which they called Linear Context- Free Rewriting Systems (LCFRs), and showed they were recognizable in polynomial time and generated only semilinear languages. | 0 | Roughly speaking, we say that a tee set contains trees with dependent paths if there are two paths p., = vim., and g., = in each 7 E r such that v., is some, possibly empty, shared initial subpath; v., and wi are not bounded in length; and there is some "dependence" (such as equal length) between the set of a... |
they showed that the average agreement among the human judges is .76, and the average agreement between ST(system) and the humans is .75, or about 99% of the interhuman agreement. | 0 | One hopes that such a corpus will be forth coming. |
Most IE researchers have been creating paraphrase knowledge by hand and specific tasks. | 0 | Extract NE pair instances with contexts From the four years of newspaper corpus, we extracted 1.9 million pairs of NE instances. |
They showed that it was useful to abstract away from the details of the formalism, and examine the nature of their derivation process as reflected by properties their trees, find that several of the formalisms considered can be seen as being closely related since they have derivation tree sets with the same structure a... | 0 | The independence of paths in the tree sets of the k tI grammatical formalism in this hierarchy can be shown by means of tree pumping lemma of the form t1ti3t . |
Evaluation was done automatically using the BLEU score and manually on fluency and adequacy. | 0 | Presenting the output of several system allows the human judge to make more informed judgements, contrasting the quality of the different systems. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | We evaluate the system's performance by comparing its segmentation 'Tudgments" with the judgments of a pool of human segmenters, and the system is shown to perform quite well. |
Here we present two algorithms. | 0 | From here on we will refer to the named-entity string itself as the spelling of the entity, and the contextual predicate as the context. |
Instance-weighting approach improved over a wide range of baselines, giving gains of over 2 BLEU points over the best non-adapted baseline. | 0 | This significantly underperforms log-linear combination. |
The authors show that PATB is similar to other tree-banks but that annotation consistency remains low. | 0 | 29 â 95. |
The approach has been successfully tested on the 8 000-word Verbmobil task. | 0 | The quasi-monotone search performs best in terms of both error rates mWER and SSER. |
They showed better grammars to improve performance on both morphological and syntactic tasks, providing support for the advantage of a joint framework over pipelined or factorized ones. | 0 | Finally, the assignments of PoS tags to OOV segments is subject to language specific constraints relative to the token it was originated from. |
A large number of rules are needed for coverage of the domain, suggesting that a fairly large number of labeled examples should be required to train a classifier. | 0 | Alternatively, h can be thought of as defining a decision list of rules x y ranked by their "strength" h(x, y). |
Here we present two algorithms. | 0 | Several extensions of AdaBoost for multiclass problems have been suggested (Freund and Schapire 97; Schapire and Singer 98). |
This paper talks about Exploiting Diversity in Natural Language Processing: Combining Parsers. | 0 | A sentence was withheld from section 22 because its extreme length was troublesome for a couple of the parsers.' |
For the perplexity and translation tasks, we used SRILM to build a 5-gram English language model on 834 million tokens from Europarl v6 (Koehn, 2005) and the 2011 Workshop on Machine Translation News Crawl corpus with duplicate lines removed. | 0 | Sparse lookup is a key subproblem of language model queries. |
The AdaBoost algorithm was developed for supervised learning. | 0 | We define the following function: If Zco is small, then it follows that the two classifiers must have a low error rate on the labeled examples, and that they also must give the same label on a large number of unlabeled instances. |
It is probably the first analysis of Arabic parsing of this kind. | 0 | Crucially, the conventional orthographic form of MSA text is unvocalized, a property that results in a deficient graphical representation. |
This architecture provides a uniform framework in which it is easy to incorporate not only listed dictionary entries but also morphological derivatives, and models for personal names and foreign names in transliteration. | 0 | To this end, we picked 100 sentences at random containing 4,372 total hanzi from a test corpus.14 (There were 487 marks of punctuation in the test sentences, including the sentence-final periods, meaning that the average inter-punctuation distance was about 9 hanzi.) |
The overall parsing accuracy obtained with the pseudo-projective approach is still lower than for the best projective parsers. | 0 | The Prague Dependency Treebank (PDT) consists of more than 1M words of newspaper text, annotated on three levels, the morphological, analytical and tectogrammatical levels (Hajiˇc, 1998). |
Most IE researchers have been creating paraphrase knowledge by hand and specific tasks. | 0 | Because of their size, the examples (Figures 2 to 4) appear at the end of the paper. |
They focused on phrases which two Named Entities, and proceed in two stages. | 0 | This limits the number of NE category pairs to 2,000 and the number of NE pair instances to 0.63 million. |
The AdaBoost algorithm was developed for supervised learning. | 0 | The numbers falling into the location, person, organization categories were 186, 289 and 402 respectively. |
The experimental tests are carried out on the Verbmobil task which is a limited-domain spoken-language task. | 0 | Only one of the first n positions which are not already aligned in a partial hypothesis may be chosen, where n is set to 4. |
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | Their work used subject-verb, verb-object, and adjective-noun relations to compare the contexts surrounding an anaphor and candidate. |
All the texts were annotated by two people. | 0 | When finished, the whole material is written into an XML-structured annotation file. |
They showed the efficacy of graph-based label propagation for projecting part-of-speech information across languages. | 0 | To initialize the graph for label propagation we use a supervised English tagger to label the English side of the bitext.7 We then simply count the individual labels of the English tokens and normalize the counts to produce tag distributions over English word types. |
One can trivially create situations in which strictly binary-branching trees are combined to create a tree with only the root node and the terminal nodes, a completely flat structure. | 0 | We pick the parse that is most similar to the other parses by choosing the one with the highest sum of pairwise similarities. |
They have made use of local and global features to deal with the instances of same token in a document. | 0 | MENE (Maximum Entropy Named Entity) (Borth- wick, 1999) was combined with Proteus (a hand- coded system), and came in fourth among all MUC 7 participants. |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | First, we evaluated BABAR using only the seven general knowledge sources. |
Instance-weighting approach improved over a wide range of baselines, giving gains of over 2 BLEU points over the best non-adapted baseline. | 0 | They are: 5We are grateful to an anonymous reviewer for pointing this out. |
In this paper the author evaluates machine translation performance for six European language pairs that participated in a shared task: translating French, German, Spanish texts to English and back. | 0 | For instance, in the recent IWSLT evaluation, first fluency annotations were solicited (while withholding the source sentence), and then adequacy annotations. |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | Section 2.1 describes how BABAR generates training examples to use in the learning process. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | Methods that allow multiple segmentations must provide criteria for choosing the best segmentation. |
Their work is closely related to recent approaches that incorporate the sparsity constraint into the POS induction process. | 0 | The authors acknowledge the support of the NSF (CAREER grant IIS0448168, and grant IIS 0904684). |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | Their results are then compared with the results of an automatic segmenter. |
This architecture provides a uniform framework in which it is easy to incorporate not only listed dictionary entries but also morphological derivatives, and models for personal names and foreign names in transliteration. | 0 | An example is in (i), where the system fails to group t;,f;?"$?t!: lin2yang2gang3 as a name, because all three hanzi can in principle be separate words (t;,f; lin2 'wood';?"$ yang2 'ocean'; ?t!; gang3 'harbor'). |
The TRIE model uses less memory than the smallest lossless alternative and is still faster than SRILM. | 0 | SRILM inefficiently stores 64-bit pointers. |
The corpus was annoted with different linguitic information. | 0 | As an indication, in our core corpus, we found an average sentence length of 15.8 words and 1.8 verbs per sentence, whereas a randomly taken sample of ten commentaries from the national papers Su¨ddeutsche Zeitung and Frankfurter Allgemeine has 19.6 words and 2.1 verbs per sentence. |
Each out-of-domain phrase pair was characterized by a set of simple features intended to reflect how useful it would be. | 0 | This is a straightforward technique that is arguably better suited to the adaptation task than the standard method of treating representative IN sentences as queries, then pooling the match results. |
This paper talks about Unsupervised Models for Named Entity Classification. | 0 | The first m pairs have labels yi, whereas for i = m + 1, , n the pairs are unlabeled. |
For the perplexity and translation tasks, we used SRILM to build a 5-gram English language model on 834 million tokens from Europarl v6 (Koehn, 2005) and the 2011 Workshop on Machine Translation News Crawl corpus with duplicate lines removed. | 0 | When keys are longer than 64 bits, we conserve space by replacing the keys with their 64-bit hashes. |
This paper talks about Unsupervised Models for Named Entity Classification. | 0 | Following the convention presented in earlier sections, we assume that each example is an instance pair of the from (xi ,i, x2,) where xj,, E 2x3 , j E 2}. |
Finally, several coreference systems have successfully incorporated anaphoricity determination modules. | 0 | The two knowledge sources that use semantic expectations, WordSemCFSem and CFSemCFSem, always return values of -1 or 0. |
These clusters are computed using an SVD variant without relying on transitional structure. | 0 | In contrast to the Bayesian HMM, θt is not drawn from a distribution which has support for each of the n word types. |
In this work, they take a more direct approach and treat a word type and its allowed POS tags as a primary element of the model. | 0 | We evaluate our approach on seven languages: English, Danish, Dutch, German, Portuguese, Spanish, and Swedish. |
The authors believe automatic paraphrase discovery is an important component for building a fully automatic information extraction system. | 0 | When a company buys another company, a paying event can occur, but these two phrases do not indicate the same event. |
They incorporated instance-weighting into a mixture-model framework, and found that it yielded consistent improvements over a wide range of baselines. | 0 | At first glance, this seems only peripherally related to our work, since the specific/general distinction is made for features rather than instances. |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | 16 As one reviewer points out, one problem with the unigram model chosen here is that there is still a. tendency to pick a segmentation containing fewer words. |
This paper offers a broad insight into of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model design. | 0 | We also add an annotation for one-level iDafa (oneLevelIdafa) constructs since they make up more than 75% of the iDafa NPs in the ATB (Gabbard and Kulick, 2008). |
In this paper, the authors proposed an approach for instance-weighting phrase pairs in an out-of-domain corpus in order to improve in-domain performance. | 0 | The NIST06 and NIST08 evaluation sets were used for testing. |
Explanations for this phenomenon are relative informativeness of lexicalization, insensitivity to morphology and the effect of variable word order and these factors lead to syntactic disambiguation. | 0 | 97 78. |
In this paper, Ben and Riloff present a coreference resolver called BABAR that focuses on the use of contextual-role knowledge for coreference resolution. | 0 | The difference in performance between pronouns and definite noun phrases surprised us. |
Finally, several coreference systems have successfully incorporated anaphoricity determination modules. | 0 | For example, the company may refer to Company X in one paragraph and Company Y in another. |
The manual evaluation of scoring translation on a graded scale from 1â5 seems to be very hard to perform. | 0 | Figure 1 provides some statistics about this corpus. |
In this paper, the authors proposed an approach for instance-weighting phrase pairs in an out-of-domain corpus in order to improve in-domain performance. | 0 | When OUT is large and distinct, its contribution can be controlled by training separate IN and OUT models, and weighting their combination. |
They employed a PCFG-based generative framework to make both syntactic and morphological disambiguation decisions which were not only theoretically clean and linguistically justified but also probabilistically appropriate and empirically sound. | 0 | We represent all morphological analyses of a given utterance using a lattice structure. |
Using a treebank grammar, the data-driven lexicon, and a linguistically motivated unknown-tokens handling technique their model outperformed previous pipelined, integrated or factorized systems for Hebrew morphological and syntactic processing, yielding an error reduction of 12% over the best published results so far. | 0 | Evaluation We use 8 different measures to evaluate the performance of our system on the joint disambiguation task. |
Two general approaches are presented and two combination techniques are described for each approach. | 0 | Ties are rare in Bayes switching because the models are fine-grained — many estimated probabilities are involved in each decision. |
Two general approaches are presented and two combination techniques are described for each approach. | 0 | The set of candidate constituents comes from the union of all the constituents suggested by the member parsers. |
They focused on phrases which two Named Entities, and proceed in two stages. | 0 | Limitations There are several limitations in the methods. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | There is a (costless) transition between the NC node and f,. |
Foster et all describe a new approach to SMT adaptation that weights out-of-domain phrase pairs according to their relevance to the target domain, determined by both how similar to it they appear to be, and whether they belong to general language or not. | 0 | Finally, we make some improvements to baseline approaches. |
There are clustering approaches that assign a single POS tag to each word type. | 0 | Our second point of comparison is with Grac¸a et al. |
The evaluation compares the performance of the system with that of several human judges and inter-human agreement on a single correct way to segment a text. | 0 | We also thank ChaoHuang Chang, reviewers for the 1994 ACL conference, and four anonymous reviewers for Computational Linguistics for useful comments. |
The use of global features has shown excellent result in the performance on MUC-6 and MUC-7 test data. | 0 | MUC7 has also seen hybrids of statistical NERs and hand-coded systems (Mikheev et al., 1998; Borthwick, 1999), notably Mikheev' s system, which achieved the best performance of 93.39% on the official NE test data. |
This paper presents a maximum entropy-based named entity recognizer (NER). | 0 | Feature selection is implemented using a feature cutoff: features seen less than a small count during training will not be used. |
They plan on extending instance-weighting to other standard SMT components and capture the degree of generality of phrase pairs. | 0 | The logistic function, whose outputs are in [0, 1], forces pp(s, t) <_ po(s, t). |
Combining multiple highly-accurate independent parsers yields promising results. | 0 | Parser 3, the most accurate parser, was chosen 71% of the time, and Parser 1, the least accurate parser was chosen 16% of the time. |
In this work, they take a more direct approach and treat a word type and its allowed POS tags as a primary element of the model. | 0 | One striking example is the error reduction for Spanish, which reduces error by 36.5% and 24.7% for the best and median settings respectively. |
Vijay-Shankar et all considered the structural descriptions produced by various grammatical formalisms in terms of the complexity of the paths and the relationship between paths in the sets of structural descriptions that each system can generate. | 0 | A k-tape ATM, M, has a read-only input tape and k read-write work tapes. |
There are clustering approaches that assign a single POS tag to each word type. | 0 | La ng ua ge 1T W + P RI O R + F E A T S E ng lis h D a ni s h D u tc h G e r m a n P or tu g u e s e S p a ni s h S w e di s h 2 1. |
Two general approaches are presented and two combination techniques are described for each approach. | 0 | A receives a votes, and B receives b votes. |
Foster et all describe a new approach to SMT adaptation that weights out-of-domain phrase pairs according to their relevance to the target domain, determined by both how similar to it they appear to be, and whether they belong to general language or not. | 0 | These estimates are in turn combined linearly with relative-frequency estimates from an in-domain phrase table. |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | So, this was a surprise element due to practical reasons, not malice. |
They showed the efficacy of graph-based label propagation for projecting part-of-speech information across languages. | 0 | Therefore, the number of fine tags varied across languages for our experiments; however, one could as well have fixed the set of HMM states to be a constant across languages, and created one mapping to the universal POS tagset. |
The main result is that the combined system can recover non-projective dependencies with a precision sufficient to give a significant improvement in overall parsing accuracy, especially with respect to the exact match criterion, leading to the best reported performance for robust non-projective parsing of Czech. | 0 | Experiments using data from the Prague Dependency Treebank show that the combined system can handle nonprojective constructions with a precision sufficient to yield a significant improvement in overall parsing accuracy. |
They showed better grammars to improve performance on both morphological and syntactic tasks, providing support for the advantage of a joint framework over pipelined or factorized ones. | 0 | Several such particles may be prefixed onto a single stem, in which case the affixation is subject to strict linear precedence constraints. |
The authors use linguistic and annotation insights to develop a manually annotated grammar and evaluate it and finally provide a realistic evaluation in which segmentation is performed in a pipeline jointly with parsing. | 0 | Even with vocalization, there are linguistic categories that are difficult to identify without semantic clues. |
The authors use linguistic and annotation insights to develop a manually annotated grammar and evaluate it and finally provide a realistic evaluation in which segmentation is performed in a pipeline jointly with parsing. | 0 | In particular, the decision to represent arguments in verb- initial clauses as VP internal makes VSO and VOS configurations difficult to distinguish. |
they showed that the average agreement among the human judges is .76, and the average agreement between ST(system) and the humans is .75, or about 99% of the interhuman agreement. | 0 | Approaches differ in the algorithms used for scoring and selecting the best path, as well as in the amount of contextual information used in the scoring process. |
In this paper, Ben and Riloff present a coreference resolver called BABAR that focuses on the use of contextual-role knowledge for coreference resolution. | 0 | T e r r o r i s m Ca sef ra me Semantic Classes <a ge nt > ass ass ina ted group, human inv esti gat ion int o < N P> event exp lod ed out sid e < N P> building N a t u r a l D i s a s t e r s Ca sef ra me Semantic Classes <a ge nt > inv esti gat ing cau se group, human sur viv or of < N P> event, natphenom hit wit h <... |
Explanations for this phenomenon are relative informativeness of lexicalization, insensitivity to morphology and the effect of variable word order and these factors lead to syntactic disambiguation. | 0 | 07 80. |
They plan on extending instance-weighting to other standard SMT components and capture the degree of generality of phrase pairs. | 0 | ), which precludes a single universal approach to adaptation. |
This paper talks about Pseudo-Projective Dependency Parsing. | 0 | Finally, since non-projective constructions often involve long-distance dependencies, the problem is closely related to the recovery of empty categories and non-local dependencies in constituency-based parsing (Johnson, 2002; Dienes and Dubey, 2003; Jijkoun and de Rijke, 2004; Cahill et al., 2004; Levy and Manning, 200... |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | By definition, each existential NP uniquely specifies an object or concept, so we can infer that all instances of the same existential NP are coreferent (e.g., âthe FBIâ always refers to the same entity). |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | The question is how to normalize the probabilities in such a way that smaller groupings have a better shot at winning. |
NER is useful in many NLP applications such as information extraction, question answering, etc .Chieu and Ng have shown that the maximum entropy framework is able to use global information directly from various sources. | 0 | A token that is allCaps will also be initCaps. |
There are clustering approaches that assign a single POS tag to each word type. | 0 | For instance, on Spanish, the absolute gap on median performance is 10%. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.