waashk/dblp huggingface dataset:
syntactic description of free word order languages. a framework for the description of syntactic structures of free word order languages is proposed, based on combination of intuitions underlying immediate constitutent description, dependency description and communicative dynamism. the combined approach is compared to its sources and shown superior in descriptive power, esp. in the area of free intermixing of (any number of) adjuncts with complements and in coordination. close resemblance to two other recent approaches is pointed out.
an evaluation semantics for datr theories. this paper describes an operational semantics for datr theories. the semantics is presented as a set of inference rules that axiomatises the evaluation relationship for datr expressions. the inference rules provide a clear picture of the way in which datr works, and should lead to a better understanding of the mathematical and computational properties of the language.
an ontology of systematic relations for a shared grammar of slavic. sharing portions of grammars across languages greatly reduces the costs of multilingual grammar engineering. related languages share a much wider range of linguistic information than typically assumed in standard multilingual grammar architectures. taking grammatical relatedness seriously, we are particularly interested in designing linguistically motivated grammatical resources for slavic languages to be used in applied and theoretical computational linguistics. in order to gain the perspective of a language-family oriented grammar design, we consider an array of systematic relations that can hold between syntactical units. while the categorisation of primitive linguistic entities tends to be language-specific or even construction-specific, the relations holding between them allow various degrees of abstraction. on the basis of slavic data, we show how a domain ontology conceptualising morpho-syntactic "building blocks" can serve as a basis of a shared grammar of slavic.
automatic text categorization by unsupervised learning. the goal of text categorization is to classify documents into a certain number of predefined categories. the previous works in this area have used a large number of labeled training documents for supervised learning. one problem is that it is difficult to create the labeled training documents. while it is easy to collect the unlabeled documents, it is not so easy to manually categorize them for creating training documents. in this paper, we propose an unsupervised learning method to overcome these difficulties. the proposed method divides the documents into sentences, and categorizes each sentence using keyword lists of each category and sentence similarity measure. and then, it uses the categorized sentences for training. the proposed method shows a similar degree of performance, compared with the traditional supervised learning methods. therefore, this method can be used in areas where low-cost text categorization is needed. it also can be used for creating training documents.
a reliable approach to automatic assessment of short answer free responses. this paper discusses an innovative approach to the computer assisted scoring of student responses in weblas (web-based language assessment system)- a language assessment system delivered entirely over the web. expected student responses are limited production free response questions.the portions of weblas with which we are concerned are the task creation and scoring modules. within the task creation module, instructors and language experts do not only provide the task input and prompt. more importantly, they interactively inform the system how and how much to score student responses. this interaction consists of weblas' natural language processing (nlp) modules searching for alternatives of the provided "gold standard" (hirschman et al, 2000) answer and asking for confirmation of score assignment. weblas processes and stores all this information within its database, to be used in the task delivery and scoring phases.
software tools for the environment of a computer aided translation system. in this paper we will present three systems, atlas, tham and visulex, which have been designed and implemented at geta (study group for machine translation) in collaboration with ifci (institut de formation et de conseil en informatique) as tools operating around the ariane-78 system. we will describe in turn the basic characteristics of each system, their possibilities, actual use, and performance.
chatr: a generic speech synthesis system. this paper describes a generic speech synthesis system called chatr which is being developed at atr. chatr is designed in a modular way so that module parameters and even which modules are actually used may be set and selected at runtime. although some interdependencies exist between modules, chatr offers a useful research tool in which functionally equivalent modules may be easily compared. it also acts as a simple system for those less interested in the internals of speech synthesis but just wish their computer to talk.
text categorization using feature projections. this paper proposes a new approach for text categorization, based on a feature projection technique. in our approach, training data are represented as the projections of training documents on each feature. the voting for a classification is processed on the basis of individual feature projections. the final classification of test documents is determined by a majority voting from the individual classifications of each feature. our empirical results show that the proposed approach, text categorization using feature projections (tcfp), outperforms k-nn, rocchio, and na&iuml;ve bayes. most of all, tcfp is about one hundred times faster than k-nn. since tcfp algorithm is very simple, its implementation and training process can be done very easily. for these reasons, tcfp can be a useful classifier in the areas, which need a fast and high-performance text categorization task.
perspectives of dbmt for monolingual authors on the basis of lidia-1, an implemented mock-up. dbmt is researched here in the context of future systems for the general public, where a monolingual author wants to translate into several languages. we have produced a complete mock-up, lidia-1, which demonstrates how a french hypercard&trade; stack could be translated into german, russian and english. we present the computational, linguistic and ergonomic aspects of the mock-up, and discuss them in the perspective of building an operational prototype in the future.
a reusable lexical database tool for machine translation. this paper describes the lexical database tool lola (linguistic-oriented lexical database approach) which has been developed for the construction and maintenance of lexicons for the machine translation system lmt. first, the requirements such a tool should meet are discussed, then lmt and the lexical information it requires, and some issues concerning vocabulary acquisition are presented. afterwards the architecture and the components of the lola system are described and it is shown how we tried to meet the requirements worked out earlier. although lola originally has been designed and implemented for the german-english lmt prototype, it aimed from the beginning at a representation of lexical data that can be reused for other lmt or mt prototypes or even other nlp applications. a special point of discussion will therefore be the adaptability of the tool and its components as well as the reusability of the lexical data stored in the database for the lexicon development for lmt or for other applications.
generating referring expressions using multiple knowledge sources. in this paper we present a brief look at some of the knowledge-based processes used in generating referring expressions in the natural language advisory system wisber. although wisber is fully capable of exploiting syntactic information to generate contextually appropriate references, the work described here concentrates on the use of conceptual and contingent knowledge about objects in the domain of discourse to generate natural-sounding references. a short description of the knowledge sources available is followed by examples of the processes that transform "deep structures" encoding system intentions into verbalizable form. finally, we discuss a number of problems of specifier selection and their solution within a knowledge-based framework.
trace & unification grammar. this paper presents trace & unification grammar (tug), a declarative and reversible grammar formalism that brings together unification grammar (ug) and ideas of government & binding theory (gb). the main part of the paper consists in a description of many free word order phenomena of german syntax. it will be shown that the use of traces allows for an easier and more elegant way of description than competing approaches like id/lp-format rules as used e.g. in gpsg and hpsg. grammars written in the tug-formalism can be compiled to a very efficient parser. the occurrence of head movement, wh-movement and scrambling in one sentence does not lead to any decrease in parsing efficiency.
a system for creating and manipulating generalized wordclass transition matrices from large labelled text-corpora. this paper deals with the training phase of a markov-type linguistic model that is based on transition probabilities between pairs and triplets of syntactic categories. to determine the optimal level of detail for a set of syntactic classes we developed a system that uses a set-theoretical formalism to define such sets and has some measures to compare and optimize them individually.in section two we describe the optimization problem (in terms of prediction, information and economy requirements) and our approach to its solution. section three introduces the system that will assist a linguist in handling the prediction and economy criteria and in the last section we present some sample results that can be achieved with it.
parsing with the shortest derivation. common wisdom has it that the bias of stochastic grammars in favor of shorter derivations of a sentence is harmful and should be redressed. we show that the common wisdom is wrong for stochastic grammars that use elementary trees instead of context-free rules, such as stochastic tree-substitution grammars used by data-oriented parsing models. for such grammars a non-probabilistic metric based on the shortest derivation outperforms a probabilistic metric on the atis and ovis corpora, while it obtains competitive results on the wall street journal (wsj) corpus. this paper also contains the first published experiments with dop on the wsj.
software support for practical grammar development. even though progress in theoretical linguistics does not necessarily rely on the construction of working programs, a large proportion of current research in syntactic theory is facilitated by suitable computational tools. however, when natural language processing applications seek to draw on the results from new developments in theories of grammar, not only the nature of the tools has to change, but they face the challenge of reconciling the seemingly contradictory requirements of notational perspicuity and efficiency of performance. in this paper, we present a comparison and an evaluation of a number of software systems for grammar development, and argue that they are inadequate as practical tools for building wide-coverage grammars. we discuss a number of factors characteristic of this task, demonstrate how they influence the design of a suitable software environment, and describe the implementation of a system which has supported efficient development of a large computational grammar of english.
the effects of analysing cohesion on document summarisation. we argue that in general, the analysis of lexical cohesion factors in a document can drive a summarizer, as well as enable other content characterization tasks. more narrowly, this paper focuses on how one particular cohesion factor--simple lexical repetition---can enhance an existing sentence extraction summarizer, by enabling strategies for overcoming some particularly jarring end-user effects in the summaries, typically due to coherence degradation, readability deterioration, and topical under-representation. lexical repetition is instrumental to, among other things, the topical make-up of a text, and in our framework a lexical repetition-based model of discourse segmentation, capable of detecting topic shifts, is integrated with a linguistically-aware summarizer utilizing notions of salience and dynamically-adjustable summary size. we show that even by leveraging lexical repetition alone, summaries are of comparable, and under certain conditions better, quality than the ones delivered by a state-of-the-art summarizer. this is encouraging for a broad research platform focusing on the recognition and use of cohesive devices in text for a range of content characterisation and document management tasks.
lexical ambiguity and the role of knowledge representation in lexicon design. the traditional framework for ambiguity resolution employs only 'static' knowledge, expressed generally as selectional restrictions or domain specific constraints, and makes no use of any specific knowledge manipulation mechanisms apart from the simple ability to match valences of structurally related words. in contrast, this paper suggests how a theory of lexical semantics making use of a knowledge representation framework offers a richer, more expressive vocabulary for lexical information. in particular, by performing specialized inference over the ways in which aspects of knowledge structures of words in context can be composed, mutually compatible and contextully relevant lexical components of words and phrases are highlighted. in the view presented here, lexical ambiguity resolution is an integral part of the same procedure that creates the semantic interpretation of a sentence itself.
creating a universal networking language module within an advanced nlp system. a multifunctional nlp environment, etap-3, is presented. the environment has several nlp applications, including a machine translation system, a natural language interface to sql type databases, synonymous paraphrasing of sentences, syntactic error correction module, and a computer-assisted language learning tool. emphasis is laid on a new module of the processor responsible for the interface with the universal networking language, a recent product by the un university intended for the facilitation of multilanguage, multiethnic access to communication networks such as www. the unl module of etap-3 naturally combines the two major approaches accepted in machine translation: the transfer-based approach and the interlingua approach.
dependency treebank for russian: concept, tools, types of information. the paper describes a tagging scheme designed for the russian treebank, and presents tools used for corpus creation.
towards personal mt: general design, dialogue structure, potential role of speech. personal mt (pmt) is a new concept in dialogue-based mt (dbmt), which we are currently studying and prototyping in the lidia project ideally, a pmt system should run on pcs and be usable by everybody. to get his/her text translated into one or several languages, the writer would accept to cooperate with the system in order to standardize and clarify his/her document. there are many interesting aspects in the design of such a system. the paper briefly presents some of them (hypertext, distributed architecture, guided language, hybrid transfer/interlingua, the goes on to study in more detail the structure of the dialogue with the writer and the place of speech synthesis [1].
present and future paradigms in the automatized translation of natural languages. useful automatized translation must be considered in a problem-solving setting, composed of a linguistic environment and a computer environment. we examine the facets of the problem which we believe to be essential, and try to give some paradigms along each of them. those facets are the linguistic strategy, the programming tools, the treatment of semantics, the computer environment and the types of implementation.
expert systems and other new techniques in mt systems. our mt systems integrate many advanced concepts from the fields of computer science, linguistics, and ai: specialized languages for linguistic programming based on production systems, complete linguistic programming environment, multilevel representations, organization of the lexicons around "lexical units", units of translation of the size of several paragraphs, possibility of using text-driven heuristic strategies.we are now beginning to integrate new techniques: unified design of an "integrated" lexical data-base containing the lexicon in "natural" and "coded" form, use of the "static grammars" formalism as a specification language, addition of expert systems equipped with "extralinguistic" or "metalinguistic" knowledge, and design of a kind of structural metaeditor (driven by a static grammar) allowing the interactive construction of a document in the same way as syntactic editors are used for developing programs. we end the paper by mentioning some projects for long-term research.
toward integrated dictionaries for m(a)t: motivations and linguistic organization. in the framework of machine (aided) translation systems, two types of lexical knowledge are used, "natural" and "formal". in the form of on-line terminological resources for human translators or revisors and of coded dictionaries for machine translation proper.a new organization is presented, which allows to integrate both types in a unique structure, called "fork" integrated dictionary, or fid. a given fid is associated with one natural language and may give access to translations into several other languages.the fids associated to languages l1 and l2 contain all information necessary to generate coded dictionaries of m(a)t systems translating from l1 into l2 or vice-versa. the skeleton of a fid may be viewed as a classical monolingual dictionary, augmented with one (or several) bilingual dictionary. each item is a tree structure, constructed by taking the "natural" information (a tree) and "grafting" onto it some "formal" information.various aspects of this design are refined and illustrated by detailed examples, several scenarii for the construction of fids are presented, and some problems of organization and implementation are discussed. a prototype implementation of the fid structure is under way in grenoble.
the "whiteboard" architecture: a way to integrate heterogeneous components of nlp systems. we present a new software architecture for nlp systems made of heterogeneous components, and demonstrate an architectural prototype we have built at atr in the context of speech translation.
theory and practice of ambiguity labelling with a view to interactive disambiguation in text and speech mt. in many contexts, automatic analyzers cannot fully disambiguate a sentence or an utterance reliably, but can produce ambiguous results containing the correct interpretation. it is useful to study vatious properties of these ambiguities in the view of subsequent total or partial interactive disambiguation. we have proposed a technique for labelling ambiguities in texts and in dialogue transcriptions, and experimented it on mulitilingual data. it has been first necessary to define formally the very notion of ambiguity relative to a representation system, as well as associated concepts such as ambiguity kernel, ambiguity scope, ambiguity occurrence.
representation trees and string-tree correspondences. the correspondence between a string of a language and its abstract representation, usually a (decorated) tree, is not straightforward. however, it is desirable to maintain it, for example to build structured editors for texts written in natural language. as such correspondences must be compositional, we call them "structured string-free correspondences" (sstc).we argue that a sstc is in fact composed of two interrelated correspondences, one between nodes and substrings, and the other between subtrees and substrings, the substrings being possibly discontinucus in both cases. we then proceed to show how to define a sstc with a structural correspondence static grammar (scsg), and which constraints to put on the rules of the scsg to get a "natural" sstc.
transformation of natural language into logical formulas. this paper presents an attempt of elaboration of a full parsing system for polish natural language which is being worked out in the institute of informatics of warsaw university. our system was adapted to the parsing of the corpus of real medical texts which concern a subdomain of medicine. we made use of the experience of such famous authors as (6), (7), (8), (9), (10), (11), (12), (13), (14).
jdii: parsing italian with a robust constraint grammar. italian is a language presenting a lot of syntactical problems, such as a rather unrestricted word order, unbounded agreement controls, long distance structure checkings and so on. things get worse and worse if we pass from "sentences of linguists" to real texts. in this paper we will present a system able to retrieve and signal syntactic errors in real italian texts.
co-ordinative ellipsis in russian texts: problem of description and restoration. russian elliptic constructions are examined from the point of view of syntactic analysis. reciprocal elements in a co-ordinative elliptic sentence are exposed and possible types of their similarity are explored. linear formulae of ellipsis for most textual cases are constructed and statistics of their use is discussed. as a result the main steps of ellipsis restoration algorithm are outlined.
countability and number in japanese to english machine translation. this paper presents a heuristic method that uses information in the japanese text along with knowledge of english countability and number stored in transfer dictionaries to determine the countability and number of english noun phrases. incorporating this method into the machine translation system alt-j/e, helped to raise the percentage of noun phrases generated with correct use of articles and number from 65% to 73%.
classifiers in japanese-to-english machine translation. this paper proposes an analysis of classifiers into four major types: unit, metric, group and species, based on properties of both japanese and english. the analysis makes possible a uniform and straightforward treatment of noun phrases headed by classifiers in japanese-to-english machine translation, and has been implemented in the mt system alt-j/e. although the analysis is based on the characteristics of, and differences between, japanese and english, it is shown to be also applicable to the unrelated language thai.
reusing an ontology to generate numeral classifiers. in this paper, we present a solution to the problem of generating japanese numeral classifiers using semantic classes from an ontology. most nouns must take a numeral classifier when they are quantified in languages such as chinese, japanese, korean, malay and thai. in order to select an appropriate classifier, we propose an algorithm which associates classifiers with semantic classes and uses inheritance to list only those classifiers which have to be listed. it generates sortal classifiers with an accuracy of 81%. we reuse the ontology provided by goi-taikei---a japanese lexicon, and show that it is a reasonable choice for this task, requiring information to be entered for less than 6% of individual nouns.
using an ontology to determine english countability. in this paper we show to what degree the countability of english nouns is predictable from their semantics. we found that at 78% of nouns' countability could be predicted using an ontology of 2,710 nodes. we also show how this predictability can be used to aid non-native speakers to determine the countability of english nouns when building a bilingual machine translation lexicon.