source_text stringlengths 27 368 | label int64 0 1 | target_text stringlengths 1 5.38k |
|---|---|---|
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 | Two common cases are the attribu tive adjective and the process nominal _; maSdar, which can have a verbal reading.4 At tributive adjectives are hard because they are or- thographically identical to nominals; they are inflected for gender, number, case, and definiteness. |
The TRIE model uses less memory than the smallest lossless alternative and is still faster than SRILM. | 0 | Our open-source (LGPL) implementation is also available for download as a standalone package with minimal (POSIX and g++) dependencies. |
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 | Thus an explicit assumption about the redundancy of the features — that either the spelling or context alone should be sufficient to build a classifier — has been built into the algorithm. |
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 | It was filtered to retain the top 30 translations for each source phrase using the TM part of the current log-linear model. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | English parsing evaluations usually report results on sentences up to length 40. |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | Indeed there are several open issues. |
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | An important aspect of the DempsterShafer model is that it operates on sets of hypotheses. |
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 cell, the first row corresponds to the result using the best hyperparameter choice, where best is defined by the 11 metric. |
The manual evaluation of scoring translation on a graded scale from 1â5 seems to be very hard to perform. | 0 | Lack of correct reference translations was pointed out as a short-coming of our evaluation. |
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 | Table 5 shows the overall parsing accuracy attained with the three different encoding schemes, compared to the baseline (no special arc labels) and to training directly on non-projective dependency graphs. |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | Note that Wang, Li, and Chang's. |
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 | Although we have not done any experiments on other languages, this way of using global features from a whole document should be applicable to other languages. |
The manual evaluation of scoring translation on a graded scale from 1â5 seems to be very hard to perform. | 0 | For more on the participating systems, please refer to the respective system description in the proceedings of the workshop. |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | Compared with SRILM, IRSTLM adds several features: lower memory consumption, a binary file format with memory mapping, caching to increase speed, and quantization. |
Evaluation was done automatically using the BLEU score and manually on fluency and adequacy. | 0 | The bootstrap method has been critized by Riezler and Maxwell (2005) and Collins et al. (2005), as being too optimistic in deciding for statistical significant difference between systems. |
Each out-of-domain phrase pair was characterized by a set of simple features intended to reflect how useful it would be. | 0 | Discriminative Instance Weighting for Domain Adaptation in Statistical Machine Translation |
Other kinds of productive word classes, such as company names, abbreviations,and place names can easily be handled given appropriate models. | 0 | 0 X u} "' o; .2 X X><X X XX X X X X X X x X X X X X x X V X X X X .;t'*- XXX:OX X X X X X X 9 x X X XX XX X X X X X X X XXX:< X X>O<XX>!KXX XI<>< »C X X XX :X: X X "' X X XX >OO<X>D<XIK X X X X X X --XX»: XXX X X»C X X«X...C:XXX X Xll< X X ><XX>IIC:liiC:oiiiiCI--8!X:liiOC!I!S8K X X X 10 100 1000 10000 log(F)_base: ... |
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 | From the point of view of recognition, independent paths in the derivation structures suggests that a top-down parser (for example) can work on each branch independently, which may lead to efficient parsing using an algorithm based on the Divide and Conquer technique. |
The authors believe automatic paraphrase discovery is an important component for building a fully automatic information extraction system. | 0 | Chunking is not enough to find such relationships. |
This paper talks about Pseudo-Projective Dependency Parsing. | 0 | This is true of the widely used link grammar parser for English (Sleator and Temperley, 1993), which uses a dependency grammar of sorts, the probabilistic dependency parser of Eisner (1996), and more recently proposed deterministic dependency parsers (Yamada and Matsumoto, 2003; Nivre et al., 2004). |
Other kinds of productive word classes, such as company names, abbreviations,and place names can easily be handled given appropriate models. | 0 | Foreign names are usually transliterated using hanzi whose sequential pronunciation mimics the source language pronunciation of the name. |
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. | 1 | 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. |
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 | JA DE G O L D G R AS S SI C K NE SS DE AT H R A T 14. |
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 confidence level is then used as the belief value for the knowledge source. |
They found replacing it with a ranked evaluation to be more suitable. | 0 | The out-of-domain test set differs from the Europarl data in various ways. |
Evaluation was done automatically using the BLEU score and manually on fluency and adequacy. | 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. |
Across eight European languages, their approach results in an average absolute improvement of 10.4% over a state-of-the-art baseline, and 16.7% over vanilla hidden Markov models induced with the Expectation Maximization algorithm. | 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. |
There is no global pruning. | 0 | The sentence length probability p(JjI) is omitted without any loss in performance. |
the "Potsdam Commentary Corpus" or PCC consists of 170 commentaries from Ma¨rkische Allgemeine Zeitung, a German regional daily. | 0 | We will briefly discuss this point in Section 3.1. |
In order to create good-sized vectors for similarity calculation, they had to set a high frequency threshold. | 0 | It is not easy to make a clear definition of âparaphraseâ. |
All the texts were annotated by two people. | 0 | In the small window on the left, search queries can be entered, here one for an NP that has been annotated on the co-reference layer as bridging. |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | We respond to this on the one hand with a format for its underspecification (see 2.4) and on the other hand with an additional level of annotation that attends only to connectives and their scopes (see 2.5), which is intended as an intermediate step on the long road towards a systematic and objective treatment of rheto... |
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 | Next we show that the ATB is similar to other tree- banks in gross statistical terms, but that annotation consistency remains low relative to English (§3). |
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 | This variant is tested in the experiments below. |
This paper offers a broad insight into of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model design. | 0 | Modifying the Berkeley parser for Arabic is straightforward. |
The model incorporates various recent techniques for incorporating and manipulating linguistic knowledge using finite-state transducers. | 0 | For each pair of judges, consider one judge as the standard,. |
The approach assumes that the word reordering is restricted to a few positions in the source sentence. | 0 | The computing time is low, since no reordering is carried out. |
A beam search concept is applied as in speech recognition. | 0 | Here, $ is the sentence boundary symbol, which is thought to be at position 0 in the target sentence. |
It is probably the first analysis of Arabic parsing of this kind. | 0 | For each terminal, the Leaf Ancestor metric extracts the shortest path to the root. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | We thank United Informatics for providing us with our corpus of Chinese text, and BDC for the 'Behavior ChineseEnglish Electronic Dictionary.' |
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 | None of the models we have presented utilize features associated with a particular constituent (i.e. the label, span, parent label, etc.) to influence parser preference. |
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 | 2 Chinese ?l* han4zi4 'Chinese character'; this is the same word as Japanese kanji.. |
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 | (Yarowsky 95) describes an algorithm for word-sense disambiguation that exploits redundancy in contextual features, and gives impressive performance. |
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 | 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. |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | Only IRSTLM does not support threading. |
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 | 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. |
Other kinds of productive word classes, such as company names, abbreviations,and place names can easily be handled given appropriate models. | 0 | Thus in an English sentence such as I'm going to show up at the ACL one would reasonably conjecture that there are eight words separated by seven spaces. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 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. |
This assumption, however, is not inherent to type-based tagging models. | 0 | In total there are O(K 2) parameters associated with the transition parameters. |
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 | Supervised methods have been applied quite successfully to the full MUC named-entity task (Bikel et al. 97). |
Nevertheless, only a part of this corpus (10 texts), which the authors name "core corpus", is annotated with all this information. | 0 | For the English RST-annotated corpus that is made available via LDC, his corresponding result is 62%. |
This paper talks about Unsupervised Models for Named Entity Classification. | 0 | Of these cases, 38 were temporal expressions (either a day of the week or month of the year). |
This paper conducted research in the area of automatic paraphrase discovery. | 0 | Also, the method of using keywords rules out phrases which donât contain popular words in the domain. |
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 | 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 manual evaluation of scoring translation on a graded scale from 1â5 seems to be very hard to perform. | 0 | Training and testing is based on the Europarl corpus. |
Instance-weighting approach improved over a wide range of baselines, giving gains of over 2 BLEU points over the best non-adapted baseline. | 0 | It is difficult when IN and OUT are dissimilar, as they are in the cases we study. |
Replacing this with a ranked evaluation seems to be more suitable. | 0 | The best answer to this is: many research labs have very competitive systems whose performance is hard to tell apart. |
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 | In future work we plan to try this approach with more competitive SMT systems, and to extend instance weighting to other standard SMT components such as the LM, lexical phrase weights, and lexicalized distortion. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | We can use the preceding linguistic and annotation insights to build a manually annotated Arabic grammar in the manner of Klein and Manning (2003). |
From a DP-based solution to the traveling salesman problem, they present a novel technique to restrict the possible word reordering between source and target language in order to achieve an eÃcient search algorithm. | 0 | 1 is given in Fig. |
They proposed an unsupervised method to discover paraphrases from a large untagged corpus. | 0 | The procedure using the tagged sentences to discover paraphrases takes about one hour on a 2GHz Pentium 4 PC with 1GB of memory. |
They found replacing it with a ranked evaluation to be more suitable. | 0 | This revealed interesting clues about the properties of automatic and manual scoring. |
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 | REL+VB) (cf. |
This paper presents a maximum entropy-based named entity recognizer (NER). | 0 | If the token is the first word of a sentence, then this feature is set to 1. |
They proposed a single joint model for performing both morphological segmentation and syntactic disambiguation which bypasses the associated circularity. | 0 | Lexical rules are estimated in a similar manner. |
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 | SEGTok(noH) is the segmentation accuracy ignoring mistakes involving the implicit definite article h.11 To evaluate our performance on the tagging task we report CPOS and FPOS corresponding to coarse- and fine-grained PoS tagging results (F1) measure. |
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 | If the log backoff of wnf is also zero (it may not be in filtered models), then wf should be omitted from the state. |
They proposed a single joint model for performing both morphological segmentation and syntactic disambiguation which bypasses the associated circularity. | 0 | From now on all lattice arcs are tagged segments and the assignment of probability P(p —* (s, p)) to lattice arcs proceeds as usual.4 A rather pathological case is when our lexical heuristics prune away all segmentation possibilities and we remain with an empty lattice. |
Here we show how non-projective dependency parsing can be achieved by combining a data driven projective parser with special graph transformation techniques. | 0 | In order to facilitate this task, we extend the set of arc labels to encode information about lifting operations. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | 27 80. |
However, using the top-level semantic classes of WordNet proved to be problematic as the class distinctions are too coarse. | 0 | During coreference resolution, BABAR checks (1) whether the anaphor is among the lexical expectations for the caseframe that extracts the candidate antecedent, and (2) whether the candidate is among the lexical expectations for the caseframe that extracts the anaphor. |
This assumption, however, is not inherent to type-based tagging models. | 0 | 6 Results and Analysis. |
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 | Graph construction for structured prediction problems such as POS tagging is non-trivial: on the one hand, using individual words as the vertices throws away the context necessary for disambiguation; on the other hand, it is unclear how to define (sequence) similarity if the vertices correspond to entire sentences. |
This topic has been getting more attention, driven by the needs of various NLP applications. | 0 | There has also been work using a bootstrap- ping approach [Brin 98; Agichtein and Gravano 00; Ravichandran and Hovy 02]. |
From a DP-based solution to the traveling salesman problem, they present a novel technique to restrict the possible word reordering between source and target language in order to achieve an eÃcient search algorithm. | 0 | Each distance in the traveling salesman problem now corresponds to the negative logarithm of the product of the translation, alignment and language model probabilities. |
the "Potsdam Commentary Corpus" or PCC consists of 170 commentaries from Ma¨rkische Allgemeine Zeitung, a German regional daily. | 0 | 2.2 Syntactic structure. |
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 | kann 7.nicht 8. |
They plan on extending instance-weighting to other standard SMT components and capture the degree of generality of phrase pairs. | 0 | The final block in table 2 shows models trained on feature subsets and on the SVM feature described in 3.4. |
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 | Thus, the ATM has no more than 6km" + 1 work tapes, where km" is the maximum number of substrings spanned by a derived structure. |
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 | While the paper mentioned a sorted variant, code was never released. |
This corpus has several advantages: it is annotated at different levels. | 0 | For illustration, an English translation of one of the commentaries is given in Figure 1. |
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 | Particular instances of relations are associated with goodness scores. |
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 | IdentiFinder ' 99' s results are considerably better than IdentiFinder ' 97' s. IdentiFinder' s performance in MUC7 is published in (Miller et al., 1998). |
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 | Tokens tagged as PUNC are not discarded unless they consist entirely of punctuation. |
Their results show that their high performance NER use less training data than other systems. | 0 | A dynamic programming algorithm is then used to select the sequence of word classes with the highest probability. |
While many systems had similar performance, the results offered interesting insights, especially, about the relative performance of statistical and rule-based systems. | 0 | More judgements would have enabled us to make better distinctions, but it is not clear what the upper limit is. |
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 | Previous work that involves the gathering of information from the whole document often uses a secondary classifier, which corrects the mistakes of a primary sentence- based classifier. |
The problem of coreference resolution has received considerable attention, including theoretical discourse models and supervised machine learning systems. | 0 | Many researchers have developed coreference resolvers, so we will only discuss the methods that are most closely related to BABAR. |
The authors show that PATB is similar to other tree-banks but that annotation consistency remains low. | 0 | The ATB is disadvantaged by having fewer trees with longer average 5 LDC A-E catalog numbers: LDC2008E61 (ATBp1v4), LDC2008E62 (ATBp2v3), and LDC2008E22 (ATBp3v3.1). |
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 | Table 1 shows results of the benchmark. |
This paper conducted research in the area of automatic paraphrase discovery. | 0 | In this paper, we will propose an unsupervised method to discover paraphrases from a large untagged corpus. |
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 | 01 75. |
They have made use of local and global features to deal with the instances of same token in a document. | 0 | Statistical NERs usually find the sequence of tags that maximizes the probability , where is the sequence of words in a sentence, and is the sequence of named-entity tags assigned to the words in . Attempts have been made to use global information (e.g., the same named entity occurring in different sentences of the sam... |
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 the case of adverbial reduplication illustrated in (3b) an adjective of the form AB is reduplicated as AABB. |
Most IE researchers have been creating paraphrase knowledge by hand and specific tasks. | 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 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 second model (+PRIOR) utilizes the independent prior over type-level tag assignments P (T |Ï). |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | orthographic words are thus only a starting point for further analysis and can only be regarded as a useful hint at the desired division of the sentence into words. |
The PROBING data structure uses linear probing hash tables and is designed for speed. | 0 | The developer explained that the loading process requires extra memory that it then frees. eBased on the ratio to SRI’s speed reported in Guthrie and Hepple (2010) under different conditions. |
They proposed a single joint model for performing both morphological segmentation and syntactic disambiguation which bypasses the associated circularity. | 0 | We conjecture that this trend may continue by incorporating additional information, e.g., three-dimensional models as proposed by Tsarfaty and Sima’an (2007). |
This paper talks about Unsupervised Models for Named Entity Classification. | 0 | The task can be considered to be one component of the MUC (MUC-6, 1995) named entity task (the other task is that of segmentation, i.e., pulling possible people, places and locations from text before sending them to the classifier). |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.