source_text stringlengths 27 368 | label int64 0 1 | target_text stringlengths 1 5.38k |
|---|---|---|
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | (Kehler, 1997) also used a DempsterShafer model to merge evidence from different sources for template-level coreference. |
the "Potsdam Commentary Corpus" or PCC consists of 170 commentaries from Ma¨rkische Allgemeine Zeitung, a German regional daily. | 0 | Section 3 discusses the applications that have been completed with PCC, or are under way, or are planned for the future. |
The problem of coreference resolution has received considerable attention, including theoretical discourse models and supervised machine learning systems. | 0 | Table 1: Syntactic Seeding Heuristics BABARâs reliable case resolution heuristics produced a substantial set of anaphor/antecedent resolutions that will be the training data used to learn contextual role knowledge. |
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 | The results in Table 1 show PROBING is 81% faster than TRIE, which is in turn 31% faster than the fastest baseline. |
This topic has been getting more attention, driven by the needs of various NLP applications. | 0 | One is the accuracy within a set of phrases which share the same keyword; the other is the accuracy of links. |
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 | The tee pumping lemma states that if there is tree, t = 22 t2t3, generated by a CFG G, whose height is more than a predetermined bound k, then all trees of the form ti tP3 for each i > 0 will also generated by G (as shown in Figure 9b). |
The manual evaluation of scoring translation on a graded scale from 1–5 seemed to be very hard to perform. | 0 | Following this method, we repeatedly — say, 1000 times — sample sets of sentences from the output of each system, measure their BLEU score, and use these 1000 BLEU scores as basis for estimating a confidence interval. |
The use of global features has shown excellent result in the performance on MUC-6 and MUC-7 test data. | 0 | Context from the whole document can be important in classifying a named entity. |
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 | An alternate approximation to (8) would be to let w,\(s, t) directly approximate pˆI(s, t). |
The approach has been successfully tested on the 8 000-word Verbmobil task. | 0 | An inverted alignment is defined as follows: inverted alignment: i ! j = bi: Target positions i are mapped to source positions bi. |
They have made use of local and global features to deal with the instances of same token in a document. | 0 | Borth- wick (1999) successfully made use of other hand- coded systems as input for his MENE system, and achieved excellent results. |
This paper conducted research in the area of automatic paraphrase discovery. | 0 | Gather phrases using keywords Next, we select a keyword for each phrase â the top-ranked word based on the TF/IDF metric. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | The relevance of the distinction between, say, phonological words and, say, dictionary words is shown by an example like rpftl_A :;!:Hfllil zhong1hua2 ren2min2 gong4he2-guo2 (China people republic) 'People's Republic of China.' |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | We do not experiment with models larger than physical memory in this paper because TPT is unreleased, factors such as disk speed are hard to replicate, and in such situations we recommend switching to a more compact representation, such as RandLM. |
These clusters are computed using an SVD variant without relying on transitional structure. | 0 | Once the lexicon has been drawn, the model proceeds similarly to the standard token-level HMM: Emission parameters θ are generated conditioned on tag assignments T . We also draw transition parameters Ï. |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | For statistics on this test set, refer to Figure 1. |
This corpus has several advantages: it is annotated at different levels. | 0 | 2.5 Connectives with scopes. |
There are clustering approaches that assign a single POS tag to each word type. | 0 | 1 74.5 56. |
The use of global features has shown excellent result in the performance on MUC-6 and MUC-7 test data. | 0 | In order to train this error-correction model, he divided his training corpus into 5 portions of 20% each. |
The corpus was annoted with different linguitic information. | 0 | 3.2 Stochastic rhetorical analysis. |
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 | ments contained 322 anaphoric links. |
The second algorithm builds on a boosting algorithm called AdaBoost. | 0 | The label for a test example with features x is then defined as In this paper we define h(x, y) as the following function of counts seen in training data: Count(x,y) is the number of times feature x is seen with label y in training data, Count(x) = EyEy Count(x, y). a is a smoothing parameter, and k is the number of po... |
They plan on extending instance-weighting to other standard SMT components and capture the degree of generality of phrase pairs. | 0 | This highly effective approach is not directly applicable to the multinomial models used for core SMT components, which have no natural method for combining split features, so we rely on an instance-weighting approach (Jiang and Zhai, 2007) to downweight domain-specific examples in OUT. |
There is no global pruning. | 0 | The alignment model uses two kinds of parameters: alignment probabilities p(aj jajô1; I; J), where the probability of alignment aj for position j depends on the previous alignment position ajô1 (Ney et al., 2000) and lexicon probabilities p(fj jeaj ). |
They used graph-based label propagation for cross-lingual knowledge transfer and used the projected labels as features in an unsupervised model. | 0 | Because many foreign word types are not aligned to an English word (see Table 3), and we do not run label propagation on the foreign side, we expect the projected information to have less coverage. |
In this paper, the authors are of the opinion that the sequence models-based approaches usually treat token-level tag assignment as the primary latent variable. | 0 | Our experiments consistently demonstrate that this model architecture yields substantial performance gains over more complex tagging counterparts. |
They found replacing it with a ranked evaluation to be more suitable. | 0 | If one system is perfect, another has slight flaws and the third more flaws, a judge is inclined to hand out judgements of 5, 4, and 3. |
Due to many similarly performing systems, they are not able to draw strong conclusions on the question of correlation of manual and automatic evaluation metrics. | 0 | was done by the participants. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | In such cases we assign all of the estimated probability mass to the form with the most likely pronunciation (determined by inspection), and assign a very small probability (a very high cost, arbitrarily chosen to be 40) to all other variants. |
Their results show that their high performance NER use less training data than other systems. | 0 | For example, in MUC6, there are four zones (TXT, HL, DATELINE, DD). |
In order to realize the full potential of dependency-based syntactic parsing, it is desirable to allow non-projective dependency structures. | 0 | However, this argument is only plausible if the formal framework allows non-projective dependency structures, i.e. structures where a head and its dependents may correspond to a discontinuous constituent. |
In order to handle the necessary word reordering as an optimization problem within the dynamic programming approach, they describe a solution to the traveling salesman problem (TSP) which is based on dynamic programming. | 0 | A simple extension will be used to handle this problem. |
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 | This essentially means that their model does not result in a true joint inference, as executions for different tasks involve tuning a parameter separately. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | It may seem surprising to some readers that the interhuman agreement scores reported here are so low. |
They believe that global context is useful in most languages, as it is a natural tendency for authors to use abbreviations on entities already mentioned previously. | 0 | Borth 2MUC data can be obtained from the Linguistic Data Consortium: http://www.ldc.upenn.edu 3Training data for IdentiFinder is actually given in words (i.e., 650K & 790K words), rather than tokens Table 6: Comparison of results for MUC7 wick (1999) reported using dictionaries of person first names, corporate names an... |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | Since all long sentence translation are somewhat muddled, even a contrastive evaluation between systems was difficult. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | com §Cambridge, UK Email: nc201@eng.cam.ac.uk © 1996 Association for Computational Linguistics (a) B ) ( , : & ; ? ' H o w d o y o u s a y o c t o p u s i n J a p a n e s e ? ' (b) P l a u s i b l e S e g m e n t a t i o n I B X I I 1 : & I 0 0 r i 4 w e n 2 z h a n g l y u 2 z e n 3 m e 0 s h u o l ' J a p a n e s e... |
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 | This paper discusses the use of unlabeled examples for the problem of named entity classification. |
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 | In this situation, BABAR takes the conservative approach and declines to make a resolution. |
The texts were annotated with the RSTtool. | 0 | The choice of the genre commentary resulted from the fact that an investigation of rhetorical structure, its interaction with other aspects of discourse structure, and the prospects for its automatic derivation are the key motivations for building up the corpus. |
This paper talks about Unsupervised Models for Named Entity Classification. | 0 | The CoBoost algorithm just described is for the case where there are two labels: for the named entity task there are three labels, and in general it will be useful to generalize the CoBoost algorithm to the multiclass case. |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | We adopted the MUC6 guidelines for evaluating coreference relationships based on transitivity in anaphoric chains. |
The departure from the traditional token-based tagging approach allow them to explicitly capture type-level distributional properties of valid POS tag assignments as part of the model. | 0 | For each language and setting, we report one-to-one (11) and many- to-one (m-1) accuracies. |
Evaluation was done automatically using the BLEU score and manually on fluency and adequacy. | 0 | For the manual scoring, we can distinguish only half of the systems, both in terms of fluency and adequacy. |
Finally, several coreference systems have successfully incorporated anaphoricity determination modules. | 0 | BABAR employs information extraction techniques to represent and learn role relationships. |
This paper discusses the Potsdam Commentary Corpus, a corpus of german assembeled by potsdam university. | 0 | For developing these mechanisms, the possibility to feed in hand-annotated information is very useful. |
The authors believe automatic paraphrase discovery is an important component for building a fully automatic information extraction system. | 0 | It is natural that the larger the data in the domain, the more keywords are found. |
Their results show that their high performance NER use less training data than other systems. | 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. |
This paper discusses the Potsdam Commentary Corpus, a corpus of german assembeled by potsdam university. | 0 | We thus decided to pay specific attention to them and introduce an annotation layer for connectives and their scopes. |
Due to many similarly performing systems, they are not able to draw strong conclusions on the question of correlation of manual and automatic evaluation metrics. | 0 | One annotator suggested that this was the case for as much as 10% of our test sentences. |
This paper discusses the Potsdam Commentary Corpus, a corpus of german assembeled by potsdam university. | 0 | Then, the remaining texts were annotated and cross-validated, always with discussions among the annotators. |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | Tokens were converted to vocabulary identifiers in advance and state was carried from each query to the next. |
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 | In that work, mutual information was used to decide whether to group adjacent hanzi into two-hanzi words. |
Finally, several coreference systems have successfully incorporated anaphoricity determination modules. | 0 | Te rro ris m Na tur al Dis ast ers mu rde r of < NP > kill ed <p atie nt > <a ge nt > da ma ged wa s inj ure d in < NP > <a ge nt > rep ort ed <a ge nt > add ed <a ge nt > occ urr ed cau se of < NP > <a ge nt > stat ed <a ge nt > add ed <a ge nt > wr eak ed <a ge nt > cro sse d per pet rat ed <p atie nt > con de mn ed ... |
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 | There is no relation between these two interpretations other then the fact that their surface forms coincide, and we argue that the only reason to prefer one analysis over the other is compositional. |
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 | We thank United Informatics for providing us with our corpus of Chinese text, and BDC for the 'Behavior ChineseEnglish Electronic Dictionary.' |
Due to many similarly performing systems, they are not able to draw strong conclusions on the question of correlation of manual and automatic evaluation metrics. | 0 | The sign test checks, how likely a sample of better and worse BLEU scores would have been generated by two systems of equal performance. |
The approach assumes that the word reordering is restricted to a few positions in the source sentence. | 0 | kann 7.nicht 8. |
The resulting model is compact, efficiently learnable and linguistically expressive. | 0 | Specifically, for both settings we report results on the median run for each setting. |
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 | One knowledge source, called WordSemCFSem, is analogous to CFLex: it checks whether the anaphor and candidate antecedent are substitutable for one another, but based on their semantic classes instead of the words themselves. |
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 | Our second contribution is to apply instance weighting at the level of phrase pairs. |
The bias of automatic methods in favour of statistical systems seems to be less pronounced on out-of-domain test data. | 0 | In the graphs, system scores are indicated by a point, the confidence intervals by shaded areas around the point. |
While many systems had similar performance, the results offered interesting insights, especially, about the relative performance of statistical and rule-based systems. | 0 | We divide up each test set into blocks of 20 sentences (100 blocks for the in-domain test set, 53 blocks for the out-of-domain test set), check for each block, if one system has a higher BLEU score than the other, and then use the sign test. |
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 | We also thank ChaoHuang Chang, reviewers for the 1994 ACL conference, and four anonymous reviewers for Computational Linguistics for useful comments. |
It outperformed strong unsupervised baselines as well as approaches that relied on direct projections, and bridged the gap between purely supervised and unsupervised POS tagging models. | 0 | In the label propagation stage, we propagate the automatic English tags to the aligned Italian trigram types, followed by further propagation solely among the Italian vertices. the Italian vertices are connected to an automatically labeled English vertex. |
However, these approaches are ill-equipped to directly represent type-based constraints such as sparsity. | 0 | For each cell, the first row corresponds to the result using the best hyperparameter choice, where best is defined by the 11 metric. |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | Hence, we use the bootstrap resampling method described by Koehn (2004). |
The fact that projective dependency parsers can never exactly reproduce the analyses found in non-projective tree banks is often neglected because of the relative scarcity of problematic constructions. | 0 | The last four columns in Table 3 show the distribution of nonprojective arcs with respect to the number of lifts required. |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | Links can be of two different kinds: anaphoric or bridging (definite noun phrases picking up an antecedent via world-knowledge). |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | The dictionary sizes reported in the literature range from 17,000 to 125,000 entries, and it seems reasonable to assume that the coverage of the base dictionary constitutes a major factor in the performance of the various approaches, possibly more important than the particular set of methods used in the segmentation. |
They extended previous work on discriminative weighting by using a finer granularity, focusing on the properties of instances rather than corpus components, and used simpler training procedure. | 0 | (Thus the domain of the dev and test corpora matches IN.) |
Their method did not assume any knowledge about the target language, making it applicable to a wide array of resource-poor languages. | 0 | Central to our approach (see Algorithm 1) is a bilingual similarity graph built from a sentence-aligned parallel corpus. |
A beam search concept is applied as in speech recognition. | 0 | The negative logarithm of t0 is reported. |
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 | An ATM has two types of states, existential and universal. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | Figure 2: An ATB sample from the human evaluation. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | 52 15. |
The bias of automatic methods in favour of statistical systems seems to be less pronounced on out-of-domain test data. | 0 | Not every annotator was fluent in both the source and the target language. |
The features were weighted within a logistic model that gave an overall weight that was applied to the phrase pair and MAP-smoothed relative-frequency estimates which were combined linearly with relative-frequency estimates from an in-domain phrase table. | 0 | Dropping the conditioning on 0 for brevity, and letting ¯cλ(s, t) = cλ(s, t) + yu(s|t), and ¯cλ(t) = 4Note that the probabilities in (7) need only be evaluated over the support of ˜p(s, t), which is quite small when this distribution is derived from a dev set. |
Das and Petrov, in this paper, approached inducing unsupervised part-of-speech taggers for languages that had no labeled training data, but had translated text in a resource-rich language. | 0 | Finally, note that while most feature concepts are lexicalized, others, such as the suffix concept, are not. |
Their results suggested that it was possible to learn accurate POS taggers for languages which did not have any annotated data, but have translations into a resource-rich language. | 0 | Furthermore we expect the label distributions on the foreign to be fairly noisy, because the graph constraints have not been taken into account yet. |
the "Potsdam Commentary Corpus" or PCC consists of 170 commentaries from Ma¨rkische Allgemeine Zeitung, a German regional daily. | 0 | This means that the PCC cannot grow particularly quickly. |
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 | 67 95. |
Their method did not assume any knowledge about the target language, making it applicable to a wide array of resource-poor languages. | 0 | Label propagation can then be used to transfer the labels to the peripheral foreign vertices (i.e. the ones adjacent to the English vertices) first, and then among all of the foreign vertices (§4). |
The use of global features has shown excellent result in the performance on MUC-6 and MUC-7 test data. | 0 | Feature selection is implemented using a feature cutoff: features seen less than a small count during training will not be used. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | As described in Sproat (1995), the Chinese segmenter presented here fits directly into the context of a broader finite-state model of text analysis for speech synthesis. |
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 | Training examples are generated automatically by identifying noun phrases that can be easily resolved with their antecedents using lexical and syntactic heuristics. |
They proposed a single joint model for performing both morphological segmentation and syntactic disambiguation which bypasses the associated circularity. | 0 | Several such particles may be prefixed onto a single stem, in which case the affixation is subject to strict linear precedence constraints. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | 3 Throughout this paper we shall give Chinese examples in traditional orthography, followed. |
Due to many similarly performing systems, they are not able to draw strong conclusions on the question of correlation of manual and automatic evaluation metrics. | 0 | Systems that generally do worse than others will receive a negative one. |
These clusters are computed using an SVD variant without relying on transitional structure. | 0 | Specifically, for both settings we report results on the median run for each setting. |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | If either case is true, then CFLex reports that the anaphor and candidate might be coreferent. |
The authors believe automatic paraphrase discovery is an important component for building a fully automatic information extraction system. | 0 | Once we figure out the important word (e.g. keyword), we believe we can capture the meaning of the phrase by the keyword. |
The problem of coreference resolution has received considerable attention, including theoretical discourse models and supervised machine learning systems. | 0 | This solution also obviates the need to perform word sense disambiguation. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | 64 76. |
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 | The range of the score is between 0 and 1 (higher is better). |
Other kinds of productive word classes, such as company names, abbreviations,and place names can easily be handled given appropriate models. | 0 | One class comprises words derived by productive morphologi cal processes, such as plural noun formation using the suffix ir, menD. |
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 | We evaluate our model on seven languages exhibiting substantial syntactic variation. |
They proposed an unsupervised method to discover paraphrases from a large untagged corpus. | 0 | In general, different modalities (âplanned to buyâ, âagreed to buyâ, âboughtâ) were considered to express the same relationship within an extraction setting. |
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 | The Input The set of analyses for a token is thus represented as a lattice in which every arc corresponds to a specific lexeme l, as shown in Figure 1. |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | level. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.