waashk/dblp huggingface dataset:
designing illustrated texts: how language production is influenced by graphics generation. multimodal interfaces combining, e.g., natural language and graphics take advantage of both the individual strength of each communication mode and the fact that several modes can be employed in parallel, e.g., in the text-picture combinations of illustrated documents. it is an important goal of this research not simply to merge the verbalization results of a natural language generator and the visualization results of a knowledge-based graphics generator, but to carefully coordinate graphics and text in such a way that they complement each other. we describe the architecture of the knowledge-based presentation system wip which guarantees a design process with a large degree of freedom that can be used to tailor the presentation to suit the specific context. in wip, decisions of the language generator may influence graphics generation and graphical constraints may sometimes force decisions in the language production process. in this paper, we focus on the influence of graphical constraints on text generation. in particular, we describe the generation of cross-modal references, the revision of text due to graphical constraints and the clarification of graphics through text.
classical logics for attribute-value languages. this paper describes a classical logic for attribute-value (or feature description) languages which are used in unification grammar to describe a certain kind of linguistic object commonly called attribute-value structure (or feature structure). the algorithm which is used for deciding satisfiability of a feature description is based on a restricted deductive closure construction for sets of literals (atomic formulas and negated atomic formulas). in contrast to the kasper/rounds approach (cf. [kasper/rounds 90]), we can handle cyclicity, without the need for the introduction of complexity norms, as in [johnson 88] and [beierle/pletat 88]. the deductive closure construction is the direct proof-theoretic correlate of the congruence closure algorithm (cf. [nelson/oppen 80]), if it were used in attribute-value languages for testing satisfiability of finite sets of literals.
it would be much easier if went were goed. the paper proposes a paradigmatic approach to morphological knowledge acquisition. it addresses the problem of learning from examples rules for word-forms analysis and synthesis. these rules, established by generalizing the training data sets, are effectively used by a built-in interpreter which acts consequently as a morphological processor within the architecture of a natural language question-answering system. the paradigm system has no a prior knowledge which should restrict it to a particular natural language, but instead builds up the morphological rules based only on the examples provided, be they in romanian, english, french, russian, slovak and the like.
programming in logic with constraints for natural language processing. in this paper, we present a logic-based computational model for movement theory in government and binding theory. for that purpose, we have designed a language called dislog. dislog stands for programming in logic with discontinuities and permits to express in a simple, concise and declarative way relations or constraints between non-contiguous elements in a structure. dislog is also weel adapted to model other types of linguistic phenomena like quantifier raising involving long-distance relations or constraints.
processing language with logical types and active constraints. in this document, we present a language which associates type construction principles to constraint logic programming. we show that it is very appropriate for language processing, providing more uniform, expressive and efficient tools and treatments. we introduce three kinds of constraints, that we exemplify by motivational examples. finally, we give the procedural semantics of our language, combining type construction with sld-resolution.
some remarks on the decidability of the generation problem in lfg- and patr-style unification grammars. in this paper, we prove the decidability of the generation problem for those unification grammars which are based on context-free phrase structure rule skeletons, like e.g. lfg and patr-ii. the result shows a perhaps unexpected asymmetry, since it is valid also for those unification grammars whose parsing problem is undecidable, e.g. grammars which do not satisfy the off-line parsability constraint. the general proof is achieved by showing that the space of the derivations which have to be considered in order to decide the problem for a given input is always restricted to derivations whose length is limited by some fixed upper bound which is determined relative to the "size" of the input.
on the representation of query term relations by soft boolean operators. the language analysis component in most text retrieval systems is confined to a recognition of noun phrases of the type normally included in back-of-the-book indexes, and an identification of related terms included in a preconstructed thesaurus of quasi-synonyms. even such a restricted language analysis is fraught with difficulties because of the well-known problems in the analysis of compound nominals, and the hazards and cost of constructing word synonym classes valid for large text samples.in this study an extended (soft) boolean logic is used for the formulation of information retrieval queries which is capable of representing both the use of compound noun phrases as well as the inclusion of synonym constructions in the query statements. the operations of the extended boolean logic are described, and evaluation output is included to demonstrate the effectiveness of the extended logic compared with that of ordinary text retrieval systems.
type-driven semantic interpretation of f-structures. the formal architecture of lexical functional grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a language and representations of their underlying meanings. this approach works well when the structural discrepancies between form and meaning representations are finitely bounded, but there are some phenomena in natural language, e.g. adverbs in english, where this restriction does not hold. in this paper, we describe rule-based type-driven interpretation algorithms which cover cases of such a structural misalignment by exploiting a new descriptive device, the "restriction operator". the algorithms are set up in such a way that recursive rules can be derived for the interpretation of adjunct sets within a codescription approach (see [kaplan and wedekind, 1993] for details).
fallible rationalism and machine translation. approaches to mt have been heavily influenced by changing trends in the philosophy of language and mind. because of the artificial hiatus which followed the publication of the alpac report, mt research in the 1970s and early 1980s has had to catch up with major developments that have occurred in linguistic and philosophical thinking; currently, mt seems to be uncritically loyal to a paradigm of thought about language which is rapidly losing most of its adherents in departments of linguistics and philosophy. i argue, both in theoretical terms and by reference to empirical research on a particular translation problem, that the popperian "fallible rationalist" view of mental processes which is winning acceptance as a more sophisticated alternative to chomskyan "deterministic rationalism" should lead mt researchers to redefine their goals and to adopt certain currently-neglected techniques in trying to achieve those goals.
design and implementation of a lexical data base. this paper is concerned with the specifications and the implementation of a particular concept of word-based lexicon to be used for large natural language processing systems such as machine translation systems, and compares it with the morpheme-based conception of the lexicon traditionally assumed in computational linguistics.it will be argued that, although less concise, a relational word-based lexicon is superior to a morpheme-based lexicon from a theoretical, computational and also practical viewpoint.
representing text chunks. dividing sentences in chunks of words is a useful preprocessing step for parsing, information extraction and information retrieval. (ramshaw and marcus, 1995) have introduced a "convenient" data representation for chunking by converting it to a tagging task. in this paper we will examine seven different data representations for the problem of recognizing noun phrase chunks. we will show that the the data representation choice has a minor influence on chunking performance. however, equipped with the most suitable data representation, our memory-based learning chunker was able to improve the best published chunking results for a standard data set.
lexicalising word order constraints for implemented linearisation grammar. this paper presents a way in which a lexicalised hpsg grammar can handle word order constraints in a computational parsing system, without invoking an additional layer of representation for word order, such as reape's word order domain. the key proposal is to incorporate into lexical heads the woc (word order constraints) feature, which is used to constrain the word order of its projection. we also overview our parsing algorithm.
what sort of trees do we speak? a computational model of the syntax-prosody interface in tokyo japanese. what is the relationship between syntax, prosody and phonetics? this paper argues for a declarative constraint-based theory, in which each step in a derivation adds diverse constraints to a pool. some of these describe well formed objects in the feature structure domain, in terms of both syntactic and prosodic features. some characterise the relative prominence of constituents as a partial order over some discrete domain (playing the role of metrical grid). some are simultaneous equations in the reals, whose solutions represent the pitch level of phonetic objects --- high and low tones. the elements of such a theory are illustrated with a treatment of prosodic phrasing and tone scaling in tokyo japanese, and the theory is compared to selkirk and tateishi's analysis based on the strict layer hypothesis.
parsing the wall street journal with the inside-outside algorithm. we report grammar inference experiments on partially parsed sentences taken from the wall street journal corpus using the inside-outside algorithm for stochastic context-free grammars. the initial grammar for the inference process makes no assumption of the kinds of structures and their distributions. the inferred grammar is evaluated by its predicting power and by comparing the bracketing of held out sentences imposed by the inferred grammar with the partial bracketings of these sentences given in the corpus. using part-of-speech tags as the only source of lexical information, high bracketing accuracy is achieved even with a small subset of the available training material (1045 sentences): 94.4% for test sentences shorter than 10 words and 90.2% for sentences shorter than 15 words.
bayesian network, a model for nlp? the nlp systems often have low performances because they rely on unreliable and heterogeneous knowledge. we show on the task of non-anaphoric it identification how to overcome these handicaps with the bayesian network (bn) formalism. the first results are very encouraging compared with the state-of-the-art systems.
rule-based lexical modelling of foreign-accented pronunciation variants. this paper describes a novel approach to generate potential foreign-accented phonetic transcriptions using phonological rewrite rules. for each pair of a native language (l1) and a target language (l2), a set of postlexical rules is designed to transform canonical phonetic dictionaries of l2 into adapted dictionaries for native l1 speakers. some general considerations on the design of such a rule-based system are presented.
delimitedness and trajectory-of-motion events. the first part of the paper develops a novel, sortally-based approach to the problem of aspectual composition. the account is argued to be superior on both empirical and computational grounds to previous semantic approaches relying on referential homogeneity tests. while the account is restricted to manner-of-motion verbs, it does cover their interaction with mass terms, amount phrases, locative pps, and distance, frequency, and temporal modifiers. the second part of the paper describes an implemented system based on the theoretical treatment which determines whether a specified sequence of events is or is not possible under varying situationally supplied contraints, given certain restrictive and simplifying assumptions. briefly, the system extracts a set of contraint equations from the derived logical forms and solves them according to a best-value metric. three particular limitations of the system and possible ways of addressing them are discussed in the conclusion.
a cascaded finite-state parser for german. the paper presents two approaches to partial parsing of german: a tagger trained on dependency tuples, and a cascaded finite-state parser (abney, 1997). for the tagging approach, the effects of choosing different representations of dependency tuples are investigated. performance of the finite-state parser is boosted by delaying syntactically unsolvable disambiguation problems via underspecification. both approaches are evaluated on a 340,000-token corpus.
user studies and the design of natural language systems. this paper presents a critical discussion of the various approaches that have been used in the evaluation of natural language systems. we conclude that previous approaches have neglected to evaluate systems in the context of their use, e.g. solving a task requiring data retrieval. this raises questions about the validity of such approaches. in the second half of the paper, we report a laboratory study using the wizard of oz technique to identify nl requirements for carrying out this task. we evaluate the demands that task dialogues collected using this technique, place upon a prototype natural language system. we identify three important requirements which arose from the task that we gave our subjects: operators specific to the task of database access, complex contextual reference and reference to the structure of the information source. we discuss how these might be satisfied by future natural language systems.
right attachment and preference semantics. the paper claims that the right attachment rules for phrases originally suggested by frazier and fodor are wrong, and that none of the subsequent patchings of the rules by syntactic methods have improved the situation. for each rule there are perfectly straightforward and indefinitely large classes of simple counter-examples. we then examine suggestions by ford et al., schubert and hirst which are quasi-semantic in nature and which we consider ingenious but unsatisfactory. we point towards a straightforward solution within the framework of preference semantics, set out in detail elsewhere, and argue that the principal issue is not the type and nature of information required to get appropriate phrase attachments, but the issue of where to store the information and with what processes to apply it.
distributional part-of-speech tagging. this paper presents an algorithm for tagging words whose part-of-speech properties are unknown. unlike previous work, the algorithm categorizes word tokens in context instead of word types. the algorithm is evaluated on the brown corpus.
a comparison of rule-invocation strategies in context-free chart parsing. currently several grammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a back-bone, e.g. lfg and patr-ii. typically the processing of these formalisms is organized within a chart-parsing framework. the declarative character of the formalisms makes it important to decide upon an overall optimal control strategy on the part of the processor. in particular, this brings the rule-invocation strategy into critical focus: to gain maximal processing efficiency, one has to determine the best way of putting the rules to use. the aim of this paper is to provide a survey and a practical comparison of fundamental rule-invocation strategies within context-free chart parsing.
natural and simulated pointing. referent identification in human conversation is performed both by describing the objects in question and by pointing at them. up till now, only the linguistic component could be simulated in dialog systems. but recently, technical innovations have made it possible to 'point' at the objects on a display as well.the paper has two intentions. first, it investigates natural pointing in more detail and offers some possibilities to classify the great variety of pointing actions. then, it tries to clarify the extent to which pointing by technical means (especially mouse-clicks) can be regarded as a simulation of natural pointing or as a functional equivalent. furthermore, some steps towards even more accurate simulation are briefly mentioned.
interactive incremental chart parsing. this paper presents an algorithm for incremental chart parsing, outlines how this could be embedded in an interactive parsing system, and discusses why this might be useful. incremental parsing here means that input is analysed in a piecemeal fashion, in particular allowing arbitrary changes of previous input without exhaustive reanalysis, interactive parsing means that the analysis process is prompted immediately at the onset of new input, and possibly that the system then may interact with the user in order to resolve problems that occur. the combination of these techniques could be used as a parsing kernel for highly interactive and "reactive" natural language processors, such as parsers for dialogue systems, interactive computer-aided translation systems, and language-sensitive text editors. an incremental chart parser embodying the ideas put forward in this paper has been implemented, and an embedding of this in an interactive parsing system is near completion.
a comparison of event models for naive bayes anti-spam e-mail filtering. we describe experiments with a naive bayes text classifier in the context of anti-spam e-mail filtering, using two different statistical event models: a multi-variate bernoulli model and a multinomial model. we introduce a family of feature ranking functions for feature selection in the multinomial event model that take account of the word frequency information. we present evaluation results on two publicly available corpora of legitimate and spam e-mails. we find that the multinomial model is less biased towards one class and achieves slightly higher accuracy than the multi-variate bernoulli model.
automatic processing of proper names in texts. this paper shows first the problems raised by proper names in natural language processing. second, it introduces the knowledge representation structure we use based on conceptual graphs. then it explains the techniques which are used to process known and unknown proper names. at last, it gives the performance of the system and the further works we intend to deal with.
an expert system for the production of phoneme strings from unmarked english text using machine-induced rules. the speech synthesis group at the computer-based education research laboratory (cerl) of the university of illinois at urbana-champaign is developing a diphone speech synthesis system based on pitch-adaptive short-time fourier transforms. this system accepts the phonemic specification of an utterance along with pitch, time, and amplitude warping functions in order to produce high quality speech output from stored diphone templates.this paper describes the operation of a program which operates as a front end for the diphone speech synthesis system. the utter (for "unmarked text transcription by expert rule") system maps english text onto a phoneme string, which is then used as an input to the diphone speech synthesis system. the program is a two-tiered expert system which operates first on the word level and then on the (vowel or consonant) cluster level. the system's knowledge about pronunciation is organized in two decision trees automatically generated by an induction algorithm on a dynamically specified "training set" of examples.
exploring the use of linguistic features in domain and genre classification. the central questions are: how useful is information about part-of-speech frequency for text categorisation? is it feasible to limit word features to content words for text classifications? this is examined for 5 domain and 4 genre classification tasks using limas, the german equivalent of the brown corpus. because limas is too heterogeneous, neither question can be answered reliably for any of the tasks. however, the results suggest that both questions have to be examined separately for each task at hand, because in some cases, the additional information can indeed improve performance.
dictionary organization for machine translation: the experience and implications of the umist japanese project. the organization of a dictionary system raises significant questions for all natural language processing applications. we concentrate here on three with specific reference to machine translation: the optimum grain-size for lexical entries, the division of information about separate languages, and the level of abstraction appropriate to the task of translation. these are discussed, and the solutions implemented in the umist english-japanese translation project are described and illustrated in detail.
machine translation, linguistics, and interlingua. an adequate, complete, and economical linguistic theory is necessary for mt and the question is whether a consistent use of the often unduly neglected dependency syntax, including a systematic description of topic and focus, cannot serve as a reliable base for the grammar of an interlingua, or of a set of interrelated interface structures.
the corpora management system based on java and oracle technologies. the paper discusses the corpora management system (cms) design that uses java and oracle9i dbms to support strategic corpora analysis. we present the pilot web-based cms to support linguists in their daily work. the system offers facilities to assist linguists and internet users as they search for relevant material, and then classify and annotate this material.
iterative operations. we present in this article, as a part of aspectual operation system, a generation system of iterative expressions using a set of operators called iterative operators. in order to execute the iterative operations efficiently, we have classified previously propositions denoting a single occurrence of a single event into three groupes. the definition of a single event is given recursively. the classification has been carried out especially in consideration of the durative / non-durative character of the denoted events and also in consideration of existence / non-existence of a culmination point ( or a boundary) in the events. the operations concerned with iteration have either the effect of giving a boundary to an event (in the case of a non-bounded event) or of extending an event through repetitions. the operators concerned are: n, f. direct iterative operators; i, g. boundary giving operators; i .. extending operator. there are direct and indirect operations: the direct ones change a non-repetitious proposition into a repetitious one directly, whereas the indirect ones change it indirectly. the indirect iteration is indicated with &sigma;. the scope of each operator is not uniquely definable, though the mutual relation of the operators can be given more or less explicitly.