Papers reviewed and determined not to be word norm studies. Use the flag icon to report errors or suggest re-inclusion.
18625 papers
1. Preface 2. Words, numbers and all that: The lexicon in sentence understanding (by Stevenson, Suzanne) 3. The lexicon in Optimality Theory (by Bresnan, Joan) 4. Optimality-theoretic Lexical Functional Grammar (by Johnson, Mark) 5. The lexicon and the laundromat (by Fodor, Jerry) 6. Semantics in the spin cycle: Competence and performance criteria for the creation of lexical entries (by Weinberg, Amy) 7. Connectionist and symbolist sentence processing (by Steedman, Mark) 8. A computational model of the grammatical aspects of word recognition as supertagging (by Kim, Albert E.) 9. Incrementality and lexicalism: A treebank study (by Lombardo, Vincenzo) 10. Modular architectures and statistical mechanisms: The case from lexical category disambiguation (by Crocker, Matthew) 11. Encoding and storage in working memory during sentence comprehension (by Stowe, Laurie A.) 12. The time course of information integration in sentence processing (by Spivey, Michael J.) 13. The lexical source of unexpressed participants and their role in sentence and discourse understanding (by Mauner, Gail) 14. Reduced relatives judged hard require constraint-based analyses (by Filip, Hana) 15. Predicting thematic role assignments in context (by Altmann, Gerry T.M.) 16. Lexical semantics as a basis for argument structure frequency biases (by Argamann, Vera) 17. Verb sense and verb subcategorization probabilities (by Roland, Doug) 18. Author index 19. Item index
The method of organization of word meanings is a crucial issue with lexical databases. Our purpose in this research is to extract word hierarchies from corpora automatically. Our initial task to this end is to determine adjective hyperonyms. In order to find adjective hyperonyms, we utilize abstract nouns. We constructed linguistic data by extracting semantic relations between abstract nouns and adjectives from corpus data and classifying abstract nouns based on adjective similarity using a self-organizing semantic map, which is a neural network model (Kohonen 1995). In this paper we describe how to hierarchically organize abstract nouns (adjective hyperonyms) in a semantic map mainly using CSM. We compare three hierarchical organizations of abstract nouns, according to CSM, frequency (Tf.CSM) and an alternative similarity measure based on coefficient overlap, to estimate hyperonym relations between words.
Reviewed by: Prague Linguistic Circle papers ed. by Eva Hajičová et al. Zdenek Salzmann Prague Linguistic Circle papers. Travaux du cercle linguistique de Prague, new series, vol. 4. Ed. by Eva Hajičová, Petr Sgall, Jiříhana, and Tomáš Hoskovec. Amsterdam: John Benjamins, 2002. Pp. vii, 376. ISBN 158811175X. $125 (Hb). This is the fourth volume in the TCLP series begun in 1995. It consists of thirteen papers assigned to five parts. The majority of contributors are from the Czech Republic; also represented are scholars from Germany (two) and from the United States, Russia, and Israel (one from each country). Part 1, ‘The Prague tradition in retrospect’ (1–108), contains three papers by now-deceased members of the Circle. The first is by Josef Vachek (1909–1996), the Circle’s most courageous defender during the bleak post-World War II years. His long paper, ‘Prolegomena to the history of the Prague School of Linguistics’, was first published in 1999, three years after his death (I reviewed the original Czech version in Language 76.471–72, 2000). The second paper, by Oldřich Leška (1927–1997), is titled ‘Anton Marty’s philosophy of language’ (83–99). Swiss-born Marty taught at Prague’s German University until his death in 1914, and some of his lectures were attended by Vilém Mathesius, the Circle’s founder. According to Leška, ‘it was easy for Mathesius [to transform Marty’s] general ideas [about language] into an effective system of descriptive functional grammar’ (92). The last paper in this part is Vladimír Skalička’s ‘Die Typologie des Ungarischen’ (101–8). Skalička (1909–1991), a Finno-Ugricist, taught general linguistics, and many of his publications dealt with linguistic typology; this chapter is a translation of a paper published in 1967 in Hungarian. The first paper of Part 2, ‘Grammar’ (109–81), is by Eva Hajičová. In her article ‘Theoretical description of language as a basis of corpus annotation: The case of Prague Dependency Treebank’, the author argues that annotation (tagging) scenarios should include an underlying level of syntactic annotation, and she then attempts to demonstrate that the design of such a scenario is feasible if it is based on a sound, explicit linguistic theory. Next, Yishai Tobin asks if ‘conditionals’ in Hebrew and English are the same or different, and concludes that the Hebrew system of conditionals classifies alternative perceptions of possibilities according to a totally different set of semantic criteria. Indo-Europeanists would be interested in Tomáš Hoskovec’s article ‘Sur la paradigmatisation du verbe indo-européen’ (begun in TCLP 3), in which he describes the structure of verbal paradigms in Greek and Latin, and in Baltic and Slavic languages. Part 3, ‘Topic-focus articulation’ (183–305), begins with a paper by Vladimir Borschev and Barbara H. Partee. While a full account of the problem of the Russian genitive of negation in existential sentences is yet to be attained, a picture may slowly be emerging: aspects of both functional and formal (syntactic) approaches may have to be employed for an adequate description. The aim of Libuše Dušková’s paper is to show that the functional sentence perspective (FSP) structure of the different syntactic realizations of the second participant in verbal action with the FSP function of the theme is to some extent differentiated rather than interchangeable. In a paper originally published in 1995, Jaroslav Peregrin claims that the theory of generalized quantifiers can provide for an adequate framework for the analysis of the topic-focus articulation. Klaus von Heusinger presents a different approach to dealing with information structure. He argues for a two-level semantics, with one level corresponding to the meaning of a sentence, and the other to the background meaning. In Part 4, ‘General views’ (307–62), Petr Sgall writes about the nature, sources, and consequences of freedom in natural languages. Philip A. Luelsdorff proposes that English has four tenses (future, present, past, and generic) and four aspects (to future, progressive, perfect, and passive); the tenses express...
Nowadays language learning systems beyond hypermedia technologies increasingly adopt Computational Linguistics technologies, network technologies and Artificial Intelligence to improve the learning process. However, although such technologies are thought to be very useful to support authentic language learning environments and to simulate real communication situations a certain neglect of such systems is lamented, even within the research community. One reason is that specific knowledge out of different disciplines is necessary to provide an innovative language learning system. This development process can be made more efficient, if methods are found to join independently developed mature products to a single learning environment. In this article we will present two interdisciplinary research projects out of the domain of lexicography, which are both ready to be integrated within other e-learning resources. Word Manager (WM) is a reusable lexical database that provides information about inflection, word formation and orthography. ELDIT is a web-based educational system for learners of the German and Italian languages. Both systems can be integrated into other learning environments as well as extended by new modules by themselves. The collaboration between ELDIT and WM has shown that these advantages can also be realized in practice. Joining the two products efficiently supported the creation of an innovative language learning environment.
In this paper we will present work carried out on the 50,000 words Italian Spontaneous Speech Corpus called AVIP, under national project API, made available for free download from the website of the coordinator, the University of Naples – Federico II. We will concentrate on the tuning of the parser for Italian which had been previously used to parse 100,000 words corpus of written Italian within the National Treebank initiative coordinated by ILC in Pisa. We will also present the linguistic annotation tools needed to allow the parser to produce syntactic structures automatically.\nIn particular, in order to produce appropriate linguistic annotations, all transcribed materials need to be transliterated from the audio-transcription to a more standard orthographic format. In that way, the parser receives as an input the adequately transformed orthographic transcription of the dialogues making up the corpus, in which pauses, hesitations and other disfluencies have been turned into most likely corresponding punctiation marks, interjections or truncation of the word underlying the uttered segment.\nThe most interesting phenomenon we will discuss is without any doubts “overlap”, i.e. a speech event in which two people speak at the same time by uttering actual words or in some cases nonwords, when one of the speakers, usually the one which is not the current turntaker, interrupts or backchannels the current speaker. This phenomenon takes place at a certain point in time where it has to be anchored to the speech signal but in order to be fully parsed and subsequently semantically interpreted, it needs to be referred semantically both to a following turn and to the local turn where it may produce conversational moves to repair what has been previously said by the current speaker.
This paper reports on an ongoing project that uses varied language resources and advanced NLP tools for a linguistic classification task in discourse semantics. The system we present is designed to assign a “situation entity ” class label to each predicator in English text. The project goal is to achieve the best-possible identification of situation entities in naturally-occurring written texts by implementing a robust system that will deal with real corpus material, rather than just with constructed textbook examples of discourse. In this paper we focus on the combination of multiple information sources, which we see as being vital for a robust classification system. We use a deep syntactic grammar of English to identify morphological, syntactic, and discourse clues, and we use various lexical databases for fine-grained semantic properties of the predicators. Experiments performed to date show that enhancing the output of the grammar with information from lexical resources improves recall but lowers precision in the situation entity classification task. 1.
The task of inducing grammar structures has received a great deal of attention. The reasons why researchers have studied are different; to use grammar induction as the first stage in building large treebanks or to make up better language models. However, grammar induction has inherent computational complexity. To overcome it, some grammar induction algorithms add new production rules incrementally. They refine the grammar while keeping their computational complexity low. In this paper, we propose a new efficient grammar induction algorithm. Although our algorithm is similar to algorithms which learn a grammar incrementally, our algorithm uses the graphical EM algorithm instead of the Inside-Outside algorithm. We report results of learning experiments in terms of learning speeds. The results show that our algorithm learns a grammar in constant time regardless of the size of the grammar. Since our algorithm decreases syntactic ambiguities in each step, our algorithm reduces required time for learning. This constant-time learning considerably affects learning time for larger grammars. We also reports results of evaluation of criteria to choose nonterminals. Our algorithm refines a grammar based on a nonterminal in each step. Since there can be several criteria to decide which nonterminal is the best, we evaluate them by learning experiments.
An automatic method for annotating the Penn-II Treebank (Marcus et al., 1994) with high-level Lexical Functional Grammar (Kaplan and Bresnan, 1982; Bresnan, 2001; Dalrymple, 2001) f-structure representations is described in (Cahill et al., 2002; Cahill et al., 2004a; Cahill et al., 2004b; O’Donovan et al., 2004). The annotation algorithm and the automatically-generated f-structures are the basis for the automatic acquisition of wide-coverage and robust probabilistic approximations of LFG grammars (Cahill et al., 2002; Cahill et al., 2004a) and for the induction of LFG semantic forms (O’Donovan et al., 2004). The quality of the annotation algorithm and the f-structures it generates is, therefore, extremely important. To date, annotation quality has been measured in terms of precision and recall against the DCU 105. The annotation algorithm currently achieves an f-score of 96.57% for complete f-structures and 94.3% for preds-only \nf-structures. There are a number of problems with evaluating against a gold standard of this size, most \nnotably that of overfitting. There is a risk of assuming that the gold standard is a complete and balanced \nrepresentation of the linguistic phenomena in a language and basing design decisions on this. It is, therefore, \npreferable to evaluate against a more extensive, external standard. Although the DCU 105 is publicly available, \n1 a larger well-established external standard can provide a more widely-recognised benchmark against which the quality of the f-structure annotation algorithm can be evaluated. For these reasons, we present an evaluation of the f-structure annotation algorithm of (Cahill et al., 2002; Cahill et al., 2004a; Cahill et al., 2004b; O’Donovan et al., 2004) against the PARC 700 Dependency Bank (King et al., 2003). Evaluation against an external gold standard is a non-trivial task as linguistic analyses may differ systematically between the gold standard and the output to be evaluated as regards feature geometry and nomenclature. We present conversion software to automatically account for many (but not all) of the systematic differences. Currently, we achieve an f-score of 87.31% for the f-structures generated from the original Penn-II trees and \nan f-score of 81.79% for f-structures from parse trees produced by Charniak’s (2000) parser in our pipeline \nparsing architecture against the PARC 700.
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 majority of electronic data today is in textual form.Financial data such as articles in the Wall Street Journal are written as texts.These electronic documents contain a wealth of information but require human interpretation.For financial analysis, rapid up-to-date information is critical.Most software tools currently require data which are better structured than text (such as data in relational databases).Thus, our research goal is to build a system, "FIRST" (Flexible Information extRaction SysTem), that will extract data from financial articles and store the output in an explicit format.FIRST uses natural language processing techniques and resources such as the lexical database WordNet and collocation information to extract information.We hope to be able to extract data such as an organization's name, its profit/loss status, and sales status, from financial articles to input into a database.The data will come from international corporate reports which appear in the Wall Street Journal.
Hate crime laws are a highly controversial legal approach in society's response to intergroup violence. Argument acceptance, knowledge, and individual differences were examined in relationship to attitudes about these laws. These variables were also considered in terms of efforts to influence a peer's beliefs about hate crime laws. One‐hundred and sixty‐seven participants completed a measure of knowledge of human rights laws, Gough's Pr scale, the Selznick and Steinberg anti‐Semitism scale, and Cuellar's Machismo scale. Hate crime attitudes were measured on an affect rating scale and six statements reflecting arguments favoring and opposing hate crime laws. Peer influence was examined on Interpersonal Power Inventory (IPI). Results showed that while most participants endorsed positive attitudes about hate crime laws, men—and both women and men who endorsed machismo attitudes—were more likely to agree with media distortion and identity politics arguments opposing hate crime laws. The Pr and machismo scales predicted greater effort on the IPI to influence peer attitudes about hate crime laws, after controlling for demographic differences of the participants. These findings indicate that more explicitly biased individuals were more effortful in trying to change the attitudes of peers concerning the legitimacy of hate crime laws.
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.
The present work falls in the line of activities promoted by the European Languguage Resource Association (ELRA) Production Committee (PCom) and raises issues in methods, procedures and tools for the reusability, creation, and management of Language Resources. A two-fold purpose lies behind this experiment. The first aim is to investigate the feasibility, define methods and procedures for combining two Italian lexical resources that have incompatible formats and complementary information into a Unified Lexicon (UL). The adopted strategy and the procedures appointed are described together with the driving criterion of the merging task, where a balance between human and computational efforts is pursued. The coverage of the UL has been maximized, by making use of simple and fast matching procedures. The second aim is to exploit this newly obtained resource for implementing the phonological and morphological layers of the CLIPS lexical database. Implementing these new layers and linking them with the already exisitng syntactic and semantic layers is not a trivial task. The constraints imposed by the model, the impact at the architectural level and the solution adopted in order to make the whole database ‘speak ’ efficiently are presented. Advantages vs. disadvantages are discussed. 1. Background and Motivations The work described here raises issues in methods, procedures and tools for the reusability, creation, and management of Language Resources (LRs) and has been
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.
In information retrieval and text mining, information on word senses is usually taken from dictionaries or lexical databases that have been prepared by lexicographers. We propose an automatic method for word sense induction, i.e. for the discovery of a set of sense descriptors to a given ambiguous word. The approach is based on the statistics of word co-occurrence as derived from Web pages. The underlying assumption is that the senses of an ambiguous word are best described by terms that, although bearing a strong association to this word, are mutually exclusive, i.e. whose association strength within the retrieved Web pages is as weak as possible. Measuring association strength is based upon a novel confidence gain approach that relates the observed co-occurrence frequency for two sense descriptor candidates to an average co-occurrence frequency for pairs of arbitrary words. The proposed approach is fully unsupervised and takes into account the contemporary meanings of words, as reflected in texts from the Internet. Our results are evaluated using a list of ambiguous words commonly referred to in the literature.
The architecture of a lexical database in which multilingual semantic networks would be stored requires the incorporation of e xible mechanisms and services, which would enable the efcient navigation within and across lexical data. We report on WordNet Management System (WMS), a system that functions as the interconnection and communication link between a user and a number of interlinked WordNets. Semantic information is being accessed through a distributed network of servers, forming a large-scale multilingual semantic network.
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.
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.
The purpose of this study is to identify the properties of special-word, and to show the process of extracting special-words from a large corpus. A special-word corresponds to the notion of unknown words, which is a counterpart of the lexical database in Natural Language Process(NLP). Generally unknown words cause a lot of ambiguities and thus decline the accuracy of NLP systems. The special-word in this work includes various expressions about the events of the day or the fashions, abbreviated words and naturalized word. We came up with a semi-automatic procedure of constructing a special-word dictionary mainly based on the language-dependent heuristics. We, however, also feel that other statistical considerations including frequencies, and probability distributions may be required for unknown word extractions in a higher automatic fashion.
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
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.
The preceding articles by Piek Vossen (PV), Willy Martin (WM), and Marc van Campenoudt (MC) give a much more detailed account on their respective multilingual lexical database designs than the article by myself in this same journal (MJ). At the same time, they indicate some points of concern regarding the set-up of the SIM<it>u</it>LLDA system. Rather than responding directly to the points raised, this response elaborates on the two aspects of the SIM<it>u</it>LLDA system that seem to form the main sources of these issues: the status of the definitional attributes, and the practical usability of the system. The issues raised in the preceding articles will be explicitly addresses in the course of this elaboration. For even more details on these topics, see Janssen (2002).
The current research explored the processes that predominate during the anticipation of an emotionally salient event. Experiment 1 (N536), employed three different conditional stimuli followed by pictorial pleasant, unpleasant or neutral unconditioned stimuli. Half the participants were trained with visual CSs, the other half with tactile CSs. In the group trained with visual CSs, startle eyeblinks were larger and faster during CSs that were paired with unpleasant pictures than CSs paired with neutral or pleasant pictures respectively, indicating an affect startle pattern. This linear trend was not found in the group trained with tactile CSs. Experiment 2 (N564) aimed to investigate whether the affective pattern found in the startle data in Experiment 1 could also be found using a behavioural measure of emotion. This time participants’ reaction time during a post-experimental affective priming taskwas used as dependantmeasure to assess the presence of emotional learning. Instead of a simple differential conditioning task, an occasion setting paradigm was employed and participants were trained using either a feature positive or feature negative design with pleasant or unpleasant picture USs. For participants trained with unpleasant USs, valence ratings collected before and after conditioning training suggested the presence of emotional learning, whereas no such pattern was found for participants trained with pleasant USs. These findings were not confirmed in the priming data.
Introduction The CorpusEye project (http://corp.hum.sdu.dk ) at the University of Denmark aims at designing and programming an internet based corpus search interface that (1) offers standardised search tools and a unified descriptive formalism across different corpus types and different languages, and (2) allows users to exploit grammatical information in annotated corpora in a user-friendly and menubased way. All corpora in CorpusEye have been annotated with VISL's Constraint Grammar based parsers, in the case of treebanks using an additional PSG module or equivalent (Bick 2003). At the time of writing, the material covers 8 languages and ca. 600 million words.
Schema matching is prerequisite to an automated transformation of XML documents. Because previous works about schema matching compute all semantically-possible matchings, they produce many-to-many matching relationships. Such imprecise matchings are inappropriate for an automated transformation of XML documents. This paper presents an efficient schema matching algorithm that computes precise one-to-one matchings between two schemas. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed and one-to-one matchings are finally extracted based on a proposed path similarity. Specifically, for a sophisticated schema matching, the proposed algorithm is based on a domain ontology as well as a lexical database that includes abbreviations and synonyms. Experimental results with real schemas from an e-commerce field show that the proposed method is superior to previous works, resulting in an accuracy of 97% in average.
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.
This paper presents a prosodic phrasing model for Korean to be used in a text-to-speech synthesis (TTS) system. Read text corpora were morpho-syntactically parsed and prosodically labeled following the Penn Korean Treebank (Han, Chunghye, Ko, Eon-Suk, Yi, Heejong, Palmer, M., 2002. Penn Korean Treebank: development and evaluation. In: Proceedings of the 16th Pacific Asian Conference on Language and Computation. Korean Society for Language and Information.) and K-ToBI prosodic labeling conventions (Sun-Ah, J., 2000. K-ToBI (Korean ToBI) labelling conventions. Version 3.1. Available from: URL.), respectively. Decision trees were trained with morpho-syntactic and textual distance features to predict locations of accentual and intonational phrase breaks. Our phrasing model cross-validated on a 300-sentence corpus (6936 words or 21,436 syllables, with an average of 72 syllables or 23 words per sentence) predicted non-breaks with F=92.4% and breaks with F=88.0% (F=72.8% for accentual phrase breaks and F=71.3% for intonational phrase breaks).
We present a method to approximate a LTAG grammar by a CFG. A key process in the approximation method is finite enumeration of partial parse results that can be generated during parsing. We applied our method to the XTAG English grammar and LTAG grammars which are extracted from the Penn Treebank, and investigated characteristics of the obtained CFGs. We perform CFG filtering for LTAG by the obtained CFG. In the experiments, we describe that the obtained CFG is useful for CFG filtering for LTAG parser. 1
The modern dominant approach to translation is that which aims at intelligibility of the meaning and normality of the style in the translated text. Many translation theorists maintain that a translator should attempt to produce a target text which is clear and understandable in meaning, normal in style, and natural in language. To attain this goal, one is allowed and sometimes obliged, to make some adjustments such as expansion and reduction in the process of transfer according to the linguistic norms of the receptor language. However, in translating a highly sensitive religious text like the Qur'an, the accuracy of the meaning conveyed in the translated text is of primary importance, since it is the source text which is considered as the main criterion in evaluating the translation. Therefore, no translator is allowed to sacrifice accuracy of the meaning for the sake of intelligibility and naturalness in the translation, nor is it legitimate to make the meaning unintelligible or distorted by producing a target text which is awkward andunnatural. What on should do is to produce a translation natural in language, intelligible and accurate in meaning
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 discourse-level annotation of newspaper texts in German and English, as part of an ongoing project aimed at investigating information structure from a cross-linguistic perspective. Rather than annotating some specific notion of information structure, we propose a theory-neutral annotation of basic features at the levels of syntax, prosody and discourse, using treebank data as a starting point. Our discourse-level annotation scheme covers properties of discourse referents (e.g., semantic sort, delimitation, quantification, familiarity status) and anaphoric links (coreference and bridging). We illustrate what investigations this data serves and discuss some integration issues involved in combining different levels of stand-off annotations, created by using different tools.
This paper presents an editor for compiling a multilingual machine readable lexicon, like the Simple-lexicon. This editor has proven to be a useful tool in linking several languages in one lexical database, and to edit the entries in a consistent and convenient way. The editor has been designed for linking Danish, Swedish and Norwegian in the Simple Scan-project, but might easily be extended to include all the languages in the Simple project. The editor may also be modified for similar machine readable lexical projects. 1.
The subject matter of this article concerns objectivity of lexicographic description. Here objectivity is being associated with the names of “functional” places, in D. Le Pesant’s understanding of the term. The author presents principles of the object-oriented description of lexicosemantic data, according to the concept by W. Banyś. Later on, she distinguishes a couple of basic classes of appropries predicates, which are typical for the locative nouns suggested by D. Le Pesant. The elements of the object-oriented approach are confronted with their counterparts in such lexicographic theories as: I. Melczuk and A.K. Zholkovsky’s frames, J. Pustejovsky’s qualia structure system, G. Gross’s object classes and unique beginners from the WordNet lexical database. In the suggested descriptive scheme of entries the author places results of her own analyses concerning descriptions of names of functional places, in this case-buildings.
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.
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.
The OmniPaper project has implemented several information retrieval prototypes in the area of electronic news publishing. One prototype uses SOAP as communication protocol between the central system and a number of distributed news archives. The second prototype uses an RDF metadata database, enabling direct metadata queries to the central system. Finally the Topic Map prototype uses query expansion and semantic linking for smart metadata search. The Topic Map prototype enhances the search experience by implementing a knowledge layer that combines the semantic content of a lexical database, consisting of concepts and keywords, with a metadata-set of newspaper articles. After developing and testing three smaller prototypes, the OmniPaper consortium has combined these prototypes in one. In this final prototype a kind of “enhanced full-text search” engine is implemented. This means that the prototype is an interface on top of existing search engines. When a user submits a query, this query is forwarded to several distributed news archives to retrieve relevant news articles. Next to this, the system: 1) translates queries to enable multilingual search, 2) provides a query refinement mechanism, both in graphic and text-based form, allowing users to adapt their query and 3) provides uniform result ranking algorithm across the different news archives. In this prototype querying and navigation are considered as alternative methods to find relevant information. Both interact with each other and together they produce a combined user experience that can be expressed as find what you were looking for and then browse away from it. In fact, the prototype considers both querying and navigation as a kind of search action and tries to integrate both. In concrete, keywords in a query are looked up in a dictionary and shown to the user. In the background, the keywords are translated and expanded to related terms. These expanded queries are sent to the underlying full-text search engine(s) in all requested languages. In the graphical tool (“web of concepts”) users can redefine the meaning of their query words, resulting in an updated query and result set. Both disambiguation (choosing one meaning of a word out of many) and refinement (browsing to related words) are possible. Figure 1 shows the web of concepts for the query “poll Indonesia”. The word “Indonesia” is recognized in only one concept, “Dutch East Indies”, whereas the word “poll” has many different meanings. If you select the meaning “canvass” for example, this word is replacing the word “poll” in the original query. After selection the concept “canvass” can again be expanded to related concepts, be it more general or more specific in meaning. In the textual tool only refinement is possible. The user gets a list of words that are related to the words appearing in the query, grouped into more similar, more specific and more general terms. Then the user can change his/her query using these proposed words.
Expert observers discriminate elementary features (e.g., colour, orientation) of salient objects outside their current focus of attention, but not complex features such as T/L shape or colour arrangement. Surprisingly, natural scene category behaves like an elementary feature in this context, in that scenes with vehicles, animals, etc. are successfully classified in a dual-task situation (Li et al., 2002). To confirm and extend this finding, we used a similar dual-task paradigm and presented a natural scene in the near periphery (8 to 14 eccentricity) simultaneously with an attention-demanding task near fixation (seven rotated Ts/Ls). Visual persistence was controlled by a particularly effective form of masking. For scenes of animals or vehicles (black and white with matched luminance scale), categorization performance exhibited little or no attentional cost, i.e., dual- and single-task performance were comparable. Thus, scene categorization under dual-task conditions can be explained neither by inadequate masking nor by trivial colour cues. In a second experiment, observers categorized scenes from the International Affective Image System database (IAPS, Lang et al., 1995) as “pleasant” or “unpleasant”. Although absolute performance was now lower (∼75% of the level reached under ideal viewing conditions), there was no significant attentional cost. As low-level features do not identify affective content, this implies some comprehension of scene gist. A control experiment highlighted the contrast between natural scenes and geometric stimuli in the dual-task situation (and also confirmed the peripheral absence of attention), in that observers failed to discriminate the colour arrangement of a peripherally presented ‘pill’ (half red, half green, inclined ±45 ). Li FF et al. (2002) Rapid natural scene categorization in the near absence of attention. PNAS 99: 9596ff. Lang PJ et al. (1995) IAPS: Technical Manual and Affective Ratings. Gainsville, FL.
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.
This paper explores the interaction between conceptual structure and morpho-syntax. In particular, we show that ontology-based conceptual classification can be used to predict internal relations in compounds. We propose an ontology-based approach to predict the semantic relation between the two component words in Mandarin VV compounds. A Mandarin VV compound is classified according to the eventive relation between the two simplex verbs. These relations specify how the eventive meanings of the two simplex verbs combine to form the meaning of the compound. The three types of eventive relations that we deal with in this paper are: coordinate, modificational, and resultative. Since the way in which two events combine with each other depends upon their event types, we hypothesize that the eventive relations can be predicted by the conceptual classified event types of the two simplex verbs. An approach of ontology-based prediction is proposed based on this hypothesis. The assignment of ontology classification for each simplex verb is based on SUMO and Sinica BOW. The correlation between the ontology class of each verb position and each eventive type is trained and scored based on a manually tagged lexical database. We encode the ontology information of each VV compound in a 3-tuple based on these correlation scores. This 3-tuple is represented as a three-dimensional vector and used to predict the eventive type of new VV compounds. Our classification experiment on unknown VV compounds yields good recall and precision. 1.
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 primary data of many experimental studies of animal learning and performance consist of the times at which stimuli and reinforcers were delivered, and the times at which responses occurred. The articles based on most of these studies report selected data, either from some sessions or some animals, or summary measures of the animals’ behavior. The primary data are sufficient to produce any of the selected and summary measures, but the selected and summarized data cannot produce many of the measures used in other experimental reports. It is now feasible to archive the primary data from animal behavior experiments so that they are accessible for others to perform secondary analysis. The value of such secondary analysis of archived data is described with a case study in which rats were trained on three fixed-interval schedules of reinforcement. The full data set may be downloaded fromwww.psychonomic.org/archive/.
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
Only very recently have Vietnamese re-searchers begun to be involved in the do-main of Natural Language Processing. As there does not exist any published work in formal linguistics or any recognizable standard for Vietnamese word categories, the fundamental works in Vietnamese text analysis such as part-of-speech tagging, parsing, etc. are very difficult tasks for computer scientists. All necessary linguistic resources have to be built from scratch, and until now almost no re-sources are shared in public research. The aim of our project is to build a common linguistic database that is freely and easily exploitable for the automatic processing of Vietnamese. In this paper, we propose an extensible set of Vietnamese syntactic descriptions that can be used for tagset definition and corpus annotation. These descriptors are established in such a way to be a reference set proposal for Vietnamese in the context of ISO subcommit-tee TC37/SC4 (Language Resource Management).