waashk/dblp huggingface dataset:
concept analysis and terminology: a knowledge-based approach to documentation. the central concern of terminology, a component of the general documentation process, is concept analysis, an activity which is becoming recognized as fundamental as term banks evolve into knowledge bases. we propose that concept analysis can be facilitated by knowledge engineering technology, and describe a generic knowledge acquisition tool called code (conceptually oriented design environment) that has been successfully used in two terminology applications: 1) a bilingual vocabulary project with the terminology directorate of the secretary of state of canada, and 2) a software documentation project with bell northern research. we conclude with some implications of computer-assisted concept analysis for terminology.
a parsing architecture based on distributed memory machines. the paper begins by defining a class of distributed memory machines which have useful properties as retrieval and filtering devices. these memory mechanisms store large numbers of associations on a single composite vector. they provide a natural format for encoding the syntactic and semantic constraints associated with linguistic elements. a computational architecture for parsing natural language is proposed which utilises the retrieval and associative features of these devices. the parsing mechanism is based on the principles of lexical functional grammar and the paper demonstrates how these principles can be derived from the properties of the memory mechanisms.
a new quantitative quality measure for machine translation systems. in this paper, an objective quantitative quality measure is proposed to evaluate the performance of machine translation systems. the proposed method is to compare the raw translation output of an mt system with the final revised version for the customers, and then compute the editing efforts required to convert the raw translation to the final version. in contrast to the other proposals, the evaluation process can be done quickly and automatically. hence, it can provide a quick response on any system change. a system designer can thus quickly find the advantages or faults of a particular performance dynamically. application of such a measure to improve the system performance on-line on a parameterized and feedback-controlled system will be demonstrated. furthermore, because the revised version is used directly as a reference, the performance measure can reflect the real quality gap between the system performance and customer expectation. a system designer can thus concentrate on practically important topics rather than on theoretically interesting issues.
distributed memory: a basis for chart parsing. the properties of distributed representations and memory systems are explored as a potential basis for non-deterministic parsing mechanisms. the structure of a distributed chart parsing representation is outlined. such a representation encodes both immediate-dominance and terminal projection information on a single composite memory vector. a parsing architecture is described which uses a permanent store of context-free rule patterns encoded as split composite vectors, and two interacting working memory units. these latter two units encode vectors which correspond to the active and inactive edges of an active chart parsing scheme. this type of virtual parsing mechanism is compatible with both a macro-level implementation based on standard sequential processing and a micro-level implementation using a massively parallel architecture.
a maximum entropy-based word sense disambiguation system. in this paper, a supervised learning system of word sense disambiguation is presented. it is based on conditional maximum entropy models. this system acquires the linguistic knowledge from an annotated corpus and this knowledge is represented in the form of features. several types of features have been analyzed using the senseval-2 data for the spanish lexical sample task. such analysis shows that instead of training with the same kind of information for all words, each one is more effectively learned using a different set of features. this best-feature-selection is used to build some systems based on different maximum entropy classifiers, and a voting system helped by a knowledge-based method.
unbounded dependency: tying strings to rings. this paper outlines a framework for connectionist representation based on the composition of connectionist states under vector space operators. the framwork is used to specify a level of connectionist structure defined in terms of addressable superposition space hierarchies. direct and relative address systems can be defined for such structures which use the functional components of linguistic structures as labels. unbounded dependency phenomena are shown to be related to the different properties of these labelling structures.
computational analysis of mandarin sounds with reference to the english language. in the analysis of mandarin, the author used a corpus composed of over 750,000 samples transcribed automatically from chinese characters by the computer through the sequential application of a set of phonetic rules developed by the author. the result is a classification and rank distribution of all speech sounds, the phonetic properties, frequency distribution of symbols, phonemes, syllables, tones, and their combinations. these statistical properties are compared with those of the english language.
machine translation: its history, current status, and future prospects. elements of the history, state of the art, and probable future of machine translation (mt) are discussed. the treatment is largely tutorial, based on the assumption that this audience is, for the most part, ignorant of matters pertaining to translation in general, and mt in particular. the paper covers some of the major mt r&d groups, the general techniques they employ(ed), and the roles they play(ed) in the development of the field. the conclusions concern the seeming permanence of the translation problem, and potential re-integration of mt with mainstream computational linguistics.
japanese honorifics and situation semantics. a model of japanese honorific expressions in situation semantics is proposed. situation semantics provides considerable power for analyzing the complicated structure of japanese honorific expressions. the main feature of this model is a set of basic rules for context switching in honorific sentences. mizutani's theory of japanese honorifics is presented and incorporated in the model which has been used to develope an experimental system capable of analyzing honorific context. some features of this system are described.
disambiguation of finite-state transducers. the objective of this work is to disambiguate transducers which have the following form: t = r o d and to be able to apply the determinization algorithm described in (mohri, 1997). our approach to disambiguating t = r o d consists first of computing the composition t and thereafter to disambiguate the transducer t. we will give an important consequence of this result that allows us to compose any number of transducers r with the transducer d, in contrast to the previous approach which consisted in first disambiguating transducers d and r to produce respectively d' and r', then computing t' = r' o d' where t' is unambiguous. we will present results in the case of a transducer d representing a dictionary and r representing phonological rules.
text processing of thai language "the three seals law". computer softwares for processing thai language are developed at national museum of ethnology, osaka, japan. we use a popular intelligent terminal tektronix 4051 for inputting and editing, ibm 370 model 138 for kwic making and sorting, and canon's laser beam printer for final output.using these systems, "kotmai tra sam duang" (the three seals law) which contains many kind of laws and ordinances proclaimed in thai between 1350--1805 a. d. is computerized. this text has 1700 pages and about 1400000 letters. kwic index becomes 200000 lines.some statistical data for this text are obtained. they are occurrence frequency data of single letter, group vowel, and letter combination (digram), etc.
efficiency tools in the speeches of martin luther king, jr. this thesis represents the results of a computer-aided analysis of aspects of speeches of the reverend martin luther king, jr. specifically, the analysis has investigated the occurrence of indicators of the efficiency function--tools facilitating the comprehension of a discourse by a hearer or reader--in four speeches of dr. king.contrary to the expectations of many who anticipate complex grammatical structures in the discourse of those who are speechmakers before many and diverse audiences, this study has demonstrated that the speeches of dr. king are replete with simple structural devices--sequential clauses as opposed to embedded clauses, sentences in which there are clear linkages between clauses, and clear linkages between sentences, to name a few.the analysis of the texts of dr. king was accomplished in part by a computer program which used as input a surface semantic description of a sentence as a basis for predicting the syntactic function of elements of the sentence.
parsing agglutinative word structures and its application to spelling checking for turkish. most of the research on parsing natural languages has been concerned with english, or with other languages morphologically similar to english. parsing agglutinative word structures has attracted relatively little attention most probably because agglutinative languages contain word structures of considerable complexity, and parsing words in such languages requires morphological analysis techniques. in this paper, we present the design and implementation of a morphological root-driven parser for turkish word structures which has been incorporated into a spelling checking kernel for on-line turkish text. the agglutinative nature of the language and the resulting complex word formations. various phonetic harmony rules and subtle exceptions present certain difficulties not usually encountered in the spelling checking of languages like english and make this a very challenging problem.
a bidirectional, transfer-driven machine translation system for spoken dialogues. this paper presents a brief overview of the bidirectional (japanese and english) transfer-driven machine translation system, currently being developed at atr. the aim of this development is to achieve bidirectional spoken dialogue translation using a new translation technique, tdmt, in which an example-based framework is fully utilized to translate the whole sentence. although the translation coverage is presently restricted to conference registration, the system meets requirements for spoken dialogue translation, such as two-way translation, high speed, and high accuracy with robust processing.
understanding of japanese in an interactive programming system. kips is an automatic programming system which generates standardized business application programs through interactive natural language dialogue. kips models the program under discussion and the content of the user's statements as organizations of dynamic objects in the object-oriented programming sense. this paper describes the statement-model and the program-model, their use in understanding japanese program specifications, and how they are shaped by the linguistic singularities of japanese input sentences.
optimization algorithms of deciphering as the elements of a linguistic theory. this paper presents an outline of the linguistic theory which may be identified with the partially ordered set of optimization algorithms of deciphering. an algorithm of deciphering is the operational definition of a given linguistic phenomenon which has the following three components: a set of admissible solutions, an objective function and a procedure which finds out the minimum or the maximum of the objective function.the paper contains the description of the four algorithms of the proposed type:1. the algorithms which classifies the letters into vowels and consonants.2. the algorithm which identifies the morphemes in the text without the boundaries between words.3. the algorithm which finds out the dependency tree of a sentence.4. the algorithm which finds out the mapping of the letters of an unknown language into the letters of a known one.
chinese named entity identification using class-based language model. we consider here the problem of chinese named entity (ne) identification using statistical language model(lm). in this research, word segmentation and ne identification have been integrated into a unified framework that consists of several class-based language models. we also adopt a hierarchical structure for one of the lms so that the nested entities in organization names can be identified. the evaluation on a large test set shows consistent improvements. our experiments further demonstrate the improvement after seamlessly integrating with linguistic heuristic information, cache-based model and ne abbreviation identification.
a method of utilizing domain and language specific constraints in dialogue translation. one of the characteristics of dialogue translation is that it is strongly dependent on the situation or the communicative goal where the utterance is spoken. moreover, the distance between the language pair is great, the possibilities of the transfer diverse and it would be difficult to guarantee the equivalence of translation.in this article, we propose a method of utilizing domain and language specific constraints from the view-point of transfer phase in a dialogue translation system. transfer processing sometimes requires various kinds of information: e.g., domain knowledge for ellipsis resolution, language dependent communicative structures(focus, theme, rheme, ...).our standpoint is that there are certain language specific strategies on producing utterances in communication. as steps towards clarifying those strategies, we first discuss the issue of typical idiosyncratic gaps between two language pairs. next, to resolve such problems we suggest a new framework of incorporating domain and language specific knowledge as transfer rules for dialogue translation from the viewpoint of transfer phase. finally we will mention related issues and further investigation.
using a broad-coverage parser for word-breaking in japanese. we describe a method of word segmentation in japanese in which a broad-coverage parser selects the best word sequence while producing a syntactic analysis. this technique is substantially different from traditional statistics- or heuristics-based models which attempt to select the best word sequence before handing it to the syntactic component. by breaking up the task of finding the best word sequence into the identification of words (in the word-breaking component) and the selection of the best sequence (a by-product of parsing), we have been able to simplify the task of each component and achieve high accuracy over a wide variety of data. word-breaking accuracy of our system is currently around 97-98%.
topic tracking using subject templates and clustering positive training instances. topic tracking, which starts from a few sample stories and finds all subsequent stories that discuss the same topic, is a new challenge for the text categorization task and is useful for timeline-based ir systems. much previous research on topic tracking use machine learning techniques. however, the small size of the training data, especially positive training stories, presents difficulties in training the parameters of the topic tracking system to produce optimal results. in this paper, we present a method for topic tracking using subject templates and <u>k</u>-means clustering algorithm to select a suitable training set. the method was tested on the tdt1 corpus, and the result shows the effectiveness of the method.
svm answer selection for open-domain question answering. this paper presents an answer selection method based on support vector machines (svm) for open-domain question answering (qa). selecting and ranking plausible answers from a large number of candidates in documents is one of the most critical parts of qa systems. it is extremely difficult to find good evaluation functions or rules for the answer selection. to overcome this issue, we apply svm to answer selection. we evaluate the performance measured by mean reciprocal rank (mrr) and the correct ratio of answer ranked first. the results show that the proposed svm-based method offers a statistically significant increase in performance compared to other machine learning methods such as decision tree learning (c4.5) boosting with decision tree learning (c5.0), and the maximum entropy method.
computer-aided grammatical tagging of spoken english. the paper presents an outline of a system for grammatical tagging of the london-lund corpus of spoken english consisting of some 450 000 words. the material, all of which will be available on magnetic computer tape, and part of which is now available in both machine-readable and printed form, has been transcribed orthographically with prosodic marking for tone units, nuclei, stresses, pauses, etc (see samples 1 and 2). whereas there is now considerable agreement on the usefulness of a tagged corpus, there is as yet no consensus on the best type of tagging, let alone the procedure involved. the analysis proposed here is of course specifically aimed at tagging spoken english, but should be largely applicable also to written english.
centering in japanese: a step towards better interpretation of pronouns and zero-pronouns. an extension of the notion of "centering" is desribed for interpreting zero pronouns and overt pronouns in naturally occurring japanese text. in previous work, one zero-pronoun encodes the backward-looking center, with pronouns and other zero-pronouns handled as if they were overtly expressed. an investigation is made, and from it pronouns and zero pronouns are concluded to be more salient than other overt noun phrases. this enables better interpretation of pronouns and zero-pronouns.
processing homonyms in the kana-to-kanji conversion. this paper proposes two new methods to identify the correct meaning of japanese homonyms in text based on the noun-verb co-occurrence in a sentence which can be obtained easily from corpora. the first method uses the near co-occurrence data sets, which are constructed from the above co-occurrence relation, to select the most feasible word among homonyms in the scope of a sentence. the second uses the far co-occurrence data sets, which are constructed dynamically from the near co-occurrence data sets in the course of processing input sentences, to select the most feasible word among homonyms in the scope of a sequence of sentences. an experiment of kana-to-kanji (phonogram-to-ideograph) conversion has shown that the conversion is carried out at the accuracy rate of 79.6% per word by the first method. this accuracy rate of our method is 7.4% higher than that of the ordinary method based on the word occurrence frequency.
portable knowledge sources for machine translation. in this paper, we describe the acquisition and organization of knowledge sources for machine translation (mt) systems. it has been pointed out by many users that one of the most annoying things about mt systems is the repeated occurrence of identical errors in word sense and attachment disambignuation. we show the limitations of a conventional user-dictionary method and explain how our approach solves the problem.
pattern-based machine translation. in this paper, we describe a "pattern-based" machine translation (mt) approach that we followed in designing a personal tool for users who have access to large volumes of text in languages other than their own, such as www pages. some of the critical issues involved in the design of such a tool include easy customization for diverse domains, the efficiency of the translation algorithm, and scalability (incremental improvement in translation quality through user interaction). we also describe how our patterns fit into the context-free parsing and generation algoritluns, and how we implemented a prototype tool.
critac - a japanese text proofreading system. critac (critiquing using a ccumulated knowledge) is an experimental expert system for proofreading japenese text. it detects mistypes, kana-to-kanji misconversions, and stylistic errors. this system combines prolog-coded heuristic knowledge with conventional japanese text processing techniques which involve heavy computation and access to large language databases.
recognizing topics through the use of interaction structures. a crucial problem in topic recognition is how to identify topic continuation. domain knowledge is generally indispensable for this. however, knowledge-based approaches are impractical because not all domain knowledge needed for the identification can be prepared in advance.this paper presents a topic recognition model using dialogue interaction structures. the model can deal with both task-oriented and non-task-orinted dialogues in any language. topic continuation is identified without domain knowledge because utterances of relevant topics are indicated by certain interaction structures. the model avoids the weak point of knowledge-based approaches. the model is validated by the result of a topic recognition experiment.
entering text with a four-button device. this paper presents the design of a text-entry device that requires only four buttons. such a device is applicable as the text interface of portable machines and as an interface for disabled people. the text-entry system is predictive; the basis for this is an adaptive language model. our evaluation showed that the system is at least as efficient for the entry of free text as the text-entry systems of current-generation mobile phones. the system requires fewer keystrokes than a full keyboard. after adaptation, one user reached a maximum speed of 23 wpm.
measuring the similarity between compound nouns in different languages using non-parallel corpora. this paper presents a method that measures the similarity between compound nouns in different languages to locate translation equivalents from corpora. the method uses information from unrelated corpora in different languages that do not have to be parallel. this means that many corpora can be used. the method compares the contexts of target compound nouns and translation candidates in the word or semantic attribute level. in this paper, we show how this measuring method can be applied to select the best english translation candidate for japanese compound nouns in more than 70% of the cases.
unit-to-unit interaction as a basis for semantic interpretation of japanese sentences. the notion of unit-to-unit interaction is introduced to analyse dependency relations between words in a sentence. a unit is a basic framework for concept representation and is composed of many slots. after generating a parsed tree from an input sentence, our semantic interpretation begins traversing the tree from right to left to discern the case frame in a stage as early as possible, since japanese is a language in which verb is in the sentence-final and has a case frame. unit-to-unit interaction, which is performed at each node of the parsed tree, follows a bottom-up progression. there are unit descriptions at terminal (bottom) nodes and the unit descriptions are modified or merged into other units in the course of the interaction. the results of the interaction will be transferred to upper nodes. the interaction process continues on upward until the top node; at this point, the semantic structure of the input sentence is finally obtained. the notion of unit-to-unit interaction is feasibly applicable to semantic interpretation of english.