waashk/dblp huggingface dataset:
analysis of titles and readers for title generation centered on the readers. the title of a document has two roles, to give a compact summary and to lead the reader to read the document. conventional title generation focuses on finding key expressions from the author's wording in the document to give a compact summary and pays little attention to the reader's interest. to make the title play its second role properly, it is indispensable to clarify the content ("what to say") and wording ("how to say") of titles that are effective to attract the target reader's interest. in this article, we first identify typical content and wording of titles aimed at general readers in a comparative study between titles of technical papers and headlines rewritten for newspapers. next, we describe the results of a questionnaire survey on the effects of the content and wording of titles on the reader's interest. the survey of general and knowledgeable readers shows both common and different tendencies in interest.
soft display key for kanji input. the concept of a soft display key as applied to input of large character sets or vocabularies such as kanji, the ancient chinese ideographic script is discussed. the japanese orthography and the necessity of using kanji characters in data terminals are explained. problems arising from the number and complexity of kanji symbols for the manufacture and use of keyboard devices are stated. a review is made of devices and methods presently used or suggested. the feasibility of the soft display key is then demonstrated. some requirements for the design and implementation of a soft display keyboard for kanji are considered. in conclusion, implications to man/computer interface design, human factors engineering and hardware unification and standardization are stated.
on unl as the future "html of the linguistic content" & the reuse of existing nlp components in unl-related applications with the example of a unl-french deconverter. after 3 years of specifying the unl (universal networking language) language and prototyping deconverters from more than 12 languages and enconverters for about 4, the unl project has opened to the community by publishing the specifications (v2.0) of the unl language, intended to encode the meaning of nl utterances as semantic hypergraphs and to be used as a "pivot" representation in multilingual information and communication systems.a unl document is an html document with special tags to delimit the utterances and their rendering in unl and in all natural languages currently handled. unl can be viewed as the future "html of the linguistic content". it is only an interface format, leading as well to the reuse of existing nlp components as to the development of original tools in a variety of possible applications, from automatic rough enconversion for information retrieval and information gathering translation to partially interactive enconversion or deconversion for higher quality.we illustrate these points by describing an unl-french deconverter organized as a specific "localizer" followed by a classical mt transfer and an existing generator.
making sense of reference to the unfamiliar? computational approaches to reference resolution, like centering theory, are best at resolving referring expressions which denote familiar referents. we demonstrate how, by taking a proof-theoretic approach to reference resolution within a centering-type framework, we are able to make sense of referring expressions for unfamiliar referents. these include, in addition to bridging descriptions, definite descriptions like "the first man" and "the first snowdrops of spring". we claim that the first of these denotes a unique subset of a plural discourse antecedent. while the second has no discourse antecedent, we similarly treat it as denoting a unique subset of a familiar referent.
natural language understanding and the perspectives of question answering. a method of automatic answering of questions in natural language, based only on input texts and a set of rules of inference, is described. a first experimental system including a grammatico-semantic analysis of the input texts and questions, a procedure of inferencing, a search for appropriate answers to individual questions and a synthesis of the answers are being implemented, mainly in the language q and pl/1. the output of the analysis, the underlying representations of the utterances of the input text, serves as a base of the knowledge representation scheme, on which the inference rules (mapping dependency trees into dependency trees) operate.
the simple core and the complex periphery of natural language - a formal and a computational view. a complex procedure of syntactic annotation of a large text corpus may be helpful in checking a rich descriptive framework (the praguian functional generative description) that makes it possible to distinguish between the core of natural language, structured in a relatively simple way, and its large periphery with indistinct borderlines. such a procedure underlies the prague dependency treebank, within which about 20 000 czech sentences from running texts have been analyzed in their underlying structure; for 2000 sentences also their topic-focus structures have been specified. we illustrate the wide range of the phenomena handled, i.e. the syntactic relations proper (arguments and adjuncts), coordination, topic-focus articulation, word order, deletion, positions of focusing particles, morphological categories such as number, tense, modality, their morphemic and analytical means of expression, and so on.
gtt: a general transducer for teaching computational linguistics. the gtt-system is a tree-to-tree transducer developed for teaching purposes in machine translation. the transducer is a specialized production system giving the linguists the tools for expressing information in a syntax that is close to theoretical linguistics. major emphasis was placed on developing a system that is user friendly, uniform and legible. this paper describes the linguistic data structure, the rule formalism and the control facilities that the linguist is provided with.
a parametric nl translator. this report outlines a machine translation system whose linguistic component is based on principles of government and binding. a "universal grammar" is defined, together with parameters of variation for specific languages. the system, written in prolog, parses, generates, and translates between english and spanish (both directions).
a corpus-based analysis for the ordering of clause aggregation operators. to better understand the ordering of clause aggregation operators in a text generation application, we manually annotated a small corpus. the annotated corpus supports the preferred ordering of transformations that result in shorter surface expressions, such as adjectives over relative clauses. in addition, we were able to explain why paratactic operators are applied before and after hypotactic operators.
generation of paraphrases from ambiguous logical forms. this paper presents a method for generating multiple paraphrases from ambiguous logical forms. the method is based on a chart structure with edges indexed on semantic information and annotations that relate edges to the semantic facts they express. these annotations consist of logical expressions that identify particular realizations encoded in the chart. the method allows simultaneous generation from multiple interpretations, without hindering the generation process or causing any work to be superfluously duplicated.
the need for mt-oriented versions of case and valency in mt. this paper looks at the use in machine translation systems of the linguistic model of case and valency. it is argued that neither of these models was originally developed with this use in mind, and both must be adapted somewhat to meet this purpose. in particular, the traditional valency distinction of complements and adjuncts leads to conflicts when valency frames in different languages are compared: a finer but more flexible distinction is required. also, these concepts must be extended beyond the verb, to include the noun and adjective as valency bearers. as far as case is concerned, too narrow an approach has traditionally been taken: work in this field has been too conerned only with cases for arguments in verb frames; case label systems for non-valency bound elements and also for elements in nominal groups must be elaborated. the paper suggests an integrated approach specifically oriented towards the particular problems found in mt.
the design of a computer language for linguistic information. a considerable body of accumulated knowledge about the design of languages for communicating information to computers has been derived from the subfields of programming language design and semantics. it has been the goal of the patr group at sri to utilize a relevant portion of this knowledge in implementing tools to facilitate communication of linguistic information to computers. the patr-ii formalism is our current computer language for encoding linguistic information. this paper, a brief overview of that formalism, attempts to explicate our design decisions in terms of a set of properties that effective computer languages should incorporate.
a simple reconstruction of gpsg. like most linguistic theories, the theory of generalized phrase structure grammar (gpsg) has described language axiomatically, that is, as a set of universal and language-specific constraints on the well-formedness of linguistic elements of some sort. the coverage and detailed analysis of english grammar in the ambitious recent volume by gazdar, klein, pullum, and sag entitled generalized phrase structure grammar [2] are impressive, in part because of the complexity of the axiomatic system developed by the authors. in this paper. we examine the possibility that simpler descriptions of the same theory can be achieved through a slightly different, albeit still axiomatic, method, rither than characterize the well-formed trees directly, we progress in two stages by procedurally characterizing the well-formedness axioms themselves, which in turn characterize the trees.
machine translation without a source text. this paper concerns an approach to machine translation which differs from the typical 'standard' approaches crucially in that it does not rely on the prior existence of a source text as a basis of the translation. our approach can be characterised as an 'intelligent secretary with knowledge of the foreign language', which helps monolingual users to formulate the desired target-language text in the context of a (key-board) dialogue translation systems.
a uniform architecture for parsing and generation. the use of a single grammar for both parsing and generation is an idea with a certain elegance, the desirability of which several researchers have noted. in this paper, we discuss a more radical possibility: not only can a single grammar be used by different processes engaged in various "directions" of processing, but one and the same language-processing architecture can be used for processing the grammar in the various modes. in particular, parsing and generation can be viewed as two processes engaged in by a single parameterized theorem prover for the logical interpretation of the formalism. we discuss our current implementation of such an architecture, which is parameterized in such a way that it can be used for either purpose with grammars written in the patr formalism. furthermore, the architecture allows fine tuning to reflect different processing strategies, including parsing models intended to mimic psycholinguistic phenomena. this tuning allows the parsing system to operate within the same realm of efficiency as previous architectures for parsing alone, but with much greater flexibility for engaging in other processing regimes.
synchronous tree-adjoining grammars. the unique properties of tree-adjoining grammars (tag) present a challenge for the application of tags beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. we present a variant of tags, called synchronous tags, which characterize correspondences between languages. the formalism's intended usage is to relate expressions of natural languages to their associated semantics represented in a logical form language, or to their translates in another natural language; in summary, we intend it to allow tags to be used beyond their role in syntax proper. we discuss the application of synchronous tags to concrete examples, mentioning primarily in passing some computational issues that arise in its interpretation.
semantic interpretation using kl-one. this paper presents extensions to the work of bobrow and webber [bobrow & webber 80a, bobrow & webber 80b] on semantic interpretation using kl-one to represent knowledge. the approach is based on an extended case frame formalism applicable to all types of phrases, not just clauses. the frames are used to recognize semantically acceptable phrases, identify their structure, and, relate them to their meaning representation through translation rules. approaches are presented for generating kl-one structures as the meaning of a sentence, for capturing semantic generalizations through abstract case frames, and for handling pronouns and relative clauses.
automatic corpus-based thai word extraction with the c4.5 learning algorithm. "word" is difficult to define in the languages that do not exhibit explicit word boundary, such as thai. traditional methods on defining words for this kind of languages have to depend on human judgement which bases on unclear criteria or procedures, and have several limitations. this paper proposes an algorithm for word extraction from thai texts without borrowing a hand from word segmentation. we employ the c4.5 learning algorithm for this task. several attributes such as string length, frequency, mutual information and entropy are chosen for word/non-word determination. our experiment yields high precision results about 85% in both training and test corpus.
mach : a supersonic korean morphological analyzer. this paper introduces a supersonic korean morphological analyzer named mach. it analyzes a 1 gb document within 5 minutes on a typical personal computer with a 1 ghz pentium iii cpu. this means that it analyzes about 500,000 words per second. in fact, the analysis speed of mach is 12-20 times faster than the most famous korean morphological analyzers. in spite of its supersonic speed, the analysis accuracy of mach is not degraded at all, compared with any other korean morphological analyzers.
classifier assignment by corpus-based approach. this paper presents an algorithm for selecting an appropriate classifier word for a noun. in thai language, it frequently happens that there is fluctuation in the choice of classifier for a given concrete noun, both from the point of view of the whole speech community and individual speakers. basically, there is no exact rule for classifier selection. as far as we can do in the rule-based approach is to give a default rule to pick up a corresponding classifier of each noun. registration of classifier for each noun is limited to the type of unit classifier because other types are open due to the meaning of representation. we propose a corpus-based method (biber, 1993; nagao, 1993; smadja, 1993) which generates noun classifier associations (nca) to overcome the problems in classifier assignment and semantic construction of noun phrase. the nca is created statistically from a large corpus and recomposed under concept hierarchy constraints and frequency of occurrences.
japanese sentence analysis as argumentation. this paper proposes that sentence analysis should be treated as defeasible reasoning, and presents such a treatment for japanese sentence analyses using an argumentation system by konolige, which is a formalization of defeasible reasoning, that includes arguments and defeat rules that capture defeasibility.
the automatic extraction of open compounds from text corpora. this paper describes a new method for extracting open compounds (uninterrupted sequences of words) from text corpora of languages, such as thai, japanese and korea that exhibit unexplicit word segmentation. without applying word segmentation techniques to the inputted plain text, we generate n-gram data from it. we then count the occurence of each string and sort them in alphabetical order. it is significant that the frequency of occurrence of strings decreases when the window size of observation is extended. from the statistical point of view, a word is a string with a fixed pattern that is used repeatedly, meaning that it should occur with a higher frequency than a string that is not a word. we observe the variation of frequency of the sorted n-gram data and extract the strings that experience a significant change in frequency of occurrence when their length is extended. we apply this occurrence test to both the right and left hand sides of all strings to ensure the accurate detection of both boundaries of the string. the method returned satisfying results regardless of the size of the input file.
design tool combining keyword analyzer and case-based parser for developing natural language database interfaces. we have designed and experimentally implemented a tool for developing a natural language systems that can accept extra-grammatical expressions, keyword sequences, and linguistic fragments, as well as ordinary natural language queries. the key to this tool's efficiency is its effective use of a simple keyword analyzer in combination with a conventional case-based parser. the keyword analyzer performs a majority of those queries which are simple data retrievals. since it uses only keywords in any query, this analyzer is robust with regard to extra-grammatical expressions. since little labor is required of the application designer in using the keyword analyzer portion of the tool, and since the case-based parser processes only those queries which the keyword analyzer fails to interpret, total labor required of the designer is less than that for a tool which employs a conventional case-based parser alone.
representing knowledge about knowledge and mutual knowledge. in order to represent speech acts, in a multi-agent context, we choose a knowledge representation based on the modal logic of knowledge kt4 which is defined by sato. such a formalism allows us to reason about knowledge and represent knowledge about knowledge, the notions of truth value and of definite reference.
multi-modal definite clause grammar. this paper describes the first reported grammatical framework for a multimodal interface. although multimodal interfaces offer the promise of a flexible and user friendly means of human-computer interaction, no study has yet appeared on formal grammatical frameworks for them. we have developed multi-modal definite clause grammar (mm-dcg), an extension of definite clause grammar. the major features of mm-dcg include capability to handle an arbitrary number of modes and temporal information in grammar rules. further, we have developed mm-dcg translator to transfer rules in mm-dcg into prolog predicates.
explanatory text planning in logic based systems. this paper discusses aspects of the planning of explanatory texts for logic based systems. it presents a method for deriving natural language text plans from natural deduction-based structures. this approach allows for the planning of explanatory texts in a general-purpose logic based system framework, ensuring a greater degree of portability across domains.
multi-modal-method: a design method for building multi-modal systems. this paper describes multi-modal-method, a design method for building grammar-based multi modal systems. multi-modal-method defines the procedure which interface designers may follow in developing multi-modal systems, and provides mm-dcg, a grammatical framework for multi-modal input interpretation. multi-modal-method has been inductively defined through several experimental multi-modal interface system developments. a case study of a multi-modal drawing tool development along with multi-modal-method is reported.
a dutch to sql database interface using generalized quantifier theory. this paper presents the treatment of quantification as it was implemented in a prototype of a natural language relational database interface for dutch. it is shown how the theoretical 'generalized quantifier' apparatus introduced in formal semantics by barwise and cooper can be tuned to implementational feasibility. compared to the traditional treatment of quantification, the alternative presented here offers greater expressive power, greater similarity to natural language and, as a consequence, the possibility of a more straightforward translation from natural language to formal representation.
understanding of stories for animation. this paper presents the story understanding mechanism for creating computer animation scenarios. the story understanding mechanism reads a natural language story and creates its scenario for realistic graphic animations. this paper presents three types of hidden actions and relations of actions that must be discovered for realistic animations of stories but which are not explicitly described in the stories. they are: 1) causality check among actions; 2) interpolation of a continuous action beyond a sentence; 3) interpolation of hidden actions between neighboring sentences. this paper also describes the inference mechanism which recognizes the need for interpolation of these hidden actions. multiple tms is introduced in the mechanism. the knowledge base is action-oriented, hence it is independent of individual stories domains.
processing self corrections in a speech to speech system. speech repairs occur often in spontaneous spoken dialogues. the ability to detect and correct those repairs is necessary for any spoken language system. we present a framework to detect and correct speech repairs where all relevant levels of information, i. e., acoustics, lexis, syntax and semantics can be integrated. the basic idea is to reduce the search space for repairs as soon as possible by cascading filters that involve more and more features. at first an acoustic module generates hypotheses about the existence of a repair. second a stochastic model suggests a correction for every hypothesis. well scored corrections are inserted as new paths in the word lattice. finally a lattice parser decides on accepting the repair.
an empirical method for identifying and translating technical terminology. this paper describes a method for retrieving patterns of words and expressions frequently used in a specific domain and building a dictionary for machine translation (mt). the method uses an untagged text corpus in retrieving word sequences and simplified part-of-speech templates in identifying their syntactic categories. the paper presents experimental results for applying the words and expressions to a pattern-based machine translation system.
a tagger/lemmatiser for dutch medical language. in this paper, we want to describe a tagger/lemmatiser for dutch medical vocabulary, which consists of a full-form dictionary and a morphological recogniser for unknown vocabulary coupled to an expert system-like disambiguation module. attention is also paid to the main datastructures: a lexical database and feature bundles implemented as directed acyclic graphs. some evaluation results are presented as well. the tagger/lemmatiser currently functions as a lexical front-end for a syntactic parser. for pure tagging/lemmatising purposes, a reduced tagset (not suited for sentence analysis) can be used as well.