waashk/dblp huggingface dataset:
a software environment for developing natural language understanding system. this paper deals with a software environment for developing the natural language understanding system. the system called multi-layered software environment (mlse) is proposed for providing a designer of a language understanding system with wide varieties of design alternatives in software components which derive from computational linguistics. the mlse is a collection of module packages for building the tools for language understanding system. that is, by integrating the computational linguistics methods into the mlse scheme, we have emphasized the layered approach to build the software environment as the basis for developing the language understanding system. in order to illustrate the strategy of the mlse scheme, we have discussed the case study for designing question and answering system. based upon this case study, we have developed a new language understanding system called japanese q & a system (jqas) which was a product of the mise scheme. the mlse has implemented in variety of lisps such as inter-lisp on dec-20 and lisp f3 on ibm370.the jqas has domain specific q & a system for computer documentation and explanation system.
an approach to a semantic analysis of metaphor. the present study deals with conflict resolution process in metaphorical interpretation for the noun phrase. in order to make the problem more explicit, we have reviewed the knowledge representation with conflict both from cognitive psychology and artificial intelligence. then, we propose a semantic model which is optained from the notion of linguistics as chemistry. that is, the model called "semistry" is introduced so as to interprete a metaphor semantic bonds between nouns. by using production system couped with contex free parser (elingol), the working system called meta-sim is constructed to analyze the noun phrase metaphor. finally, there are discussions on a role of metaphor in human cognitive processing.
integrating shallow linguistic processing into a unification-based spanish grammar. this paper describes to what extent deep processing may benefit from shallow processing techniques and it presents a nlp system which integrates a linguistic pos tagger and chunker as a preprocessing module of a broad-coverage unification-based grammar of spanish. experiments show that the efficiency of the overall analysis improves significantly and that our system also provides robustness to the linguistic processing, while maintaining both the accuracy and the precision of the grammar.
the jarap experimental system of japanese-russian automatic translation. the paper is the first report on the experimental mt system developed as part of the japanese-russian automatic translation project (jarap). the system follows the transfer approach to mt. limited so far to lexico-morphological processing, it is seen as a foundation for more ambitions linguistic research. the system is implemented on ibm pc, ms dos, in arity prolog (analysis and transfer) and turbo pascal (synthesis).
a process-activation based parsing algorithm for the development of natural language grammars. a running system, named sail, for the development of natural language grammars is described. stress is put on the particular grammar rule model adopted, named complex grammar units, and on the parsing algorithm that runs rules written in according to this model. moreover, the parser is like a processor and sees grammar rules as processes which can be activated or inactivated, and can handle exchange of information, structured as messages, among rules for long distance analysis. a brief description of the framework of sail a user can interact with, named sis, is also given. finally, an example shows that different grammar formalisms can be implemented into the frame of sail.
lexical chains for question answering. the paper presents a method for finding topically related words on an extended wordnet. by exploiting the information in the wordnet glosses, the connectivity between the synsets is dramatically increased. topical relations expressed as lexical chains on extended wordnet improve the performance of a question answering system by increasing the document retrieval recall and by providing the much needed axioms that link question keywords with answers.
a computational analysis of complex noun phrases in navy messages. methods of text compression in navy messages are not limited to sentence fragments and the omissions of function words such as the copula be. text compression is also exhibited within "grammatical" sentences and is identified within noun phrases in navy messages. mechanisms of text compression include increased frequency of complex noun sequences and also increased usage of nominalizations. semantic relationships among elements of a complex noun sequence can be used to derive a correct bracketing of syntactic constructions.
control structures for actions in procedural texts and pt-chart. this paper describes a partial taxonomy of control structures for actions in procedural texts. on the basis of the taxonomy, we examine natural language expressions for control structures in japanese procedural texts and present pt (<u>p</u>rocedural <u>t</u>ext) -chart which represents the structure of a procedural text.
analysis and processing of compact text. this paper describes the characteristics of compact text as revealed in computer analysis of a set of physician notes. computer processing of the documents was performed using the lsp system for natural language analysis. a numerical breakdown of syntactic and semantic patterns found in the texts is presented. it is found that four major properties of compact text make it possible to process the content of the documents with syntactic procedures that operate on full free text.
representation and recognition method for multi-word translation units in korean-to-japanese mt system. due to grammatical similarities, even a one-to-one mapping between korean and japanese words (or morphemes) can usually result in a high quality korean-to-japanese machine translation. however, multi-word translation units (mwtu) such as idioms, compound words, etc., need an n-to-m mapping, and their component words often do not appear adjacently, resulting in a discontinuous mwtu. during translation, the mwtu should be treated as one lexical item rather than a phrase. in this paper, we define the types of mwtus and propose their representation and recognition method depending on their characteristics in korean-to-japanese mt system. in an experimental evaluation, the proposed method turned out to be very effective in handling mwtus, showing an average recognition accuracy of 98.4% and a fast recognition time.
representing regularities in the metaphoric lexicon. this paper describes a system for representing knowledge about conventional metaphors for use by natural language analysis, generation and acquisition systems. a system of hierarchically related structured associations is used. these associations are implemented as a part of the kodiak representation language. particular attention is paid in this paper to representational mechanisms that can capture generalizations over the system of conventional metaphors as a whole.
resolving syntactic ambiguities with lexico-semantic patterns: an analogy-based approach. a system for the resolution of syntactic ambiguities is illustrated which operates on morpho-syntactically ambiguous subject-object assignments in italian and tries to find the most likely analysis on the basis of the evidence contained in a knowledge base of linguistic data automatically extracted from on-line resources. the system works on the basis of a set of straighforward analogy-based principles. its performance on a substantial corpus of test data extracted from real texts is described.
syntactic features for high precision word sense disambiguation. this paper explores the contribution of a broad range of syntactic features to wsd: grammatical relations coded as the presence of adjuncts/arguments in isolation or as subcategorization frames, and instantiated grammatical relations between words. we have tested the performance of syntactic features using two different ml algorithms (decision lists and adaboost) on the senseval-2 data. adding syntactic features to a basic set of traditional features improves performance, especially for adaboost. in addition, several methods to build arbitrarily high accuracy wsd systems are also tried, showing that syntactic features allow for a precision of 86% and a coverage of 26% or 95% precision and 8% coverage.
the generation of high-level structure for extended explanations. this paper analyzes the structural features of naturally-occurring extended explanations and argues that current generation methodologies are inadequate for determining high-level structure. it presents a computational model based on the hypothesis that high-level structure - composed of a unifying framework and its associated basic blocks - can be determined by bottom-up processes that attempt to satisfy speaker, listener, and compositional goals, after which top-down strategies can be used to organize the material about the selected framework.
universal guides and finiteness and symmetry of grammar processing algorithms. this paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to characterize formal criteria for termination in a derivation process. the notion of universal guides also offers a new framework in which both parsing and generation can be viewed merely as two different instances of the same generic process: guide consumption. this technique generalizes and exemplifies a new and original use of an existing concept of "proper guides" recently proposed in literature for controlling top-down left-to-right (tdlr) exccution in logic programs. we show that universal guides are independent of a particular grammar evaluation strategy. also, unlike proper guides they can be specified in the same manner for any given algorithm without knowing in advance whether the algorithm is a parsing or a generation algorithm. their introduction into a grammar prevents as well the occurrence of certain grammar rules an infinite number of times during a derivation process.
chart parsing and constraint programming. in this paper, parsing-as-deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based chart parsers. following the proposal in shieber et al. (1995), we show how to directly realize the inference rules for deductive parsers as constraint handling rules (fr&uuml;hwirth, 1998) by viewing the items of a chart parser as constraints and the constraint base as a chart. this allows the direct use of constraint resolution to parse sentences.
information gain ratio as term weight: the case of summarization of ir results. this paper proposes a new term weighting method for summarizing documents retrieved by ir system. unlike query-biased summarization, our method utilizes not the information of query, but the similarity information among original documents by hierarchical clustering. to map the similarity structure of the clusters into the weight of each word, we adopt the information gain ratio of probabilistic distribution of each word as term weight.
jaunt: a constraint solver for disjunctive feature structures. to represent a combinatorial number of ambiguous interpretations of a natural language sentence efficiently, a "packed" or "factorized" representation is necessary. we propose a representation that comprises a set of explicit value disjunctions and constraints imposed on them. new constraints are successively added for disambiguation, during which local consistencies are maintained by an underlying mechanism. we have developed a constraint solver called jaunt that embodies this idea. the latest technques, including constraint propagation and forward checking, are employed as constraint satisfaction mechanisms. jaunt also allows an external meta-inference program to intervene in the constraint satisfaction process in order to control the application of the constraints.
a stochastic parser based on an slm with arboreal context trees. in this paper, we present a parser based on a stochastic structured language model (slm) with a flexible history reference mechanism. an slm is an alternative to an n-gram model as a language model for a speech recognizer. the advantage of an slm against an n-gram model is the ability to return the structure of a given sentence. thus slms are expected to play an important part in spoken language understanding systems. the current slms refer to a fixed part of the history for prediction just like an n-gram model. we introduce a flexible history reference mechanism called an act (arboreal context tree; an extension of the context tree to tree-shaped histories) and describe a parser based on an slm with acts. in the experiment, we built an slm-based parser with a fixed history and one with acts, and compared their parsing accuracies. the accuracy of our parser was 92.8%, which was higher than that for the parser with the fixed history (89.8%). this result shows that the flexible history reference mechanism improves the parsing ability of an slm, which has great importance for language understanding.
multiple discourse relations on the sentential level in japanese. in the spoken language machine translation project verbmobil, the semantic formalism language for underspecified discourse representation structures (lud) is used. lud describes a number of drss and allows for underspecification of scopal ambiguities. dealing with japanese-to-english translation besides german-to-english poses challenging problems. in this paper, a treatment of multiple discourse relation constructions on the sentential level is discussed. these are common in japanese but cause a problem for the formalism. it is shown that the underspecification is to be represented for them, too. additionally, it is possible to state a semantic constraint on the resolution of multiple discourse relations which seems to prevail over the syntactic c-command constraint.
a bootstrapping method for extracting bilingual text pairs. this paper proposes a method for extracting bilingual text pairs from a comparable corpus. the basic idea of the method is to apply bootstrapping to an existing corpus-based cross-language information retrieval (clir) approach. we conducted preliminary tests with english and japanese bilingual corpora. the bootstrapping method led to much better results for the task of extracting translation pairs compared with a corpus-based clir method without boot-strapping, and the extracted translation pairs could be useful training data for improving results of the corpus-based clir method.
zero pronouns and conditionals in japanese instruction manuals. this paper proposes a method of the zero pronoun resolution, which is one of the essential processes in understanding systems for japanese manual sentences. it is based on pragmatic properties of japanese conditionals. we examined a number of sentences appearing in japanese manuals according to the classification based on the types of agent and the types of verb phrase. as a result, we obtained the following pattern of usage in matrix clauses: 1) the connective particles to and reba have the same distribution of usage. tara and nara have the same distribution of usage. 2) the distribution of usage of to and reba, and that of tara and nara are complementary to each other. we show that these distributions of usage can be used for resolution of zero subjects.
word extraction from corpora and its part-of-speech estimation using distributional analysis. unknown words are inevitable at any step of analysis in natural language processing. we propose a method to extract words from a corpus and estimate the probability that each word belongs to given parts of speech (poss), using a distributional analysis. our experiments have shown that this method is effective for inferring the pos of unknown words.
a stochastic parser based on a structural word prediction model. in this paper, we present a stochastic language model using dependency. this model considers a sentence as a word sequence and predicts each word from left to right. the history at each step of prediction is a sequence of partial parse trees covering the preceding words. first our model predicts the partial parse trees which have a dependency relation with the next word among them and then predicts the next word from only the trees which have a dependency relation with the next word. our model is a generative stochastic model, thus this can be used not only as a parser but also as a language model of a speech recognizer. in our experiment, we prepared about 1,000 syntactically annotated japanese sentences extracted from a financial newspaper and estimated the parameters of our model. we built a parser based on our model and tested it on approximately 100 sentences of the same newspaper. the accuracy of the dependency relation was 89.9%, the highest accuracy level obtained by japanese stochastic parsers.
an hpsg-based generator for german an experiment in the reusability of linguistic resources. we describe the development of a generator for german built by reusing and adapting existing linguistic data and software. reusability is crucial for the successful application of nlp techniques to real-life problems since it helps to cut down on both development and adaptation effort. however, combining resources not designed to work together is not trivial. we describe the problems arising when integrating three preexisting resources (fuf, a unification-based generator, an hpsg grammar for german, and x2morf, a two-level morphology component) and the adaptations necessary to come up with a wide coverage tactical generator for german.
automatic detection of omissions in translations. adomit is an algorithm for automatic detection of omissions in translations. the algorithm relics solely on geometric analysis of bitext maps and uses no linguistic information. this property allows it to deal equally well with omissions that do not correspond to linguistic units, such as might result from word-processing mishaps. adomit has proven itself by discovering many errors in a hand-constructed gold standard for evaluating bitext mapping algorithms. quantitative evaluation on simulated omissions showed that, even with today's poor bitext mapping technology, adomit is a valuable quality control tool for translators and translation bureaus.
a computational model for generating referring expressions in a multilingual application domain. in this paper we analyse the problem of generating referring expressions in a multilingual generation system that produces instructions on how to fill out pension forms. the model we propose is an implementation of theoretical investigations of martin and is based on a clear representation of the knowledge sources and choices that contribute to the identification of the most appropriate linguistic expressions. to cope effectively with pronominalization we propose to augment the centering model with mechanisms exploiting the discourse structure. at every stage of the referring expressions generation process issues raised by multilinguality are considered and dealt with by means of rules customized with respect to the output language.
example-based speech intention understanding and its application to in-car spoken dialogue system. this paper proposes a method of speech intention understanding based on dialogue examples. the method uses a spoken dialogue corpus with intention tags to regard the intention of each input utterance as that of the sentence to which it is the most similar in the corpus. the degree of similarity is calculated according to the degree of correspondence in morphemes and dependencies between sentences, and it is weighted by the dialogue context information. an experiment on inference of utterance intentions using a large-scale in-car spoken dialogue corpus of ciair has shown 68.9% accuracy. furthermore, we have developed a prototype system of in-car spoken dialogue processing for a restaurant retrieval task based on our method, and confirmed the feasiblity of the system.
multi-level translation aids in a distributed system. at coling80, we reported on an interactive translation system called its. we will discuss three problems in the design of the first version of its: (1) human factors, (2) the "all or nothing" syndrome, and (3) traditional centralized processing. we will also discuss a new version of its, which is now being programmed. this new version will hopefully overcome these problems by placing the translator in control, providing multiple levels of aid, and distributing the processing.
word sense disambiguation using static and dynamic sense vectors. it is popular in wsd to use contextual information in training sense tagged data. co-occurring words within a limited window-sized context support one sense among the semantically ambiguous ones of the word. this paper reports on word sense disambiguation of english words using static and dynamic sense vectors. first, context vectors are constructed using contextual words in the training sense tagged data. then, the words in the context vector are weighted with local density. using the whole training sense tagged data, each sense of a target word is represented as a static sense vector in word space, which is the centroid of the context vectors. then contextual noise is removed using a automatic selective sampling. a automatic selective sampling method use information retrieval technique, so as to enhance the discriminative power. in each test case, a automatic selective sampling method retrieves n relevant training samples to reduce noise. using them, we construct another sense vectors for each sense of the target word. they are called dynamic sense vectors because they are changed according to a target word and its context. finally, a word sense of a target word is determined using static and dynamic sense vectors. the english senseval test suit is used for this experimentation and our method produces relatively good results.
stochastic dependency parsing of spontaneous japanese spoken language. this paper describes the characteristic features of dependency structures of japanese spoken language by investigating a spoken dialogue corpus, and proposes a stochastic approach to dependency parsing. the method can robustly cope with inversion phenomena and bunsetsus which don't have the head bunsetsu by relaxing the syntactic dependency constraints. the method acquires in advance the probabilities of dependencies from a spoken dialogue corpus tagged with dependency structures, and provides the most plausible dependency structure for each utterance on the basis of the probabilities. an experiment on dependency parsing for driver's utterances in ciair in-car spoken dialogue corpus has been made. the experimental result has shown our method to be effective for robust parsing of spoken language.
yet another paper about partial verb phrase fronting in german. i describe a very simple hpsg analysis for partial verb phrase fronting. i will argue that the presented account is more adequate than others made during the past years because it allows the description of constituents in fronted positions with their modifier remaining in the nonzfronted part of the sentence.a problem with ill-formed signs that are admitted by all hpsg accounts for partial verb phrase fronting known so far will be explained and a solution will be suggested that uses the difference between combinatoric relations of signs and their representation in word order domains.