source_text stringlengths 27 368 | label int64 0 1 | target_text stringlengths 1 5.38k |
|---|---|---|
The overall parsing accuracy obtained with the pseudo-projective approach is still lower than for the best projective parsers. | 0 | In the labeled version of these metrics (L) both heads and arc labels must be correct, while the unlabeled version (U) only considers heads. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | 3. |
The code is open source, has minimal dependencies, and offers both C++ and Java interfaces for integration. | 0 | For RandLM, we used the settings in the documentation: 8 bits per value and false positive probability 1 256. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | Note that the good classes JADE, GOLD and GRASS have lower costs than the bad classes SICKNESS, DEATH and RAT, as desired, so the trend observed for the results of this method is in the right direction. |
The manual evaluation of scoring translation on a graded scale from 1â5 seems to be very hard to perform. | 0 | It was our hope that this competition, which included the manual and automatic evaluation of statistical systems and one rulebased commercial system, will give further insight into the relation between automatic and manual evaluation. |
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 | As with lexical expections, the semantic classes of co-referring expressions are 4 They may not be perfectly substitutable, for example one NP may be more specific (e.g., âheâ vs. âJohn F. Kennedyâ). |
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 | The work of the first author was supported by the Lynn and William Frankel Center for Computer Sciences. |
They plan on extending instance-weighting to other standard SMT components and capture the degree of generality of phrase pairs. | 0 | For simplicity, we assume that OUT is homogeneous. |
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 | The normalization on a per-judge basis gave very similar ranking, only slightly less consistent with the ranking from the pairwise comparisons. |
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 practice, we can therefore expect a trade-off such that increasing the amount of information encoded in arc labels will cause an increase in the accuracy of the inverse transformation but a decrease in the accuracy with which the parser can construct the labeled representations. |
They plan on extending instance-weighting to other standard SMT components and capture the degree of generality of phrase pairs. | 0 | Daum´e (2007) applies a related idea in a simpler way, by splitting features into general and domain-specific versions. |
Evaluation was done automatically using the BLEU score and manually on fluency and adequacy. | 0 | This is because different judges focused on different language pairs. |
However, these approaches are ill-equipped to directly represent type-based constraints such as sparsity. | 0 | This departure from the traditional token-based tagging approach allows us to explicitly capture type- level distributional properties of valid POS tag as signments as part of the model. |
The manual evaluation of scoring translation on a graded scale from 1–5 seemed to be very hard to perform. | 0 | The results of the manual and automatic evaluation of the participating system translations is detailed in the figures at the end of this paper. |
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 | 16 As one reviewer points out, one problem with the unigram model chosen here is that there is still a. tendency to pick a segmentation containing fewer words. |
In this paper the authors present a stochastic finite-state model for segmenting Chinese text into words. | 0 | Purely statistical approaches have not been very popular, and so far as we are aware earlier work by Sproat and Shih (1990) is the only published instance of such an approach. |
The authors show that PATB is similar to other tree-banks but that annotation consistency remains low. | 0 | We have described grammar state splits that significantly improve parsing performance, catalogued parsing errors, and quantified the effect of segmentation errors. |
The bias of automatic methods in favour of statistical systems seems to be less pronounced on out-of-domain test data. | 0 | For instance, for out-ofdomain English-French, Systran has the best BLEU and manual scores. |
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 | For example, a good classifier would identify Mrs. Frank as a person, Steptoe & Johnson as a company, and Honduras as a location. |
the "Potsdam Commentary Corpus" or PCC consists of 170 commentaries from Ma¨rkische Allgemeine Zeitung, a German regional daily. | 0 | Since DaneËsâ proposals of âthematic development patternsâ, a few suggestions have been made as to the existence of a level of discourse structure that would predict the information structure of sentences within texts. |
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 | Month Names, Days of the Week, and Numbers: If is initCaps and is one of January, February, . . . |
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 | (2009b) evaluated the Bikel parser using the same ATB split, but only reported dev set results with gold POS tags for sentences of length ⤠40. |
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 | So, this was a surprise element due to practical reasons, not malice. |
Evaluation was done automatically using the BLEU score and manually on fluency and adequacy. | 0 | The average fluency judgement per judge ranged from 2.33 to 3.67, the average adequacy judgement ranged from 2.56 to 4.13. |
The texts were annotated with the RSTtool. | 0 | A corpus of German newspaper commentaries has been assembled at Potsdam University, and annotated with different linguistic information, to different degrees. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | na me =>1 ha nzi fa mi ly 1 ha nzi gi ve n 4. |
These clusters are computed using an SVD variant without relying on transitional structure. | 0 | we perform five runs with different random initialization of sampling state. |
It also incorporates the Good-Turing methodin estimating the likelihoods of previously unseen constructions, including morphological derivatives and personal names. | 0 | We therefore used the arithmetic mean of each interjudge precision-recall pair as a single measure of interjudge similarity. |
This paper talks about KenLM: Faster and Smaller Language Model Queries. | 0 | Another option is the closedsource data structures from Sheffield (Guthrie and Hepple, 2010). |
The authors show that PATB is similar to other tree-banks but that annotation consistency remains low. | 0 | A cell in the bottom row of the parse chart is required for each potential whitespace boundary. |
BABAR's performance in both domains of terrorism and natural disaster, and the contextual-role knowledge in pronouns have shown successful results. | 0 | In contrast, even though context can be helpful for resolving definite NPs, context can be trumped by the semantics of the nouns themselves. |
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 | It is known that CFG's, HG's, and TAG's can be recognized in polynomial time since polynomial time algorithms exist in for each of these formalisms. |
This assumption, however, is not inherent to type-based tagging models. | 0 | For instance, on Spanish, the absolute gap on median performance is 10%. |
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 | Overall, the difference between our most basic model (1TW) and our full model (+FEATS) is 21.2% and 13.1% for the best and median settings respectively. |
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 | Acknowledgments We thank Meni Adler and Michael Elhadad (BGU) for helpful comments and discussion. |
The code is open source, has minimal dependencies, and offers both C++ and Java interfaces for integration. | 0 | We have described two data structures for language modeling that achieve substantial reductions in time and memory cost. |
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 | If it starts with a lower case letter, and contains both upper and lower case letters, then (mixedCaps, zone) is set to 1. |
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 | While the first three models get three to four tags wrong, our best model gets only one word wrong and is the most accurate among the four models for this example. |
The authors show that PATB is similar to other tree-banks but that annotation consistency remains low. | 0 | The difference is due to more careful S-NOM NP NP NP VP VBG :: b NP restoring NP ADJP NN :: b NP NN NP NP ADJP DTJJ ADJP DTJJ NN :: b NP NP NP ADJP ADJP DTJJ J ..i NN :: b NP NP NP ADJP ADJP DTJJ NN _;� NP PRP DTJJ DTJJ J ..i _;� PRP J ..i NN _;� NP PRP DTJJ NN _;� NP PRP DTJJ J ..i role its constructive effect... |
They proposed an unsupervised method to discover paraphrases from a large untagged corpus. | 0 | The similar explanation applies to the link to the âstakeâ set. |
It is probably the first analysis of Arabic parsing of this kind. | 0 | 92 77. |
There is no global pruning. | 0 | The proof is given in (Tillmann, 2000). |
They focused on phrases which two Named Entities, and proceed in two stages. | 0 | Find keywords for each NE pair The keywords are found for each NE category pair. |
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 | A simple lexicalized PCFG with second order Markovization gives relatively poor performance: 75.95% F1 on the test set.8 But this figure is surprisingly competitive with a recent state-of-the-art baseline (Table 7). |
This paper presents methods to query N-gram language models, minimizing time and space costs. | 0 | Entries landing in the same bucket are said to collide. |
This paper offers a broad insight into of Arabic constituency parsing by analyzing the interplay of linguistic phenomena, annotation choices, and model design. | 0 | For each 13 Of course, this weighting makes the PCFG an improper distribution. |
The authors in this paper describe a search procedure for statistical machine translation (MT) based on dynamic programming (DP). | 0 | Figure 2: Order in which source positions are visited for the example given in Fig.1. |
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 | Base NPs are the other significant category of nominal phrases. |
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 | This group consists of (3 total number of possible zones) features. |
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 | Table 3: Dev set frequencies for the two most significant discourse markers in Arabic are skewed toward analysis as a conjunction. |
In order to create good-sized vectors for similarity calculation, they had to set a high frequency threshold. | 0 | In total, for the 2,000 NE category pairs, 5,184 keywords are found. |
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 | Only one of the first n positions which are not already aligned in a partial hypothesis may be chosen, where n is set to 4. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | Several systems propose statistical methods for handling unknown words (Chang et al. 1992; Lin, Chiang, and Su 1993; Peng and Chang 1993). |
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 | This is an issue that we have not addressed at the current stage of our research. |
This paper talks about Pseudo-Projective Dependency Parsing. | 0 | Unlike Kahane et al. (1998), we do not regard a projectivized representation as the final target of the parsing process. |
Their method did not assume any knowledge about the target language, making it applicable to a wide array of resource-poor languages. | 0 | The parallel data came from the Europarl corpus (Koehn, 2005) and the ODS United Nations dataset (UN, 2006). |
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 | The compressed variant uses block compression and is rather slow as a result. |
This paper talks about Exploiting Diversity in Natural Language Processing: Combining Parsers. | 0 | We call such a constituent an isolated constituent. |
The texts were annotated with the RSTtool. | 0 | âested in correlations between prosody and dis course structure. |
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 | 2 70.7 52. |
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 ATB gives several different analyses to these words to indicate different types of coordination. |
The bias of automatic methods in favour of statistical systems seems to be less pronounced on out-of-domain test data. | 0 | The normalization on a per-judge basis gave very similar ranking, only slightly less consistent with the ranking from the pairwise comparisons. |
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 | LCFRS's have only been loosely defined in this paper; we have yet to provide a complete set of formal properties associated with members of this class. |
The first method builds on results from (Yarowsky 95) and (Blum and Mitchell 98). | 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 | The paper is structured as follows. |
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 | Context from the whole document can be important in classifying a named entity. |
The three parsers were trained and tuned by their creators on various sections of the WSJ portion of the Penn Treebank. | 0 | In general, the lemma of the previous section does not ensure that all the productions in the combined parse are found in the grammars of the member parsers. |
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 | Words and punctuation that appear in brackets are considered optional. |
They found replacing it with a ranked evaluation to be more suitable. | 0 | Systran submitted their commercial rule-based system that was not tuned to the Europarl corpus. |
They incorporated instance-weighting into a mixture-model framework, and found that it yielded consistent improvements over a wide range of baselines. | 0 | The features are weighted within a logistic model to give an overall weight that is applied to the phrase pair’s frequency prior to making MAP-smoothed relative-frequency estimates (different weights are learned for each conditioning direction). |
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 | To approximate these baselines, we implemented a very simple sentence selection algorithm in which parallel sentence pairs from OUT are ranked by the perplexity of their target half according to the IN language model. |
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 | This fully generative model caters for real interaction between the syntactic and morphological levels as a part of a single coherent process. |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | phrase (markContainsVerb). |
It is well-known that English constituency parsing models do not generalize to other languages and treebanks. | 0 | Variants of alif are inconsistently used in Arabic texts. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 0 | 2. |
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 | The major problem for all segmentation systems remains the coverage afforded by the dictionary and the lexical rules used to augment the dictionary to deal with unseen words. |
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 | Table 1 The cost as a novel given name (second position) for hanzi from various radical classes. |
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 | For instance, the common "suffixes," -nia (e.g.,. |
The PROBING data structure uses linear probing hash tables and is designed for speed. | 0 | Given counts cn1 where e.g. c1 is the vocabulary size, total memory consumption, in bits, is Our PROBING data structure places all n-grams of the same order into a single giant hash table. |
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. |
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 | These alignment models are similar to the concept of hidden Markov models (HMM) in speech recognition. |
The texts were annotated with the RSTtool. | 0 | rhetorical analysis We are experimenting with a hybrid statistical and knowledge-based system for discourse parsing and summarization (Stede 2003), (Hanneforth et al. 2003), again targeting the genre of commentaries. |
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 | Further, it needs extra pointers in the trie, increasing model size by 40%. |
The authors use linguistic and annotation insights to develop a manually annotated grammar and evaluate it and finally provide a realistic evaluation in which segmentation is performed in a pipeline jointly with parsing. | 0 | Even with vocalization, there are linguistic categories that are difficult to identify without semantic clues. |
They showed the efficacy of graph-based label propagation for projecting part-of-speech information across languages. | 0 | Label propagation is used to propagate these tags inwards and results in tag distributions for the middle word of each Italian trigram. |
they evaluate various specific aspects of the segmentation, as well as the overall segmentation performance. | 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... |
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 | The combining technique must act as a multi-position switch indicating which parser should be trusted for the particular sentence. |
The use of global features has shown excellent result in the performance on MUC-6 and MUC-7 test data. | 0 | If the token is the first word of a sentence, then this feature is set to 1. |
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 | The cost is computed as follows, where N is the corpus size and f is the frequency: (1) Besides actual words from the base dictionary, the lexicon contains all hanzi in the Big 5 Chinese code/ with their pronunciation(s), plus entries for other characters that can be found in Chinese text, such as Roman letters, numera... |
The authors cluster NE instance pairs based on the words in the context using bag-of-words methods. | 0 | Step 3. |
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 | irL as the product of the probability estimate for i¥JJ1l., and the probability estimate just derived for unseen plurals in ir,: p(i¥1J1l.ir,) p(i¥1J1l.)p(unseen(f,)). |
Human judges also pointed out difficulties with the evaluation of long sentences. | 0 | Making the ten judgements (2 types for 5 systems) takes on average 2 minutes. |
The authors in this paper describe a search procedure for statistical machine translation (MT) based on dynamic programming (DP). | 0 | Using these states, we define partial hypothesis extensions, which are of the following type: (S0;C n fjg; j0) ! |
The AdaBoost algorithm was developed for supervised learning. | 0 | 2. |
the "Potsdam Commentary Corpus" or PCC consists of 170 commentaries from Ma¨rkische Allgemeine Zeitung, a German regional daily. | 0 | Not all the layers have been produced for all the texts yet. |
Using less training data than other systems, their NER can perform as well as other state-of-the-art NERs. | 0 | (3)In sentence (1), McCann can be a person or an orga nization. |
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 | The result of this is shown in Figure 7. |
Their work is closely related to recent approaches that incorporate the sparsity constraint into the POS induction process. | 0 | Previous work has attempted to incorporate such constraints into token-level models via heavy-handed modifications to inference procedure and objective function (e.g., posterior regularization and ILP decoding) (Grac¸a et al., 2009; Ravi and Knight, 2009). |
The code is open source, has minimal dependencies, and offers both C++ and Java interfaces for integration. | 0 | The PROBING model is 2.4 times as fast as the fastest alternative, SRILM, and uses less memory too. |
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 | Recall. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.