source_text stringlengths 27 368 | label int64 0 1 | target_text stringlengths 1 5.38k |
|---|---|---|
The contextual rules are restricted and may not be applicable to every example, but the spelling rules are generally applicable and should have good coverage. | 0 | Using the virtual distribution Di (i) and pseudo-labels"y.,„ values for Wo, W± and W_ can be calculated for each possible weak hypothesis (i.e., for each feature x E Xi); the weak hypothesis with minimal value for Wo + 2/WW _ can be chosen as before; and the weight for this weak hypothesis at = ln ww+411:) can be ... |
The corpus was annoted with different linguitic information. | 0 | One key issue here is to seek a discourse-based model of information structure. |
The approach has been successfully tested on the 8 000-word Verbmobil task. | 0 | For the translation experiments, Eq. 2 is recursively evaluated. |
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 | 4.1 Dictionary Representation. |
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: rlls@bell-labs. |
Due to many similarly performing systems, the author was not able to draw strong conclusions on the question of correlation of manual and automatic evaluation metrics. | 0 | Making the ten judgements (2 types for 5 systems) takes on average 2 minutes. |
Evaluation was done automatically using the BLEU score and manually on fluency and adequacy. | 0 | We computed BLEU scores for each submission with a single reference translation. |
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 | (2010) and the posterior regular- ization HMM of Grac¸a et al. |
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 | The above auxiliary quantity satisfies the following recursive DP equation: Qe0 (e; C; j) = Initial Skip Verb Final 1. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | Our baseline for all sentence lengths is 5.23% F1 higher than the best previous result. |
While many systems had similar performance, the results offered interesting insights, especially, about the relative performance of statistical and rule-based systems. | 0 | Due to many similarly performing systems, we are not able to draw strong conclusions on the question of correlation of manual and automatic evaluation metrics. |
The use of global features has shown excellent result in the performance on MUC-6 and MUC-7 test data. | 0 | Unique Occurrences and Zone (UNIQ): This group of features indicates whether the word is unique in the whole document. |
Their work is closely related to recent approaches that incorporate the sparsity constraint into the POS induction process. | 0 | 0 57.2 43. |
This corpus has several advantages: it is annotated at different levels. | 0 | The choice of the particular newspaper was motivated by the fact that the language used in a regional daily is somewhat simpler than that of papers read nationwide. |
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 | During testing, it is possible that the classifier produces a sequence of inadmissible classes (e.g., person begin followed by location unique). |
They used graph-based label propagation for cross-lingual knowledge transfer and used the projected labels as features in an unsupervised model. | 0 | Each feature concept is akin to a random variable and its occurrence in the text corresponds to a particular instantiation of that random variable. |
This paper offers a broad insight into of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model design. | 0 | But it conflates the coordinating and discourse separator functions of wa (<..4.b � �) into one analysis: conjunction(Table 3). |
Finally, several coreference systems have successfully incorporated anaphoricity determination modules. | 0 | For terrorism, BABAR generated 5,078 resolutions: 2,386 from lexical seeding and 2,692 from syntactic seeding. |
Most IE researchers have been creating paraphrase knowledge by hand and specific tasks. | 0 | For example, in the CC-domain, 96 keywords are found which have TF/ITF scores above a threshold; some of them are shown in Figure 3. |
The PROBING data structure uses linear probing hash tables and is designed for speed. | 0 | This material is based upon work supported by the National Science Foundation Graduate Research Fellowship under Grant No. |
They plan on extending instance-weighting to other standard SMT components and capture the degree of generality of phrase pairs. | 0 | The weight on each sentence is a value in [0, 1] computed by a perceptron with Boolean features that indicate collection and genre membership. |
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 | The idea of distinguishing between general and domain-specific examples is due to Daum´e and Marcu (2006), who used a maximum-entropy model with latent variables to capture the degree of specificity. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | Full Chinese personal names are in one respect simple: they are always of the form family+given. |
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 | In this paper we study the problem of using a parallel corpus from a background domain (OUT) to improve performance on a target domain (IN) for which a smaller amount of parallel training material—though adequate for reasonable performance—is also available. |
Here we present two algorithms. | 0 | Equ. |
All the texts were annotated by two people. | 0 | For the âcoreâ portion of PCC, we found that on average, 35% of the coherence relations in our RST annotations are explicitly signalled by a lexical connective.6 When adding the fact that connectives are often ambiguous, one has to conclude that prospects for an automatic analysis of rhetorical structure using shal... |
They have made use of local and global features to deal with the instances of same token in a document. | 0 | During testing, it is possible that the classifier produces a sequence of inadmissible classes (e.g., person begin followed by location unique). |
They incorporated instance-weighting into a mixture-model framework, and found that it yielded consistent improvements over a wide range of baselines. | 0 | Somewhat surprisingly, there do not appear to be large systematic differences between linear and MAP combinations. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | Since foreign names can be of any length, and since their original pronunciation is effectively unlimited, the identi fication of such names is tricky. |
Each out-of-domain phrase pair was characterized by a set of simple features intended to reflect how useful it would be. | 0 | ), which precludes a single universal approach to adaptation. |
The corpus was annoted with different linguitic information. | 0 | 3.5 Improved models of discourse. |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | For a language like English, this problem is generally regarded as trivial since words are delimited in English text by whitespace or marks of punctuation. |
Other kinds of productive word classes, such as company names, abbreviations,and place names can easily be handled given appropriate models. | 0 | This latter evaluation compares the performance of the system with that of several human judges since, as we shall show, even people do not agree on a single correct way to segment a text. |
The TRIE model uses less memory than the smallest lossless alternative and is still faster than SRILM. | 0 | Table 2 shows single-threaded results, mostly for comparison to IRSTLM, and Table 3 shows multi-threaded results. |
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 | In contrast to the Bayesian HMM, θt is not drawn from a distribution which has support for each of the n word types. |
This paper presents a maximum entropy-based named entity recognizer (NER). | 0 | In the maximum entropy framework, there is no such constraint. |
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 | This extends previous work on discriminative weighting by using a finer granularity, focusing on the properties of instances rather than corpus components, and using a simpler training procedure. |
These clusters are computed using an SVD variant without relying on transitional structure. | 0 | Note that while the standard HMM, has O(K n) emission parameters, our model has O(n) effective parameters.3 Token Component Once HMM parameters (Ï, θ) have been drawn, the HMM generates a token-level corpus w in the standard way: P (w, t|Ï, θ) = P (T , W , θ, Ï, Ï, t, w|α, β) = P (T , W , Ï|β) [Lexicon]  ... |
While many systems had similar performance, the results offered interesting insights, especially, about the relative performance of statistical and rule-based systems. | 0 | While we used the standard metrics of the community, the we way presented translations and prompted for assessment differed from other evaluation campaigns. |
The PROBING data structure uses linear probing hash tables and is designed for speed. | 0 | If the key distribution’s range is also known (i.e. vocabulary identifiers range from 0 to the number of words), then interpolation search can use this information instead of reading A[0] and A[|A |− 1] to estimate pivots; this optimization alone led to a 24% speed improvement. |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | The corpus has been annotated with six different types of information, which are characterized in the following subsections. |
A beam search concept is applied as in speech recognition. | 0 | An inverted alignment is defined as follows: inverted alignment: i ! j = bi: Target positions i are mapped to source positions bi. |
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 | A tree set may be said to have dependencies between paths if some "appropriate" subset can be shown to have dependent paths as defined above. |
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | We evaluated BABAR on two domains: terrorism and natural disasters. |
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 | The samples from each corpus were independently evaluated. |
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 | Each parse is converted into a set of constituents represented as a tuples: (label, start, end). |
Here both parametric and non-parametric models are explored. | 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. |
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 | In contrast to these approaches, our method directly incorporates these constraints into the structure of the model. |
They have made use of local and global features to deal with the instances of same token in a document. | 0 | In MUC6, the best result is achieved by SRA (Krupka, 1995). |
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 | of Tokens No. |
Using less training data than other systems, their NER can perform as well as other state-of-the-art NERs. | 0 | Besides size of training data, the use of dictionaries is another factor that might affect performance. |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | This approach is similar to BABAR in that they both acquire knowledge from earlier resolutions. |
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 | It is important to bear in mind, though, that this is not an inherent limitation of the model. |
The second algorithm builds on a boosting algorithm called AdaBoost. | 0 | It may be more realistic to replace the second criteria with a softer one, for example (Blum and Mitchell 98) suggest the alternative Alternatively, if Ii and 12 are probabilistic learners, it might make sense to encode the second constraint as one of minimizing some measure of the distance between the distributions gi... |
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 | On several languages, we report performance exceeding that of more complex state-of-the art systems.1 |
The resulting model is compact, efficiently learnable and linguistically expressive. | 0 | This distributional sparsity of syntactic tags is not unique to English 1 The source code for the work presented in this paper is available at http://groups.csail.mit.edu/rbg/code/typetagging/. |
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 | Model Overview The model starts by generating a tag assignment T for each word type in a vocabulary, assuming one tag per word. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | For parsing, this is a mistake, especially in the case of interrogatives. |
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 showed in §2 that lexical ambiguity explains the underperformance of these categories. |
The code is open source, has minimal dependencies, and offers both C++ and Java interfaces for integration. | 0 | For even larger models, we recommend RandLM; the memory consumption of the cache is not expected to grow with model size, and it has been reported to scale well. |
This paper presents methods to query N-gram language models, minimizing time and space costs. | 0 | When two partial hypotheses have equal state (including that of other features), they can be recombined and thereafter efficiently handled as a single packed hypothesis. |
This corpus has several advantages: it is annotated at different levels. | 0 | The paper explains the design decisions taken in the annotations, and describes a number of applications using this corpus with its multi-layer annotation. |
The resulting model is compact, efficiently learnable and linguistically expressive. | 0 | In total there are O(K 2) parameters associated with the transition parameters. |
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | ( b ) s u p p o r t s c a n d i d a t e i f s e l e c t e d s e m a n t i c t a g s m a t c h t h o s e o f t h e a n a p h o r . Le xic al computes degree of lexical overlap b e t w e e n t h e c a n d i d a t e a n d t h e a n a p h o r . Re cen cy computes the relative distance between the c a n d i d a t e a n d t ... |
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 | We characterize a class of formalisms that have this property in Section 4. |
The resulting model is compact, efficiently learnable and linguistically expressive. | 0 | Our analysis identifies three key factors driving our performance gain: 1) selecting a model structure which directly encodes tag sparsity, 2) a type-level prior on tag assignments, and 3) a straightforward na¨ıveBayes approach to incorporate features. |
In order to create good-sized vectors for similarity calculation, they had to set a high frequency threshold. | 0 | Sometime, multiple words are needed, like âvice chairmanâ, âprime ministerâ or âpay forâ (âpayâ and âpay forâ are different senses in the CC-domain). |
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 | Given this similarity function, we define a nearest neighbor graph, where the edge weight for the n most similar vertices is set to the value of the similarity function and to 0 for all other vertices. |
There is no global pruning. | 0 | This number must be less than or equal to n ô 1. |
This assumption, however, is not inherent to type-based tagging models. | 0 | 1 55.8 38. |
The bias of automatic methods in favour of statistical systems seems to be less pronounced on out-of-domain test data. | 0 | was done by the participants. |
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 | Since guess and gold trees may now have different yields, the question of evaluation is complex. |
Replacing this with a ranked evaluation seems to be more suitable. | 0 | Given the closeness of most systems and the wide over-lapping confidence intervals it is hard to make strong statements about the correlation between human judgements and automatic scoring methods such as BLEU. |
This topic has been getting more attention, driven by the needs of various NLP applications. | 0 | Although this is not a precise criterion, most cases we evaluated were relatively clear-cut. |
The use of global features has shown excellent result in the performance on MUC-6 and MUC-7 test data. | 0 | MENE has only been tested on MUC7. |
However, these approaches are ill-equipped to directly represent type-based constraints such as sparsity. | 0 | On one end of the spectrum are clustering approaches that assign a single POS tag to each word type (Schutze, 1995; Lamar et al., 2010). |
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 | So, 1: f, xue2shengl+men0 (student+PL) 'students' occurs and we estimate its cost at 11.43; similarly we estimate the cost of f, jiang4+men0 (general+PL) 'generals' (as in 'J' f, xiao3jiang4+men0 'little generals'), at 15.02. |
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 | Otherwise, label the training data with the combined spelling/contextual decision list, then induce a final decision list from the labeled examples where all rules (regardless of strength) are added to the decision list. |
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 | The following recursive equation is evaluated: Qe0 (e; S; C; j) = (2) = p(fj je) max Ã;e00 np(jjj0; J) p(Ã) pÃ(eje0; e00) max (S0;j0) (S0 ;Cnfjg;j0)!(S;C;j) j02Cnfjg Qe00 (e0; S0;C n fjg; j0)o: The search ends in the hypotheses (I; f1; ; Jg; j). |
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 | 2. |
These clusters are computed using an SVD variant without relying on transitional structure. | 0 | We tokenize MWUs and their POS tags; this reduces the tag set size to 12. |
The authors cluster NE instance pairs based on the words in the context using bag-of-words methods. | 0 | However, it is desirable if we can separate them. |
It is annotated with several data: morphology, syntax, rhetorical structure, connectors, correference and informative structure. | 0 | âested in correlations between prosody and dis course structure. |
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 | . |
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 | In this paper, we show how non-projective dependency parsing can be achieved by combining a datadriven projective parser with special graph transformation techniques. |
This paper offers a broad insight into of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model design. | 0 | Certainly these linguistic factors increase the difficulty of syntactic disambiguation. |
Due to many similarly performing systems, the author was not able to draw strong conclusions on the question of correlation of manual and automatic evaluation metrics. | 0 | Microsoft’s approach uses dependency trees, others use hierarchical phrase models. |
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | In this situation, BABAR takes the conservative approach and declines to make a resolution. |
The authors believe automatic paraphrase discovery is an important component for building a fully automatic information extraction system. | 0 | Step 4. |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | However their work did not consider other types of lexical expectations (e.g., PP arguments), semantic expectations, or context comparisons like our case- frame network.(Niyu et al., 1998) used unsupervised learning to ac quire gender, number, and animacy information from resolutions produced by a statistical pronoun r... |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | On the other hand, when all systems produce muddled output, but one is better, and one is worse, but not completely wrong, a judge is inclined to hand out judgements of 4, 3, and 2. |
The texts were annotated with the RSTtool. | 0 | The significant drop in number of pupils will begin in the fall of 2003. |
The approach assumes that the word reordering is restricted to a few positions in the source sentence. | 0 | Two subjects are each given a calendar and they are asked to schedule a meeting. |
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 | 1 55.8 38. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | To improve agreement during the revision process, a dual-blind evaluation was performed in which 10% of the data was annotated by independent teams. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | Several systems propose statistical methods for handling unknown words (Chang et al. 1992; Lin, Chiang, and Su 1993; Peng and Chang 1993). |
The AdaBoost algorithm was developed for supervised learning. | 0 | 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. |
The approach has been successfully tested on the 8 000-word Verbmobil task. | 0 | The complexity of the quasimonotone search is O(E3 J (R2+LR)). |
Finally, several coreference systems have successfully incorporated anaphoricity determination modules. | 0 | The second case involves existential noun phrases (Allen, 1995), which are noun phrases that uniquely specify an object or concept and therefore do not need a prior referent in the discourse. |
Here we present two algorithms. | 0 | The core of Yarowsky's algorithm is as follows: where h is defined by the formula in equation 2, with counts restricted to training data examples that have been labeled in step 2. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.