Papers reviewed and determined not to be word norm studies. Use the flag icon to report errors or suggest re-inclusion.
18625 papers
There is growing interest in the use of semantic collections in order to identify and analyse domain knowledge. This paper describes some technical issues to consider when contemplating research which incorporates small-to-medium domain-specific word sets. The purpose of the corpus construction described was to provide an external word collection which could be transformed to a numeric frequency scale which could take the place of an “expert ” in order to evaluate the lexical content of aircraft Visual Landing Approach concept maps. Although this paper is based on research in the field of aviation education, the underlying principles are more widely applicable. General Corpora Definitions and Uses The study of naturally occurring word frequencies has been a focus of computational linguistics, and in particular of the field of corpus linguistics. A word collection known as a corpus is constructed from some set of texts in order to determine what is characteristic of that text set through the identification of vocabulary patterns that either differ or conform to a norm (Ide & Walker, 1993). In contrast to Chomskyan generative linguistics, which focuses on internal knowledge of language structures (Chomsky, 1957), empirical corpus linguistics seeks to describe
The identification of dysfunctional thoughts is a central effort in cognitive therapy. This paper describes the first version of a computer module that classifies dysfunctional thoughts automatically. It is part of COGNO, a system we are developing to give automatic feedback on dysfunctional thoughts. The system uses rules that were developed from language markers identified in a sample of 149 dysfunctional thoughts. The system was tested with an independent set of 112 example thoughts. The system detects the majority of dysfunctional thoughts, but works reliably only for some thought categories. Automatic thought classification may be a first step toward developing natural dialogue systems in cognitive therapy.
The Multilingual Dictionary of Lexicographical Terms (MDLT) is a prototype of a linguistic database. The main goal of this project is to provide all users, especially student-linguists, with a tool for increasing lexicographical competence. We based our project on an investigation of users’ needs and demands. Through our rich entry structure (including translation equivalents, set phrases, synonyms, antonyms, etc.) the system combines large volume with quality of information and convenient query. Our initial motivation was a lack of dictionaries that serve to underline differences between Russian and English terms in the subject field of lexicography. Therefore, our dictionary contains entries in two languages – Russian and English. However, our system can also support other European languages such as German, French, Italian, Danish, etc.
Large-scale Knowledge Representation Resources for Cognitive Science Research Martha S. Palmer Department of Computer and Information Science, University of Pennsylvania 3330 Walnut Street, Philadelphia, PA 19104-6389 USA George A. Miller Department of Psychology, Princeton University 1-S-5 Green Hall, Princeton, NJ 08544 USA Charles J. Fillmore International Computer Science Institute, University of California at Berkeley 1947 Center St., Suite 600, Berkeley, CA 94704-1198 USA Doug Lenat Cycorp, Inc. Suite 100, 3721 Executive Center Drive, Austin, TX 78731 USA Pat Hayes Institute for Human and Machine Cognition 40 South Alcaniz Street, Pensacola, FL 32502 Treebank syntactic structures: The Proposition Bank, or PropBank. PropBank consists of argument labels for the semantic roles of individual verbs and similar predicating expressions such as participial modifiers and nominalizations. This talk will describe the PropBank verb semantic role annotation being done at Penn for both English and Chinese. The annotation process will be discussed as well as the use of existing lexical resources such as WordNet, Levin classes and VerbNet. Comparisons with similar projects, including the FrameNet Project at Berkeley and the Prague Tectogrammatics project, will be made. Motivation One of the unique features of cognitive science has been its emphasis on understanding how people represent and use knowledge. Unfortunately, knowledge representation can be quite difficult if one is starting from scratch. Having “off the shelf” representation systems that can be used for investigations can make new types of cognitive modeling efforts possible, at a scale that would otherwise be impossible. The participants in this symposium each represent a different approach to building such representational resources. George A. Miller: WordNet is a lexical database that contains 146,900 English nouns, verbs, adjectives, and adverbs that are now organized by semantic relations into 117,500 meanings, where a meaning is represented by a set of synonyms (a synset) that can be used to express that meaning. An entry in WordNet consists of a synset, a definitional gloss, and (sometimes) one or more sentences illustrating usage. The semantic relations used to organize words and entries are synonymy and antonymy, hyponymy, troponymy and hypernymy, meronymy and holonymy. A currently active project, the disambiguation of definitional glosses, will be discussed. Doug Lenat: Cognitive Science research could benefit from large-scale representational building blocks. One such building block is a broad ontology of, well, everything. Another one, resting on that, is a formal axiomatization of most of the meaning of most of those concepts; i.e., millions of axioms about those hundreds of thousands of terms. These two pieces have been worked on for twenty years -- and the better part of a person-century of effort -- as Cyc. It's been highly proprietary so far, with a small tip of its ontology exposed as OpenCyc. Starting this summer, though, Cyc is being made available in its entirety for R&D purposes for free, courtesy of Ron Brachman at DARPA's IPTO. In this presentation I will briefly describe this ResearchCyc ontology and KB, and some initial utilities provided with it (inference engine, English-Cyc lexicon, interfaces), how this might fit in with the other infrastructure elements being described in this panel, and how these might leverage your work. Charles J. Fillmore: The FrameNet project is morphing from a lexicon-building project to a system capable of providing a layer or two of semantic annotation for full sentences. My remarks will summarize the kinds of information the FrameNet database can provide now, and what it should be able to offer in the not too distant future, for researchers in language engineering and cognitive science. FrameNet is moving toward greater coverage of the lexicon, adaptation to specialist vocabularies, more systematic treatment of multiword expressions, and provisions for incorporating a wide variety of (non-core) grammatical constructions. Pat Hayes Pat Hayes, the discussant for this symposium, has the unique distinction of having inventing two of the most widely-used representations for change, the situation calculus (with John McCarthy) and histories. He is a Fellow of the American Association for Artificial Intelligence and the Cognitive Science Society. Martha S. Palmer: Recently, a consensus has been achieved as to a task-oriented level of semantic representation to be layered on top of the existing Penn
This paper presents the construction of a manually annotated Chinese shallow Treebank, named PolyU Treebank. Different from traditional Chinese Treebank based on full parsing, the PolyU Treebank is based on shallow parsing in which only partial syntactical structures are annotated. This Treebank can be used to support shallow parser training, testing and other natural language applications. Phrase-based Grammar, proposed by Peking University, is used to guide the design and implementation of the PolyU Treebank. The design principles include good resource sharing, low structural complexity, sufficient syntactic information and large data scale. The design issues, including corpus material preparation, standard for word segmentation and POS tagging, and the guideline for phrase bracketing and annotation, are presented in this paper. Well-designed workflow and effective semiautomatic and automatic annotation checking are used to ensure annotation accuracy and consistency. Currently, the PolyU Treebank has completed the annotation of a 1-million-word corpus. The evaluation shows that the accuracy of annotation is higher than 98%. 1
When complete, NomBank will provide annotation of noun arguments in Penn Treebank II (PTB). In PropBank, University of Pennsylvania annotators provide similar information for verbs. Given nominalization/verb mappings, the combination of NomBank and PropBank allows for generalization of arguments across parts of speech. This paper describes our annotation task including factors which make assigning role labels to noun arguments a challenging task. 1.
In this paper we present a proposal to extend WordNet-like lexical databases by adding information about the co-occurrence of word meanings in texts. More specifically we propose to add phrasets, i.e. sets of free combinations of words which are recurrently used to express a concept (let's call them Recurrent Free Phrases). Phrasets are a useful source of information for different NLP tasks, and particularly in a multilingual environment to manage lexical gaps. At least a part of recurrent free phrases can also be represented through a new set of syntagmantic (lexical and semantic) WordNet relations.
Tree-based approaches to alignment model translation as a sequence of probabilistic operations transforming the syntactic parse tree of a sentence in one language into that of the other. The trees may be learned directly from parallel corpora (Wu, 1997), or provided by a parser trained on hand-annotated treebanks (Yamada and Knight, 2001). In this paper, we compare these approaches on Chinese-English and French-English datasets, and find that automatically derived trees result in better agreement with human-annotated word-level alignments for unseen test data.
Recent evaluation techniques applied to corpus-based systems have been introduced that can predict quantitatively how well surface realizers will generate unseen sentences in isolation. We introduce a similar method for determining the coverage on the Fuf/Surge symbolic surface realizer, report that its coverage and accuracy on the Penn TreeBank is higher than that of a similar statistics-based generator, describe several benefits that can be used in other areas of computational linguistics, and present an updated version of Surge for use in the NLG community.
In the context of the Papillon project, which aims at creating a multilingual lexical database (MLDB), we have developed Jeminie, an adaptable system that helps automatically building interlingual lexical databases from existing lexical resources. In this article, we present a taxonomy of criteria for evaluating a MLDB, that motivates the need for arbitrary compositions of criteria to evaluate a whole MLDB. A quality measurement method is proposed, that is adaptable to different contexts and available lexical resources.
This paper tries to analyse translation criticism on published books, using concept and sub-categories of translation norms. Analysed in this paper translation criticism divided into shcolars’ (but not in translation studies area) and general readers’. Translation norms as an analysing tool consist of 1) adequacy vs. acceptability, 2) translation policy, 3) directness 4) matricial norm 5) text-linguistic norm. Results are as follows: scholars’ criticism tends to focus on adequacy (accordance with source text culture), whereas general readers point out insufficient acceptability(accordance with source text culture); it seems that translation policy and directness are not the main concern in translation criticism; adequacy vs. acceptability norm is closely related with matricial and text-linguistic norm. The difference of scholars’ and general readers’ criticism tendency implies that different views possibly exist between various reader groups. This point needs further examination. Close relationship between adequacy vs. acceptability and matricial vs. text-linguistic norm also needs further research. The latter may be concrete basis for the former. It it is confirmed, we can make the analysing tool more simple. As for general readers, it is observed that readers, publishing companies and tranlators interact very actively on Internet sites. Although based on limited examples, this paper shows current state of translation criticism by Korean readers.
In this paper we present a methodology for extracting subcategorisation frames based on an automatic LFG f-structure annotation algorithm for the Penn-II Treebank. We extract abstract syntactic function-based subcategorisation frames (LFG semantic forms), traditional CFG category-based subcategorisation frames as well as mixed function/category-based frames, with or without preposition information for obliques and particle information for particle verbs. Our approach does not predefine frames, associates probabilities with frames conditional on the lemma, distinguishes between active and passive frames, and fully reflects the effects of long-distance dependencies in the source data structures. We extract 3586 verb lemmas, 14348 semantic form types (an average of 4 per lemma) with 577 frame types. We present a large-scale evaluation of the complete set of forms extracted against the full COMLEX resource.
The purpose of this paper is to describe the TuBa-D/Z treebank of written German and to compare it to the independently developed TIGER treebank (Brants et al., 2002). Both treebanks, TIGER and TuBa-D/Z, use an annotation framework that is based on phrase structure grammar and that is enhanced by a level of predicate-argument structure. The comparison between the annotation schemes of the two treebanks focuses on the different treatments of free word order and discontinuous constituents in German as well as on differences in phrase-internal annotation.
This paper is a contribution to the issue -- which has, in the course of the last decade, become critical -- of the basic requirements and validation criteria for lexical language resources in Standard Arabic. The work is based on a critical analysis of the architecture of the DIINAR.1 lexical database, the entries of which are associated with grammar-lexis relations operating at word-form level (i.e. in morphological analysis). Investigation shows a crucial difference, in the concept of 'lexical database', between source program and generated lexica. The source program underlying DIINAR.1 is analysed, and some figures and ratios are presented. The original categorisations are, in the course of scrutiny, partly revisited. Results and ratios given here for basic entries on the one hand, and for generated lexica of inflected word-forms on the other. They aim at giving a first answer to the question of the ratios between the number of lemma-entries and inflected word-forms that can be expected to be included in, or generated by, a Standard Arabic lexical dB. These ratios can be considered as one overall language-specific criterion for the analysis, evaluation and validation of lexical dB-s in Arabic.
Scaling wide-coverage, constraint-based grammars such as Lexical-Functional Grammars (LFG) (Kaplan and Bresnan, 1982; Bresnan, 2001) or Head-Driven Phrase Structure Grammars (HPSG) (Pollard and Sag, 1994) from fragments to naturally occurring unrestricted text is knowledge-intensive, time-consuming and (often prohibitively) expensive. A number of researchers have recently presented methods to automatically acquire wide-coverage, probabilistic constraint-based grammatical resources from treebanks (Cahill et al., 2002, Cahill et al., 2003; Cahill et al., 2004; Miyao et al., 2003; Miyao et al., 2004; Hockenmaier and Steedman, 2002; Hockenmaier, 2003), addressing the knowledge acquisition bottleneck in constraint-based grammar development. Research to date has concentrated on English and German. In this paper we report on an experiment to induce wide-coverage, probabilistic LFG grammatical and lexical resources for Chinese from the Penn Chinese Treebank (CTB) (Xue et al., 2002) based on an automatic f-structure annotation algorithm. Currently 96.751% of the CTB trees receive a single, covering and connected f-structure, 0.112% do not receive an f-structure due to feature clashes, while 3.137% are associated with multiple f-structure fragments. From the f-structure-annotated CTB we extract a total of 12975 lexical entries with 20 distinct subcategorisation frame types. Of these 3436 are verbal entries with a total of 11 different frame types. We extract a number of PCFG-based LFG approximations. Currently our best automatically induced grammars achieve an f-score of 81.57% against the trees in unseen articles 301-325; 86.06% f-score (all grammatical functions) and 73.98% (preds-only) against the dependencies derived from the f-structures automatically generated for the original trees in 301-325 and 82.79% (all grammatical functions) and 67.74% (preds-only) against the dependencies derived from the manually annotated gold-standard f-structures for 50 trees randomly selected from articles 301-325.
Especially for English, the number of hand-coded electronic resources available to the Natural Language Processing Community keeps growing: annotated corpora, treebanks, lexicons, wordnets, etc. Unfortunately, initial funding for such projects is much easier to obtain than the additional funding needed to enlarge or improve upon such resources. Thus once one proves the usefulness of a resource, it is difficult to make that resource reach its full potential. We discuss techniques for combining dictionary resources and producing others by semi-automatic means. The resources we created using these techniques have become an integral part of our work on NomBank, a project with the goal of annotating noun arguments in the Penn Treebank II corpus (PTB). 1.
The basic prerequisite for using any language is the willingness of the speaker to follow the rules of the game. Socially defined norms of language use then tend to set the limits within which one can express oneself using this language. Whether these norms set the speaker free or whether they act as constraints in a free expression of Self, is a question that will be raised in this article. Using examples from Hindi, the paper highlights the role of such norms of language use in perpetuating gender stereotypes. Gender stereotypes get constructed as part of a broader process of social differentiation but the site of this construction is to a large extent the normal everyday discourse. A normal classroom discussion amongst university students in New Delhi thus shows how deep rooted such stereotypes are and how effectively they get perpetuated through language and linguistic norms in Indian society. The basic premise in this paper is that meanings are context-specific, they are not fixed and they get created in discourse. But since language use is one thread in social fabric, it serves as an instrument to construct and perpetuate gender stereotypes. The paper is more of an essay on issues that became obvious about gender stereotypes during two classroom discussions. It should not therefore be taken as a study into the deeper aspects of gender representation in Hindi.
Among the variety of proposals currently making the dependency perspective on grammar more concrete, there are several treebanks whose annotation exploits some form of Relational Structure that we can consider a generalization of the fundamental idea of dependency at various degrees and with reference to different types of linguistic knowledge. The paper describes the Relational Structure as the common underlying representation of treebanks which is motivated by both theoretical and task-dependent considerations. Then it presents a system for the annotation of the Relational Structure in treebanks, called Augmented Relational Structure, which allows for a systematic annotation of various components of linguistic knowledge crucial in several tasks. Finally, it shows a dependency-based annotation for an Italian treebank, i.e. the Turin University Treebank, that implements the Augmented Relational Structure. 1
Nous décrivons l’extraction d’une grammaire d’arbres adjoints (TAG) à partir d’une banque d’arbres de l’arabe écrit. Nous montrons queleques exemples d’arbres élémentaires ainsi obtenus, et les structures de dérivation (donc, de dépendence syntaxique) qui y correspondent. We describe the extraction of a Tree Adjoining Grammar from the Penn Arabic Treebank.1 We show some examples of extracted trees for different constructions, and the corresponding derivation structures (which represent syntactic dependency). 1
This paper describes a method for conducting evaluations of Treebank and non-Treebank parsers alike against the English language U. Penn Treebank (Marcus et al., 1993) using a metric that focuses on the accuracy of relatively non-controversial aspects of parse structure. Our conjecture is that if we focus on maximal projections of heads (MPH), we are likely to find much broader agreement than if we try to evaluate based on order of attachment. We hope that this method may find wider acceptance and be useful in establishing a generally applicable framework for evaluation in natural language parsing. We employ this method in an evaluation of NLPWin (Heidorn, 2000), a parser developed at Microsoft Research without reference to the Penn Treebank, and, for comparison, the well-known statistical Treebank parser of Charniak (2000). 1.
This report presents an approach to enriching flat and robust predicate argument structures with more fine-grained semantic information, extracted from underspecified semantic representations and encoded in Minimal Recursion Semantics (MRS). Such representations are provided by a hand-built HPSG grammar with a wide linguistic coverage. A specific semantic representation, called linked predicate argument structure (LPAS), has been worked out, which describes the explicit embedding relationships among predicate argument structures. LPAS can be used as a generic interface language for integrating semantic representations with different granularities. Some initial experiments have been conducted to convert MRS expressions into LPASs. A simple constraint solver is developed to resolve the underspecified dominance relations between the predicates and their arguments in MRS expressions. LPASs are useful for high-precision information extraction and question answering tasks because of their fine-grained semantic structures. In addition, I have attempted to extend the lexicon of the HPSG English Resource Grammar (ERG) exploiting WordNet and to disambiguate the readings of HPSG parsing with the help of a probabilistic parser, in order to process texts from application domains. Following the presented approach, the HPSG ERG grammar can be used for annotating some standard treebank, e.g., the Penn Treebank, with its fine-grained semantics. In this vein, I point out opportunities for a fruitful cooperation of the HPSG annotated Redwood Treebank and the Penn PropBank. In my current work, I exploit HPSG as an additional knowledge resource for the automatic learning of LPASs from dependency structures.
To assign semantic roles in building Treebanks, there is a need for annotators having a guideline in determining semantic relations between phrasal head and its modifiers or arguments. Semantic roles are hard to have clear-cut definitions. It is not always easy to determine thematic relations between two concepts. This paper aims to introduce an integrated nominal modifier system. Basically we adopt other scholars ' incisive idea in analyzing semantic roles that modify general nouns. We use the approach of building a fine-grain taxonomy of role system. The taxonomy of fine-grain thematic roles makes the role determination easier for human annotators, since the meaning of a fine-grain semantic role is self explanatory and a higher-level semantic role is described by its hyponyms. The proposed taxonomy has been attested during construction of Sinica TreeBank and HowNet definitions of nominal concepts and proven to be more applicable than conventional flat structures. 1
Function tags are a context-sensitive annotation applied to words and phrases of natural language text, marking their syntactic or semantic role within a larger utterance. As researchers improve results on various other problems in “pure” natural language processing (e.g part-of-speech tagging, parsing), those who work in the more “applied” NLP fields (e.g. question-answering, temporal analysis) are seeking more powerful sorts of linguistic annotation as input for their own systems. Hence, function tags. In the first part of the thesis, I present the problem of function tagging: why it is an interesting problem, who has worked on similar thing, and what exactly I intend to do. I briefly review the function tags of the Penn treebank, and explain the specific metrics by which I will evaluate my work. In the second part of the thesis, I introduce the many features that I will use to train a function tagging system, and then I present some systems that make use of them: one using feature trees, one using decision trees (briefly), and one using perceptron models. For each system, I give a brief historical perspective, an overview of where it has been used before and why I think it will be useful in this task. I will then try a number of feature combinations with interesting properties; and finally, present the best-performing tweaked-out version of that system. Finally, in the third part of the thesis, I bring them all together and discuss the advantages and disadvantages of each system in various situations. More interestingly, I will present an analysis of what features prove to be the most helpful for the different function tagging subtasks. Lastly, I will present a comparison to other systems performing related tasks, and speculate on some interesting future work.
Word-to-word dependency structures are useful for consistent representation and comparable evaluation of parsing results. However, most large-scale treebanks contain various variants of phrase structure trees, since automatic parsers usually produce constituent struc-tures. We present a freely available extensible tool for converting phrase structure to dependencies automatically, and discuss its appli-cation to the NEGRA treebank of German. 1.
In the present paper we discuss some issues connected with the condition of projectivity in a dependency based description of language (see Sgall, Hajičová, and Panevová (1986), Hajičová, Partee, and Sgall (1998)), with a special regard to the annotation scheme of the Prague Dependency Treebank (PDT, see Hajič (1998)). After a short Introduction (Section 1), the condition of projectivity is discussed in more detail in Section 2, presenting its formal definition and formulating an algorithm for testing this condition on a subtree (Section 2.1); the introduction of the condition of projectivity in a formal description of language is briefly substantiated in Section 2.2. and some problematic cases are discussed in Section 2.3. In Section 3, a preliminary classification into three main groups and several subgroups of Czech non-projective constructions on the analytical level is presented (Section 3.1),
We present the architectural design rationale of a Sanskrit computational linguistics platform, where the lexical database has a central role. We explain the structuring requirements issued from the interlinking of grammatical tools through its hypertext rendition.
This paper argues for the development of parallel treebanks. It summarizes the work done in this area and reports on experiments for building a Swedish-German treebank. And it describes our approach for reusing resources from one language while annotating another language.
This paper describes the representation of Basque Multiword Lexical Units and the automatic processing of Multiword Expressions. After discussing and stating which kind of multiword expressions we consider to be processed at the current stage of the work, we present the representation schema of the corresponding lexical units in a general-purpose lexical database. Due to its expressive power, the schema can deal not only with fixed expressions but also with morphosyntactically flexible constructions. It also allows us to lemmatize word combinations as a unit and yet to parse the components individually if necessary. Moreover, we describe HABIL, a tool for the automatic processing of these expressions, and we give some evaluation results. This work must be placed in a general framework of written Basque processing tools, which currently ranges from the tokenization and segmentation of single words up to the syntactic tagging of general texts.
Biomimetic design uses ideas from biological phenomena as inspiration in design. To support biomimetic design, biological analogies are identified by finding instances of functional keywords that describe the engineering problem in biological knowledge in natural-language format. Challenges in using this approach include the identification of keywords, and the quantity and quality of results found. WordNet, a lexical database, is used as a language framework to systematically generate alternative keywords to find matches and analyze the results of searches. Troponyms from WordNet were found to provide better and more plentiful keywords than did synonyms. Due to the potentially large number of matches to keywords, matches are analyzed to facilitate extraction of dominant biological phenomena associated with keywords. This analysis found that words that frequently collocated with keywords tend to be objects of the keyword verb or agents that carry out the actions of the keyword. Furthermore, nouns that are inanimate, e.g., substances, tend to be objects, and nouns that are animate e.g., animals, organs, tend to be agents. Distinguishing frequently collocated words and their relationships to keywords can be used to facilitate identification of biological analogies in natural-language format to support design.Copyright © 2004 by ASME
Abstract This paper surveys work on applying the insights of lexicalized grammars to low‐level discourse, to show the value of positing an autonomous grammar for low‐level discourse in which words (or idiomatic phrases) are associated with discourse‐level predicate–argument structures or modification structures that convey their syntactic‐semantic meaning and scope. It starts by describing a lexicalized Tree Adjoining Grammar for discourse (D‐LTAG). It then reviews an initial experiment in parsing text automatically, using both a lexicalized TAG and D‐LTAG, and then touches upon issues involved in how lexico‐syntactic elements contribute to discourse semantics. The paper concludes with a brief description of the Penn Discourse TreeBank, a resource being developed for the study of discourse structure and semantics.
Concept mapping is a knowledge elicitation technique which stimulates learners to articulate and synthesize their actual states of knowledge during the learning process. Several approaches have been proposed for automating the assessment procedure of learners' concept maps based on an expert's map as a reference point. However, these approaches do not handle cases where learners have misspelled a concept or they have used a synonym or a concept related to the appropriate one. In this paper we present an alternative approach in which the process of the error identification is performed through the use of an expert map and of WordNet which is an electronic lexical database containing semantic relationships between words. This way we handle cases such as misspelled concepts, synonyms and related concepts. After error detection WordNet is also employed for providing the learner with appropriate feedback based on the identified errors, with the intention of helping the learner to correct them.
The effects of emotional connotation on emotional Stroop interference in anxiety were examined. First, a classical conditioning paradigm was used in which neutral words and nonwords were paired with either negative or neutral pictures. These conditioned stimuli were then presented in an emotional Stroop paradigm. Finally, participants rated each word and nonword for emotional connotation. The high-anxious group demonstrated significant interference for the nonwords that had been negatively conditioned, and these effects did not dissipate over time. The affective rating data supported the view that nonwords, but not the words had been successfully conditioned in the high-anxious group. This experiment provides evidence for the importance of emotional connotation rather than confounded semantic factors in the emotional Stroop effect.
CDG represents a sentence's grammatical structure as assignments of dependency relations to functional variables associated with each word in the sentence. In this paper, we describe a statistical CDG (SCDG) parser that performs parsing incrementally and evaluate it on the Wall Street Journal Penn Treebank. Using a tight integration of multiple knowledge sources, together with distance modeling and synergistic dependencies, this parser achieves a parsing accuracy comparable to several state-of-the-art context-free grammar (CFG) based statistical parsers using a dependency-based evaluation metric. Factors contributing to the SCDG parser's performance are analyzed.
We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are nonoptimal, in the sense that a collection of probability distributions cannot be obtained. In particular, some probability distributions expressible in terms of a context-free grammar cannot be expressed in terms of the LR parser constructed from that grammar, under the restrictions of the existing approaches to training of LR parsers. We present an alternative way of training that is provably optimal, and that allows all probability distributions expressible in the context-free grammar to be carried over to the LR parser. We also demonstrate empirically that this kind of training can be effectively applied on a large treebank.
We present an automatic semantic roles labeling system for structured trees of Chinese sentences. It adopts dependency decision making and example-based approaches. The training data and extracted examples are from the Sinica Treebank, which is a Chinese Treebank with semantic role semantic roles including thematic roles, such as ‘agent’; ‘theme’, ‘instrument’, and secondary roles of ‘location’, ‘time’, ‘manner ’ and roles for nominal modifiers. The design of role assignment algorithm is based on the different decision features, such as head-argument/modifier, case makers, sentence structures etc. It labels semantic roles of parsed sentences. Therefore the practical performance of the system depends on a good parser which labels the right structures of sentences. The system achieves 92.71 % accuracy in labeling the semantic roles for pre-structure- bracketed texts which is considerably higher than the simple method using probabilistic model of head-modifier relations. 1.
機械翻訳システムによる翻訳を人間による翻訳に近づけるために取り組むべき課題を明らかにしようという試みの一環として, 本稿では, ニュース記事から無作為抽出した英文を英日機械翻訳システムで翻訳した結果と, これらの英文を人間が翻訳した結果を照らし合わせ, 両者の間で使用されている動詞の馴染み度の分布に違いがあるかどうかを計量的に分析した. 動詞の馴染み度を測る尺度としては, NTTの単語親密度データベースを利用した. 分析の結果, 機械翻訳システムによる翻訳と人間による翻訳の間で単語親密度の分布に統計的有意差は認められず, 使用されている動詞の馴染み度に関しては両者の間で違いがないということが示唆された. 従って, 格要素などとの共起関係を考えず動詞だけに着目した場合, 調査対象とした機械翻訳システムでは動詞の翻訳品質は一定のレベルに達していると判断できる.
The claim made in this paper is that in a formal description of language, it is possible and useful to work with dependency-based underlying representations of sentences (tectogrammatical representations) meeting the condition of projectivity. The reasons for the inclusion of this condition into the definition of the tectogrammatical representations are both formally and empirically sound (Section 1). An analysis of the material offered by the Prague Dependency Treebank with annotations of the underlying syntactic structure of sentences (described in Section 2) has led to an interesting classification of non-projective constructions in Czech (Section 3). It documents that most (types of) constructions that appear to be non-projective in the surface shape of sentences can be described by means of projective trees. The realization of the surface word order (with the use of movement rules) is then relegated to the morphemic level, where the representation of the sentence has the shape of a string rather than a tree.
A statistical corpus-based approach for acquiring selectional preferences of verbs is proposed. By parsing through text corpora, we obtain examples of context nouns that are considered to be the selectional preferences of a given verb. The approach is to generalize initial noun classes to the most appropriate levels on a semantic hierarchy. We present an iterative algorithm for generalization by combining an agglomerative merging and a model selection technique called the Bayesian Information Criterion (BIC). In our experiments, we consider the Web as the large corpora. We also propose approaches for extracting examples from the Web. Preliminarily experimental results are given to show the feasibility and effectiveness of our approach. 1.
The requirements of the depth and precision of annotation vary for different intended uses of the corpus but it has been commonly accepted nowadays that the standard annotations of surface structure are only the first steps in a more ambitious research program, aiming at a creation of advanced resources for most different systems of natural language processing and for testing and further enrichment of linguistic and computational theories. Among the several possible directions in which we believe the standard annotation systems should go (and in some cases already attempt to go) beyond the POS tagging or shallow syntactic annotations, the following four are characterized in the present contribution: (i) predicateargument representation of the underlying syntactic relations as basically corresponding to a rooted tree that can be univocally linearized, (ii) the inclusion of the information structure using very simple means (the left-to-right order of the nodes and three attribute values), (iii) relating this underlying structure (rendering the ”linguistic meaning,” i.e. the semantically relevant counterparts of the grammatical means of expression) to certain central aspects of referential semantics (reference assignment and coreferential relations), and (iv) handling of word sense disambiguation. The first three issues are documented in the present paper on the basis of our experience with the development of the structure and scenario of the Prague Dependency Treebank which provides for syntactico-semantic annotation of large text segments from the Czech National Corpus and which is based on a solid theoretical framework.
The annotation of the Prague Dependency Treebank (PDT) is conceived of as a multilayered scenario that comprises also dependency representations (tectogrammatical tree structures, TGTS’s) of the underlying structure of the sentences. TGTS’s capture three basic aspects of the underlying structure of sentences: (a) the dependency tree structure, (b) the kinds of dependency syntactic relations, and (c) the basic characteristics of the topic-focus articulation (TFA). Since the PDT is a large collection and the annotations on the deepest layer are to a large extent performed by several human annotators (based on an automatic preprocessing module), it is more than necessary to observe the consistence of annotators and the agreement among them. In the present paper, we summarize the results of the evaluation of parallel annotations of several samples taken from PDT and the measures accepted to improve the consistency of annotations.
In this study, a technique called semantic self-organization is used to scale up the subsymbolic approach by allowing a network to optimally allocate frame representations from a semantic dependency graph. The resulting architecture, INSOMNet, was trained on semantic representations of the newly-released LinGO Redwoods HPSG Treebank of anno-tated sentences from the VerbMobil project. The results show that INSOMNet is able to accurately represent the semantic dependencies while demonstrating expectations and defaults, coactivation of multiple interpretations, and robust process-ing of noisy input. The cognitive plausibility of the model is underscored by the collective modelling of four experiments from the visual worlds paradigm to show the model’s ability to adapt to context.