source_text stringlengths 27 368 | label int64 0 1 | target_text stringlengths 1 5.38k |
|---|---|---|
This paper discusses the Potsdam Commentary Corpus, a corpus of german assembeled by potsdam university. | 0 | In order to evaluate and advance this approach, it helps to feed into the knowledge base data that is already enriched with some of the desired information â as in PCC. |
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 | Third, we develop a human interpretable grammar that is competitive with a latent variable PCFG. |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | Our system does not currently make use of titles, but it would be straightforward to do so within the finite-state framework that we propose. |
It is annotated with several data: morphology, syntax, rhetorical structure, connectors, correference and informative structure. | 0 | This was also inspired by the work on the Penn Discourse Tree Bank7 , which follows similar goals for English. |
In order to create good-sized vectors for similarity calculation, they had to set a high frequency threshold. | 0 | One is the accuracy within a set of phrases which share the same keyword; the other is the accuracy of links. |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | That is, we can use the discourse parser on PCC texts, emulating for instance a âco-reference oracleâ that adds the information from our co-reference annotations. |
An extended lexicon model is defined, and its likelihood is compared to a baseline lexicon model, which takes only single-word dependencies into account. | 0 | Our approach uses word-to-word dependencies between source and target words. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | Interestingly, Chang et al. report 80.67% recall and 91.87% precision on an 11,000 word corpus: seemingly, our system finds as many names as their system, but with four times as many false hits. |
All the texts were annotated by two people. | 0 | Nonetheless, the prospect of a network of annotated discourse resources seems particularly promising if not only a single annotation layer is used but a whole variety of them, so that a systematic search for correlations between them becomes possible, which in turn can lead to more explanatory models of discourse struc... |
Using less training data than other systems, their NER can perform as well as other state-of-the-art NERs. | 0 | In this paper, we show that the maximum entropy framework is able to make use of global information directly, and achieves performance that is comparable to the best previous machine learning-based NERs on MUC6 and MUC7 test data. |
The TRIE model uses less memory than the smallest lossless alternative and is still faster than SRILM. | 0 | It did 402 queries/ms using 1.80 GB. cMemory use increased during scoring due to batch processing (MIT) or caching (Rand). |
The manual evaluation of scoring translation on a graded scale from 1–5 seemed to be very hard to perform. | 0 | This data set of manual judgements should provide a fruitful resource for research on better automatic scoring methods. |
Throughout this paper we compare with several packages: SRILM 1.5.12 (Stolcke, 2002) is a popular toolkit based on tries used in several decoders. | 0 | Our test machine has two Intel Xeon E5410 processors totaling eight cores, 32 GB RAM, and four Seagate Barracuda disks in software RAID 0 running Linux 2.6.18. |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | A corpus of German newspaper commentaries has been assembled at Potsdam University, and annotated with different linguistic information, to different degrees. |
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 our grammar, features are realized as annotations to basic category labels. |
The authors believe automatic paraphrase discovery is an important component for building a fully automatic information extraction system. | 0 | Here, âEGâ represents âEastern Group Plcâ. |
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 | Table 2 shows results for both settings and all methods described in sections 2 and 3. |
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 | Certainly these linguistic factors increase the difficulty of syntactic disambiguation. |
This paper presents methods to query N-gram language models, minimizing time and space costs. | 0 | We maintain a separate array for each length n containing all n-gram entries sorted in suffix order. |
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 | Thus, the length of any string in L is a linear combination of the length of strings in some fixed finite subset of L, and thus L is said to have the constant growth property. |
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 | By making use of global context, it has achieved excellent results on both MUC6 and MUC7 official test data. |
The experimental tests are carried out on the Verbmobil task which is a limited-domain spoken-language task. | 0 | Covering the first uncovered position in the source sentence, we use the language model probability p(ej$; $). |
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 | Proper names are assumed to be coreferent if they match exactly, or if they closely match based on a few heuristics. |
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 | 0n0'i'i0'2"bin242bn I n = 711 + n2 } On the other hand, no linguistic use is made of this general form of composition and Steedman (personal communication) and Steedman (1986) argues that a more limited definition of composition is more natural. |
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 | 2.2.2 The Caseframe Network The first type of contextual role knowledge that BABAR learns is the Caseframe Network (CFNet), which identifies caseframes that co-occur in anaphor/antecedent resolutions. |
An extended lexicon model is defined, and its likelihood is compared to a baseline lexicon model, which takes only single-word dependencies into account. | 0 | input: source string f1:::fj :::fJ initialization for each cardinality c = 1; 2; ; J do for each pair (C; j), where j 2 C and jCj = c do for each target word e 2 E Qe0 (e; C; j) = p(fj je) max Ã;e00 j02Cnfjg fp(jjj0; J) p(Ã) pÃ(eje0; e00) Qe00 (e0;C n fjg; j0)g words fj in the input string of length J. For the final... |
The overall parsing accuracy obtained with the pseudo-projective approach is still lower than for the best projective parsers. | 0 | More details on the parsing algorithm can be found in Nivre (2003). |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | Dagan and Itai (Dagan and Itai, 1990) experimented with co-occurrence statistics that are similar to our lexical caseframe expectations. |
The TRIE model uses less memory than the smallest lossless alternative and is still faster than SRILM. | 0 | While the paper mentioned a sorted variant, code was never released. |
The problem of coreference resolution has received considerable attention, including theoretical discourse models and supervised machine learning systems. | 0 | We refer to this process as Reliable Case Resolution because it involves finding cases of anaphora that can be easily resolved with their antecedents. |
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 | We attain these results using several optimizations: hashing, custom lookup tables, bit-level packing, and state for left-to-right query patterns. |
Using less training data than other systems, their NER can perform as well as other state-of-the-art NERs. | 0 | We propose maximizing , where is the sequence of named- entity tags assigned to the words in the sentence , and is the information that can be extracted from the whole document containing . Our system is built on a maximum entropy classifier. |
The overall performance of their joint framework demonstrated that a probability distribution obtained over mere syntactic contexts using a Treebank grammar and a data-driven lexicon outperformed upper bounds proposed by previous joint disambiguation systems and achieved segmentation and parsing results on a par with s... | 0 | Morphological disambiguators that consider a token in context (an utterance) and propose the most likely morphological analysis of an utterance (including segmentation) were presented by Bar-Haim et al. (2005), Adler and Elhadad (2006), Shacham and Wintner (2007), and achieved good results (the best segmentation result... |
The resulting model is compact, efficiently learnable and linguistically expressive. | 0 | The P (W |T , Ï) term in the lexicon component now decomposes as: n P (W |T , Ï) = n P (Wi|Ti, Ï) i=1 n   tions are not modeled by the standard HMM, which = n ï£ n P (v|ÏTi f ) instead can model token-level frequency. |
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 | Tag set As is standard, for all experiments, we set the number of latent model tag states to the size of the annotated tag set. |
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 | The learned patterns are then normalized and applied to the corpus. |
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 productions of HG's are very similar to those of CFG's except that the operation used must be made explicit. |
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 | (See Sproat and Shih 1995.) |
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 | £ : _ADV: 5.88 If:! |
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 | In TAG's the elementary tree and addresses where adjunction takes place are used to instantiate the operation. |
This paper offers a broad insight into of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model design. | 0 | However, the data sparsity induced by vocalization makes it difficult to train statistical models on corpora of the size of the ATB, so vocalizing and then parsing may well not help performance. |
They proposed an unsupervised method to discover paraphrases from a large untagged corpus. | 0 | Although this is not a precise criterion, most cases we evaluated were relatively clear-cut. |
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 | On the first of these-the B set-our system had 64% recall and 86% precision; on the second-the C set-it had 33% recall and 19% precision. |
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 | This paper is based on work supported in part by DARPA through IBM. |
They have made use of local and global features to deal with the instances of same token in a document. | 0 | If they are found in a list, then a feature for that list will be set to 1. |
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 derivation trees of a MCTAG are similar to those of a TAG. |
The experimental tests are carried out on the Verbmobil task which is a limited-domain spoken-language task. | 0 | 4.1 The Task and the Corpus. |
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 | HR0011-06-C-0022. |
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 | The tokens w are generated by token-level tags t from an HMM parameterized by the lexicon structure. |
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 | The “No LP” model does not outperform direct projection for German and Greek, but performs better for six out of eight languages. |
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 | Feature-based HMM Model (Berg- Kirkpatrick et al., 2010): The KM model uses a variety of orthographic features and employs the EM or LBFGS optimization algorithm; Posterior regulariation model (Grac¸a et al., 2009): The G10 model uses the posterior regular- ization approach to ensure tag sparsity constraint. |
However, these approaches are ill-equipped to directly represent type-based constraints such as sparsity. | 0 | 2 56.2 32. |
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 | But diacritics are not present in unvocalized text, which is the standard form of, e.g., news media documents.3 VBD she added VP PUNC S VP VBP NP ... |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | Our suspicion is that BLEU is very sensitive to jargon, to selecting exactly the right words, and not synonyms that human judges may appreciate as equally good. |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | We will briefly discuss this point in Section 3.1. |
In order to realize the full potential of dependency-based syntactic parsing, it is desirable to allow non-projective dependency structures. | 0 | It is also true of the adaptation of the Collins parser for Czech (Collins et al., 1999) and the finite-state dependency parser for Turkish by Oflazer (2003). |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | If two systems’ scores are close, this may simply be a random effect in the test data. |
They proposed an unsupervised method to discover paraphrases from a large untagged corpus. | 0 | Notice that the CC-domain is a special case. |
Two general approaches are presented and two combination techniques are described for each approach. | 0 | We have presented two general approaches to studying parser combination: parser switching and parse hybridization. |
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 | We extend Subramanya et al.’s intuitions to our bilingual setup. |
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 | Yet we note that the better grammars without pruning outperform the poorer grammars using this technique, indicating that the syntactic context aids, to some extent, the disambiguation of unknown tokens. |
This paper presents a maximum entropy-based named entity recognizer (NER). | 0 | We have estimated the performance of IdentiFinder ' 99 at 200K words of training data from the graphs. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | For. |
Combining multiple highly-accurate independent parsers yields promising results. | 0 | The maximum precision row is the upper bound on accuracy if we could pick exactly the correct constituents from among the constituents suggested by the three parsers. |
Here both parametric and non-parametric models are explored. | 0 | Both of the switching techniques, as well as the parametric hybridization technique were also shown to be robust when a poor parser was introduced into the experiments. |
This paper offers a broad insight into of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model design. | 0 | of Arabic. |
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 | Formally, the DempsterShafer theory defines a probability density function m(S), where S is a set of hypotheses. |
This paper conducted research in the area of automatic paraphrase discovery. | 0 | Also, we donât know how many such paraphrase sets are necessary to cover even some everyday things or events. |
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 | To differentiate between the coordinating and discourse separator functions of conjunctions (Table 3), we mark each CC with the label of its right sister (splitCC). |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | gaolxing4 'happy' => F.i'JF.i'J Jl! |
They incorporated instance-weighting into a mixture-model framework, and found that it yielded consistent improvements over a wide range of baselines. | 0 | The 1st block contains the simple baselines from section 2.1. |
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | Table 3 shows BABARâs performance when the four contextual role knowledge sources are added. |
The second algorithm builds on a boosting algorithm called AdaBoost. | 0 | Now assume we have n pairs (xi,, x2,i) drawn from X1 X X2, where the first m pairs have labels whereas for i = m+ 1...n the pairs are unlabeled. |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | However, the point of RandLM is to scale to even larger data, compensating for this loss in quality. |
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 | Second, comparisons of different methods are not meaningful unless one can eval uate them on the same corpus. |
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 | Several methods exist to handle collisions; we use linear probing because it has less memory overhead when entries are small. |
The authors in this paper describe a search procedure for statistical machine translation (MT) based on dynamic programming (DP). | 0 | This number must be less than or equal to n ô 1. |
Through parser combination we have reduced the precision error rate by 30% and the recall error rate by 6% compared to the best previously published result. | 0 | We have presented two general approaches to studying parser combination: parser switching and parse hybridization. |
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 | 63 95. |
Through parser combination we have reduced the precision error rate by 30% and the recall error rate by 6% compared to the best previously published result. | 0 | We have developed a general approach for combining parsers when preserving the entire structure of a parse tree is important. |
A beam search concept is applied as in speech recognition. | 0 | (f1; ;mg n fl1; l2g ; l) 4 (f1; ;m ô 1g n fl1; l2; l3g ; l0) ! |
Most IE researchers have been creating paraphrase knowledge by hand and specific tasks. | 0 | Here, an NE instance pair is any pair of NEs separated by at most 4 syntactic chunks; for example, âIBM plans to acquire Lotusâ. |
We chose one of four labels for each example: location, person, organization, or noise where the noise category was used for items that were outside the three categories. | 0 | Alternatively, h can be thought of as defining a decision list of rules x y ranked by their "strength" h(x, y). |
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 | Test set OOV rate is computed using the following splits: ATB (Chiang et al., 2006); CTB6 (Huang and Harper, 2009); Negra (Dubey and Keller, 2003); English, sections 221 (train) and section 23 (test). |
This paper talks about Exploiting Diversity in Natural Language Processing: Combining Parsers. | 0 | We used section 23 as the development set for our combining techniques, and section 22 only for final testing. |
The AdaBoost algorithm was developed for supervised learning. | 0 | Note that Zt is a normalization constant that ensures the distribution Dt+i sums to 1; it is a function of the weak hypothesis ht and the weight for that hypothesis at chosen at the tth round. |
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 | In these examples, the names identified by the two systems (if any) are underlined; the sentence with the correct segmentation is boxed.19 The differences in performance between the two systems relate directly to three issues, which can be seen as differences in the tuning of the models, rather than repre senting dif... |
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 | An example of a fairly low-level relation is the affix relation, which holds between a stem morpheme and an affix morpheme, such as f1 -menD (PL). |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | TRIE uses less memory and has better locality. |
It is annotated with several data: morphology, syntax, rhetorical structure, connectors, correference and informative structure. | 0 | Among the IS-units, the referring expressions are marked as such and will in the second phase receive a label for cognitive status (active, accessible- text, accessible-situation, inferrable, inactive). |
This assumption, however, is not inherent to type-based tagging models. | 0 | (2009) on Portuguese (Grac¸a et al. |
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 | We would like to relax somewhat the constraint on the path complexity of formalisms in LCFRS. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | On a set of 11 sentence fragments-the A set-where they reported 100% recall and precision for name identification, we had 73% recall and 80% precision. |
They focused on phrases which two Named Entities, and proceed in two stages. | 0 | One possibility is to use n-grams based on mutual information. |
Here both parametric and non-parametric models are explored. | 0 | One hybridization strategy is to let the parsers vote on constituents' membership in the hypothesized set. |
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 | Across all languages, +PRIOR consistently outperforms 1TW, reducing error on average by 9.1% and 5.9% on best and median settings respectively. |
All the texts were annotated by two people. | 0 | This means that the PCC cannot grow particularly quickly. |
There is no global pruning. | 0 | German city names are replaced by category markers. |
This paper presents methods to query N-gram language models, minimizing time and space costs. | 0 | While the paper mentioned a sorted variant, code was never released. |
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 | 7). |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.