Papers reviewed and determined not to be word norm studies. Use the flag icon to report errors or suggest re-inclusion.
18625 papers
This chapter investigates problems that novice writers, especially learners of English, have in acquiring lexical features of written discourse. It describes features of an interactive writing kit (WordPilot) which assists them to access authentic text, then to transfer patterns they explore there to their own writing. Relevant text corpora and specific lexical databases are made available during the writing process through the mediation of this integrated electronic reference, which incorporates several applications, including a concordancer, dictionary and thesaurus. This learning and production device has been implemented for Cantonese-speaking students in Hong Kong for whom English is a Foreign Language, but the general principles have relevance to writers at any point on the continuum of language proficiency. The chapter also illustrates problems in the presentation of lexical patterns to novice writers of limited English proficiency. As a gateway to text, it provides novice writers opportunities to explore language features, and it assists academic gate keepers in initiating learners into discourse.
In this paper, we report the obtained results of two constituency parsers trained with BulTreeBank, an HPSG-based treebank for Bulgarian. To reduce the data sparsity problem, we propose using the Brown word clustering to do an off-line clustering and map the words in the treebank to create a class-based treebank. e observations show that when the classes outnumber the POS tags, the results are beer. Since this approach adds on another dimension of abstraction (in comparison to the lemma), its coarse-grained representation can be used further for training statistical parsers.
A phrase dependency treebank(PDT)integrating phrase structure grammar and dependency grammar is proposed and elaborated to cater for translation studies.The construction of DUT Parallel Chinese-English PDT(DUT-CEPDT)is reported.PDT favors flat structures and the dependency is based on semantics rather than syntactic functions,which differs from the mainstream dependency analysis that favors binary branching.The raw texts of DUT-CEPDT are Chinese government work reports and White Papers and their official English translation.First of all,after word segmentation and part of speech(POS)tagging,Chinese PDT and English PDT are constructed manually with the aid of LingTreeConstructor,a tool tailored for linguists.Then,node alignment, which covers translation alignments of words,phrases,clauses up to the whole passage,is proposed instead of traditional word or sentence alignment to provide more translation knowledge.Lastly, semantic roles based on the FrameNet are labeled simultaneously on the aligned nodes of the English and Chinese trees.DUT-CEPDT can serve as a resource and standard of the training and assessment of both human translators and machine translation systems.
We present novel computational experiments using William Labov’s theory of narrative analysis. We describe his six elements of narrative structure and construct a new corpus based on his most recent work on narrative. Using this corpus, we explore the correspondence between Labovs elements of narrative structure and the implicit discourse relations of the Penn Discourse Treebank, and we construct a mapping between the elements of narrative structure and the discourse relation classes of the PDTB. We present first experiments on detecting Complicating Actions, the most common of the elements of narrative structure, achieving an f-score of 71.55. We compare the contributions of features derived from narrative analysis, such as the length of clauses and the tenses of main verbs, with those of features drawn from work on detecting implicit discourse relations. Finally, we suggest directions for future research on narrative structure, such as applications in assessing text quality and in narrative generation.
This paper mainly introduced the research on constructing Mongolian Treebank based on phrase structure grammar. Having Considered related Mongolian Treebank work and Mongolian words characteristics, we developed a Mongolian syntactic tagset. The tagset includes two kinds of tags. One is syntactic constituent tag and the other is grammatical relation tag. On the basis of the tagset, we developed the Mongolian Treebank auxiliary processing system. Finally, we built a Treebank that contains 3645 sentences and did an experiment on this Treebank.
See http://clld.org
The feminist movement purports to improve conditions for women, and yet only a minority of women in modern societies self-identify as feminists. This is known as the feminist paradox. It has been suggested that feminists exhibit both physiological and psychological characteristics associated with heightened masculinization, which may predispose women for heightened competitiveness, sex-atypical behaviors, and belief in the interchangeability of sex roles. If feminist activists, i.e., those that manufacture the public image of feminism, are indeed masculinized relative to women in general, this might explain why the views and preferences of these two groups are at variance with each other. We measured the 2D:4D digit ratios (collected from both hands) and a personality trait known as dominance (measured with the Directiveness scale) in a sample of women attending a feminist conference. The sample exhibited significantly more masculine 2D:4D and higher dominance ratings than comparison samples representative of women in general, and these variables were furthermore positively correlated for both hands. The feminist paradox might thus to some extent be explained by biological differences between women in general and the activist women who formulate the feminist agenda.
BACKGROUND: The standard clinical acquisition for left ventricular functional parameter analysis with cardiovascular magnetic resonance (CMR) uses a multi-breathhold multi-slice segmented balanced SSFP sequence. Performing multiple long breathholds in quick succession for ventricular coverage in the short-axis orientation can lead to fatigue and is challenging in patients with severe cardiac or respiratory disorders. This study combines the encoding efficiency of a six-fold undersampled 3D stack of spirals balanced SSFP sequence with 3D through-time spiral GRAPPA parallel imaging reconstruction. This 3D spiral method requires only one breathhold to collect the dynamic data. METHODS: Ten healthy volunteers were recruited for imaging at 3 T. The 3D spiral technique was compared against 2D imaging in terms of systolic left ventricular functional parameter values (Bland-Altman plots), total scan time (Welch's t-test) and qualitative image rating scores (Wilcoxon signed-rank test). RESULTS: Systolic left ventricular functional values were not significantly different (i.e. 3D-2D) between the methods. The 95% confidence interval for ejection fraction was -0.1 ± 1.6% (mean ± 1.96*SD). The total scan time for the 3D spiral technique was 48 s, which included one breathhold with an average duration of 14 s for the dynamic scan, plus 34 s to collect the calibration data under free-breathing conditions. The 2D method required an average of 5 min 40s for the same coverage of the left ventricle. The difference between 3D and 2D image rating scores was significantly different from zero (Wilcoxon signed-rank test, p < 0.05); however, the scores were at least 3 (i.e. average) or higher for 3D spiral imaging. CONCLUSION: The 3D through-time spiral GRAPPA method demonstrated equivalent systolic left ventricular functional parameter values, required significantly less total scan time and yielded acceptable image quality with respect to the 2D segmented multi-breathhold standard in this study. Moreover, the 3D spiral technique used just one breathhold for dynamic imaging, which is anticipated to reduce patient fatigue as part of the complete cardiac examination in future studies that include patients.
Discourse relations bind smaller linguistic units into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked arguments. A more subtle challenge is that it is not enough to represent the meaning of each argument of a discourse relation, because the relation may depend on links between lower-level components, such as entity mentions. Our solution computes distributional meaning representations by composition up the syntactic parse tree. A key difference from previous work on compositional distributional semantics is that we also compute representations for entity mentions, using a novel downward compositional pass. Discourse relations are predicted from the distributional representations of the arguments, and also of their coreferent entity mentions. The resulting system obtains substantial improvements over the previous state-of-the-art in predicting implicit discourse relations in the Penn Discourse Treebank.
This work improves a novel Service Selection Method for the development of Service-Oriented Applications in the context of the Service-Oriented Computing (SOC) paradigm. We have defined a Semantic-Structural Scheme to assess Web Services on Interface Compatibility exploring the available information from WSDL documents. The structural information involves data types from return, parameters and exceptions. The semantic information concerns identifiers from parameters and operation names. The lexical database WordNet is used as a semantic basis. Two appraisal values were defined: compatibility gap and adaptability gap. The former is centered on functional aspects. The latter explains the adaptation effort to a successful integration. We validated those appraisals values through different experiments with a data-set of 465 real-life Web Services and measured the results using three metrics from the Information Retrieval field.
We present an algorithm and implementation for extracting recurring fragments from treebanks. Using a tree-kernel method the largest common fragments are extracted from each pair of trees. The algorithm presented achieves a thirty-fold speedup over the previously available method on the Wall Street Journal dataset. It is also more general, in that it supports trees with discontinuous constituents. The resulting fragments can be used as a tree-substitution grammar or in classification problems such as authorship attribution and other stylometry tasks.
This paper gives an overview of the latest developments in computational syntactic analysis of Estonian. We present Estonian Dependency Treebank, an ongoing corpus annotation project. Although the treebank construction is still under way, we have used it for training MaltParser and experimenting with combining MaltParser with a rule-based Constraint Grammar parser for Estonian. MaltParser achieves unlabeled attachment score (UAS; correct links to head node) of 83.4% and label accuracy (LA) of 88.6%. Labeled attachment score (LAS) was 80.3%.
Abstract Statistical parsers often require careful parameter tuning and feature selection. This is a nontrivial task for application developers who are not interested in parsing for its own sake, and it can be time-consuming even for experienced researchers. In this paper we present MaltOptimizer, a tool developed to automatically explore parameters and features for MaltParser, a transition-based dependency parsing system that can be used to train parser's given treebank data. MaltParser provides a wide range of parameters for optimization, including nine different parsing algorithms, an expressive feature specification language that can be used to define arbitrarily rich feature models, and two machine learning libraries, each with their own parameters. MaltOptimizer is an interactive system that performs parser optimization in three stages. First, it performs an analysis of the training set in order to select a suitable starting point for optimization. Second, it selects the best parsing algorithm and tunes the parameters of this algorithm. Finally, it performs feature selection and tunes machine learning parameters. Experiments on a wide range of data sets show that MaltOptimizer quickly produces models that consistently outperform default settings and often approach the accuracy achieved through careful manual optimization.
This paper presents the ITU Turkish Dependency Validation Set firstly introduced in 2007 [36] in order to serve as the test set of the CoNLL-XI shared task (shared task of the Conference on Computational Natural Language Learning 2007 [28] ). The dataset is available from http://web.itu.edu.tr/gulsenc/treebanks.html and is used by several academic studies so far.
We present a novel algorithm for inducing Combinatory Categorial Grammars from dependency treebanks, along with initial experiments showing that it can be used to achieve competitive realization results using an enhanced version of the surface realization shared task data. 1
In this paper, the development and evaluation of the Urdu parser is presented along with the comparison of existing resources for the language variants Urdu/Hindi. This parser was given a linguistically rich grammar extracted from a treebank. This context free grammar with sufficient encoded information is comparable with the state of the art parsing requirements for morphologically rich and closely related language variants Urdu/Hindi. The extended parsing model and the linguistically rich grammar together provide us promising parsing results for both the language variants. The parser gives 87% of f-score, which outperforms the multi-path shift-reduce parser for Urdu and a simple Hindi dependency parser with 4.8% and 22% increase in recall, respectively.
Abstract We investigated discrimination in the context of evaluating advertisements, based on the suppression model (justification‐suppression model [ JSM ]) of prejudice expression. Previous research has demonstrated that when people are given an opportunity to give a high rating to an ad featuring a Black model, a sense of nonprejudice is created, which, in turn, provides an opportunity to discriminate subsequently without feeling prejudiced. We extended the JSM by investigating whether the acquisition of legitimacy credits (a moral authority earned by demonstrating nonprejudice) is a sufficient condition to release the expression of prejudice. We found that subjects who first evaluated a high‐quality ad featuring a Black model felt eligible to use legitimacy credits in subsequent evaluations. But in a subsequent study, participants who acquired these credits evaluated Black model ads more negatively than White model ads only when these ads were of low quality. The implications for evaluating the subtle way that prejudice affects rating of models of color in advertisements are discussed.
In this paper, we analyze the impact of various dependency representations for various constructions on the general parsing accuracy and on the parsing accuracy of these constructions. We focus on the analysis of coordination constructions, complex predicates, and punctuation mark attachment. We use Latvian Treebank as a dataset, thus, providing insight for an inflective language with a rather free word order. Experiments with MaltParser, a transition-based parser, show clear difference in learnability of various representations for the considered constructions. Future work would include carrying out comparable experiments with a graph-based dependency parser like MSTParser.
According to Tsinghua Chinese Treebank annotation methods, the authors extracted relation words and marked their categories. Then syntax, lexical and position features of automatic syntax tree with and without functional marker were extracted to recognize and classify relation words. Experiment results show that relative recognition accuracy is 95.7%, and relation words classification F1 is 77.2%.
We describe a new dependency parser for English tweets, TWEEBOPARSER. The parser builds on several contributions: new syntactic annotations for a corpus of tweets (TWEEBANK), with conventions informed by the domain; adaptations to a statistical parsing algorithm; and a new approach to exploiting out-of-domain Penn Treebank data. Our experiments show that the parser achieves over 80% unlabeled attachment accuracy on our new, high-quality test set and measure the benefit of our contributions. Our dataset and parser can be found at http://www.ark.cs.cmu.edu/TweetNLP.
Recent work on Chinese analysis has led to large-scale annotations of the internal structures of words, enabling characterlevel analysis of Chinese syntactic structures. In this paper, we investigate the problem of character-level Chinese dependency parsing, building dependency trees over characters. Character-level information can benefit downstream applications by offering flexible granularities for word segmentation while improving wordlevel dependency parsing accuracies. We present novel adaptations of two major shift-reduce dependency parsing algorithms to character-level parsing. Experimental results on the Chinese Treebank demonstrate improved performances over word-based parsing methods.
In this paper, we describe the process of rulebased conversion of Russian dependency treebank into the Stanford dependency (SD) schema. The motivation behind this project is the expansion of the number of languages that have treebank resources available in one consistent annotation schema. Conversion includes creation of Russian-specific SD guidelines, defining conversion rules from the original treebank schema into the SD model and evaluation of the conversion results. The converted treebank becomes part of a multilingual resource for NLP purposes.
This paper presents a set of Bilingual Dictionary Drafting (BDD) methods including manual extraction from existing lexical databases and corpus based NLP tools, as well as their evaluation on the example of German-Basque as language pair. Our aim is twofold: to give support to a German-Basque bilingual dictionary project by providing draft Bilingual Glossaries and to provide lexicographers with insight into how useful BDD methods are. Results show that the analysed methods can greatly assist on bilingual dictionary writing, in the context of medium-density language pairs.
Recurrent neural network language models have solved the problems of data sparseness and dimensionality disaster which exist in traditional N-gram models. RNNLMs have recently demonstrated state-of-the-art performance in speech recognition, machine translation and other tasks. In this paper, we improve the model performance by providing contextual word vectors in association with RNNLMs. This method can reinforce the ability of learning long-distance information using vectors training from Skip-gram model. The experimental results show that the proposed method can improve the perplexity performance significantly on Penn Treebank data. And we further apply the models to speech recognition task on the Wall Street Journal corpora, where we achieve obvious improvements in word-error-rate.
Our first impression of others is highly influenced by their facial appearance. However, the perception and evaluation of faces is not only guided by internal features such as facial expressions, but also highly dependent on contextual information such as secondhand information (verbal descriptions) about the target person. To investigate the time course of contextual influences on cortical face processing, event-related brain potentials were investigated in response to neutral faces, which were preceded by brief verbal descriptions containing cues of affective valence (negative, neutral, positive) and self-reference (self-related vs. other-related). ERP analysis demonstrated that early and late stages of face processing are enhanced by negative and positive as well as self-relevant descriptions, although faces per se did not differ perceptually. Affective ratings of the faces confirmed these findings. Altogether, these results demonstrate for the first time both on an electrocortical and behavioral level how contextual information modifies early visual perception in a top-down manner.
We present the Uppsala Persian Dependency Treebank (UPDT) with a syntactic annotation scheme based on Stanford Typed Dependencies. The treebank consists of 6,000 sentences and 151,671 tokens with an average sentence length of 25 words. The data is from different genres, including newspaper articles and fiction, as well as technical descriptions and texts about culture and art, taken from the open source Uppsala Persian Corpus (UPC). The syntactic annotation scheme is extended for Persian to include all syntactic relations that could not be covered by the primary scheme developed for English. In addition, we present open source tools for automatic analysis of Persian containing a text normalizer, a sentence segmenter and tokenizer, a part-of-speech tagger, and a parser. The treebank and the parser have been developed simultaneously in a bootstrapping procedure. The result of a parsing experiment shows an overall labeled attachment score of 82.05% and an unlabeled attachment score of 85.29%. The treebank is freely available as an open source resource.
Comunicació presentada al 9th International Conference on Language Resources and Evaluation (LREC'14), celebrat del 26 al 31 de maig de 2014 a Reykjavík, Islàndia.
This paper presents results of dependency parsing of Old French, a language which is poorly standardized at the lexical level, and which displays a relatively free word order. The work is carried out on five distinct sample texts extracted from the dependency treebank Syntactic Reference Corpus of Medieval French (SRCMF). Following Achim Stein's previous work, we have trained the Mate parser on each sub-corpus and cross-validated the results. We show that the parsing efficiency is diminished by the greater lexical variation of Old French compared to parse results on modern French. In order to improve the result of the POS tagging step in the parsing process, we applied a pre-treatment to the data, comparing two distinct strategies: one using a slightly post-treated version of the TreeTagger trained on Old French by Stein, and a CRF trained on the texts, enriched with external resources. The CRF version outperforms every other approach.
En este artículo se describe el proceso que se siguió para crear el componente anotado con información lingüística (treebank) del Corpus de Mensajes Presidenciales Costarricenses (CODIMEP-CR), en el marco del proyecto No. 745-B1-244 Interfaz para el procesamiento de corpus lingüísticos digitales-IPROCOLDI. Ambos corpus se albergan en la interfaz IPROCOLDI (http://163.178.116.145/iprocoldi/).
For reinforcing city sports park informatization management level and the society service quality of sports park, this paper researches combined multi-agent technology, and structures multimedia active service system framework of city sports park. It has elaborated functions of every feature and workflow of the system, and put forward Agent design procedure based on JADE. Whats more, it also adopts FIPAACl linguistic norms between Agents communication and puts forward some realized advice which makes the information based on the fundamental of Agent.
We present HamleDT 2.0 (HArmonized Multi-LanguagE Dependency Treebank). HamleDT 2.0 is a collection of 30 existing treebanks harmonized into a common annotation style, the Prague Dependencies, and further transformed into Stanford Dependencies, a treebank annotation style that became popular recently.\n\nWe use the newest basic Universal Stanford Dependencies, without added language-specific subtypes. We describe both of the annotation styles, including adjustments that were necessary to make, and provide details about the conversion process. We also discuss the differences between the two styles, evaluating their advantages and disadvantages, and note the effects of the differences on the conversion.\n\nWe regard the stanfordization as generally successful, although we admit several shortcomings, especially in the distinction between direct and indirect objects, that have to be addressed in future.\n\nWe release part of HamleDT 2.0 freely; we are not allowed to redistribute the whole dataset, but we do provide the conversion pipeline.
-The purpose of this paper is to investigate asymmetries found between /w/ and /j/ in British English and explain some of the outstanding asymmetries. For this purpose I extracted words including /w/ and /j/ from the CELEX Lexical Database and analyzed them focusing on the distribution of /w/ and /j/. The asymmetries newly found or already known are as follows: /w/ strongly restricts the preceding consonants while /Cj/ restricts the following vowels. I argue that the restriction of consonants by /w/ is due to the fact that the /w/ uses two articulators (the lips and the back of the tongue), causing many violations of OCP and *Gesture. I also argue that the restriction of vowels on /u:/ by /Cj/ is due to the fact that most of /j/s originate from French or Latin loanwords, where the pronunciation of is /ju:/.
One way of teaching grammar, namely morphology and syntax, is to visualize sentences as diagrams capturing relationships between words. Similarly, such relationships are captured in a more complex way in treebanks serving as key building stones in modern natural language processing. However, building them is very time consuming, thus we have been seeking for an alternative cheaper and faster way, like crowdsourcing. The purpose of our work is to explore possibility to get sentence diagrams produced by students and teachers. In our pilot study, the object language is Czech, where sentence diagrams are part of elementary school curriculum.
Automatic text categorisation systems is a type of software that every day it is receiving more interest, due not only to its use in documentaries environments but also to its possible application to tag properly documents on the Web. Many options have been proposed to face this subject using statistical approaches, natural language processing tools, ontologies and lexical databases. Nevertheless, there have been no too many empirical evaluations comparing the influence of the different tools used to solve these problems, particularly in a multilingual environment. In this paper we propose a multi-language rule-based pipeline system for automatic document categorisation and we compare empirically the results of applying techniques that rely on statistics and supervised learning with the results of applying the same techniques but with the support of smarter tools based on language semantics and ontologies, using for this purpose several corpora of documents. GENIE is being applied to real environments, which shows the potential of the proposal.
We investigate whether parsers can be used for self-monitoring in surface realization in order to avoid egregious errors involving "vicious" ambiguities, namely those where the intended interpretation fails to be considerably more likely than alternative ones. Using parse accuracy in a simple reranking strategy for selfmonitoring, we find that with a stateof-the-art averaged perceptron realization ranking model, BLEU scores cannot be improved with any of the well-known Treebank parsers we tested, since these parsers too often make errors that human readers would be unlikely to make. However, by using an SVM ranker to combine the realizer's model score together with features from multiple parsers, including ones designed to make the ranker more robust to parsing mistakes, we show that significant increases in BLEU scores can be achieved. Moreover, via a targeted manual analysis, we demonstrate that the SVM reranker frequently manages to avoid vicious ambiguities, while its ranking errors tend to affect fluency much more often than adequacy.