waashk/dblp huggingface dataset:
processing clinical narratives in hungarian. this paper describes a system that extracts information from hungarian descriptive texts of medical domain texts of clinical narratives define a sublanguage that uses limited syntax but holds the main characteristics of the language, namely free word order and rich morphology. we offer a fairly general parsing method for free word order languages and the way how to use it for parsing hungarian clinical texts. the system can handle simple cases of ellipses, anaphora, unknown words and typical abbreviations of clinical practice. the system translates texts of anamneses, patient visits, laboratory tests, medical examinations and discharge summaries into an information format usable for a medical expert system. similarly to this expert system, the information formatting program has been written in mprolog language adn its experimental version runs on proper-16, a hungarian made (ibm-xi compatible) microcomputer.
morphological analyzer as syntactic parser. we describe how a simple parser can be built on the basis of morphology and a morphological analyzer. our initial conditions have been the techniques and principles of humor, a reversible, string-based unification tool (pr&ograve;sz&eacute;ky 1994). parsing is performed by the same engine as morphological analysis. it is useful when there is not enough space to add a new engine to an existing morphology-based application (e.g. a spell-checker), but you would like to handle sentence-level information, as well (e.g. a grammar checker). the morphological analyzer breaks up words into several parts, all of which stored in the main lexicon. each part has a feature structure and the validity of the input word is checked by unifying them. the morphological analyzer returns various information about a word including its categorization. in a sentence, the category of each word (or morpheme) is considered a metaletter, and the sentence itself can be transformed into a meta-word that essentially behaves like a real one. thus the set of sentences recognized by the parser called humoresk can form a lexicon of meta-words that are processed much the same way as lexicons of real words (morphology). this means that algorithmic parsing step are substituted by lexicon look-up, which, by definition, is performed following the surface order of string elements. both the finitizer that transforms formal grammars into finite lexicons and the run-time parser of the proposed model have running implementations.
context-sensitive electronic dictionaries. this paper introduces a context-sensitive electronic dictionary that provides translations for any piece of text displayed on a computer screen, without requiring user interaction. this is achieved through a process of three phases: text acquisition from the screen, morpho-syntactic analysis of the context of the selected word, and the dictionary lookup. as with other similar tools available, this program usually works with dictionaries adapted from one or more printed dictionaries. to implement context sensitive features, however, traditional dictionary entries need to be restructured. by splitting up entries into smaller pieces and indexing them in a special way, the program is able to display a restricted set of information that is relevant to the context. based on the information in the dictionaries, the program is able to recognize---even discontinuous---multiword expressions on the screen.the program has three major features which we believe make it unique for the time being, and which the development focused on: linguistic flexibility (stemming, morphological analysis and shallow parsing), open architecture (three major architectural blocks, all replaceable along public documented apis), and flexible user interface (replaceable dictionaries, direct user feedback).in this paper, we assess the functional requirements of a context-sensitive dictionary as a start; then we explain the program's three phases of operation, focusing on the implementation of the lexicons and the context-sensitive features. we conclude the paper by comparing our tool to other similar publicly available products, and summarize plans for future development.
recognition assistance - treating errors in texts acquired from various recognition processes. texts acquired from recognition sources---continuous speech/handwriting recognition and ocr---generally have three types of errors regardless of the characteristics of the source in particular. the output of the recognition process may be (1) poorly segmented or not segmented at all; (2) containing underspecified symbols (where the recognition process can only indicate that the symbol belongs to a specific group), e.g. shape codes; (3) containing incorrectly identified symbols. the project presented in this paper addresses these errors by developing of a unified linguistic framework called the morphologic recognition assistant that provides feedback and corrections for various recognition processes. the framework uses customized morpho-syntactic and syntactic analysis where the lexicons and their alphabets correspond to the symbol set acquired from the recognition process. the successful framework must provide three services: (1) proper disambiguated segmentation, (2) disambiguation for underspecified symbols, (3) correction for incorrectly recognized symbols. the paper outlines the methods of morpho-syntactic and syntactic post-processing currently in use.
syntactic and semantic parsability. this paper surveys some issues that arise in the study of the syntax and semantics of natural languages (nl's) and have potential relevance to the automatic recognition, parsing, and translation of nl's. an attempt is made to take into account the fact that parsing is scarcely ever thought about with reference to syntax alone; semantic ulterior motives always underly the assignment of a syntactic structure to a sentence. first i consider the state of the art with respect to arguments about the language-theoretic complexity of nl's: whether nl's are regular sets, deterministic cfl's, cfl's, or whatever. while english still appears to be a cfl as far as i can tell, new arguments (some not yet published) appear to show for the first time that some languages are not cfl's. next i consider the question of how semantic filtering affects the power of grammars. then i turn to a brief consideration of some syntactic proposals that employ more or less modest extensions of the power of context-free grammars.
limited domain systems for language teaching. this abstract describes a natural language system which deals usefully with ungrammatical input and describes some actual and potential applications of it in computer aided second language learning. however, this is not the only area in which the principles of the system might be used, and the aim in building it was simply to demonstrate the workability of the general mechanism, and provide a framework for assessing developments of it.
when mariko talks to siegfried - experiences from a japanese/german machine translation project. in this paper we will report on our experiences from a 2 1/2 year project that designed and implemented a prototypical japanese to german translation system for titles of japanese papers.
attitude emergence - an effective interpretation scheme for persuasive discourse. previous approaches have used a reasoning mechanism called belief percolation to determine the actual speech intent of the speaker (e.g., (wilks and bien 1979)). in this paper, a similar mechanism, called attitude emergence, is proposed as a mechanism for inferring a speaker's attitude toward the propositions in a persuasive discourse. it is shown that in order to adequately interpret the statements in advertisements, associations of relevant semantic information, through bridging inferences, are to be percolated up through attitude model contexts to enhance and calibrate the interpretation of statements. a system called buyer is being implemented to recognize speech intents through attitude emergence in the domain of food advertisements taken from reader's digest. an example of buyer's processing is also presented in the paper.
on the proper role of coercion in semantic typing. in this paper, we discuss the phenomenon of logical polysemy in natural language as addressed by generative lexicon theory. we discuss generally the role of type and sortal coercion operations in the semantics, and specifically the conditions on the application of coercion in aspectual predicates and other contexts. we reply to some recent discussion regarding the use of coercion in the grammar, and show that type changing operations are both useful and explanatory mechanisms for capturing linguistic and computational generalizations.
an improved left-corner parsing algorithm. this paper proposes a series of modifications to the left corner parsing algorithm for context-free grammars. it is argued that the resulting algorithm is both efficient and flexible and is, therefore, a good choice for the parser used in a natural language interface.
generating multilingual documents from a knowledge base: the techdoc project. techdoc is an implemented system demonstrating the feasibility of generating multilingual technical documents on the basis of a language-independent knowledge base. its application domain is user and maintenance instructions, which are produced from underlying plan structures representing the activities, the participating objects with their properties, relations, and so on. this paper gives a brief outline of the system architecture and discusses some recent developments in the project: the addition of actual event simulation in the kb, steps towards a document authoring tool, and a multimodal user interface.
blending segmentation with tagging in chinese language corpus processing. this paper poses a new method for chinese language corpus processing. unlike the past researches, our approach has following charactericstics: it blends segmenation with tagging and integrates rule-based approach with statistics-based one in grammatical disambiguation. the principal ideas presented in the paper are incorporated in the development of a chinese corpus processing system. experimental results prove that the overall accuracy for segmentation is 97.68% and that for tagging is 94.55% in about 400,000 chinese characters.
probabilistic reasoning for entity & relation recognition. this paper develops a method for recognizing relations and entities in sentences, while taking mutual dependencies among them into account. e.g., the kill (johns, oswald) relation in: "j. v. oswald was murdered at jfk after his assassin, k. f. johns. . ." depends on identifying oswald and johns as people, jfk being identified as a location, and the kill relation between oswald and johns; this, in turn, enforces that oswald and johns are people.in our framework, classifiers that identify entities and relations among them are first learned from local information in the sentence; this information, along with constraints induced among entity types and relations, is used to perform global inference that accounts for the mutual dependencies among the entities.our preliminary experimental results are promising and show that our global inference approach improves over learning relations and entities separately.
using discourse predictions for ambiguity resolution. in this paper we discuss how we apply discourse predictions along with non context-based predictions to the problem of parse disambiguation in enthusiast, a spanish-to-english translation system (woszcyna et al., 1993; suhm et al., 1994; levin et al., 1995). we discuss extensions to our plan-based discourse processor in order to make this possible. we evaluate those extensions and demonstrate the advantage of exploiting context-based predictions over a purely non context-based approach.
pragmatics in machine translation. texan is a system of transfer-oriented text analysis. its linguistic concept is based on a communicative approach within the framework of speech act theory. in this view texts are considered to be the result of linguistic actions. it is assumed that they control the selection of translation equivalents. the transtion of this concept of linguistic actions (text acts) to the model of computer analysis is performed by a context-free illocution grammar processing categories of actions and a propositional structure of states of affairs. the grammar which is related to a text lexicon provides the connection of these categories and the linguistic surface units of a single language.
an hpsg parser based on description logics. in this paper i present a parser based on description logics (dl) for a german hpsg-style fragment. the specified parser relies mainly on the inferential capabilities of the underlying dl system. given a preferential default extension for dl disambiguation is achieved by choosing the parse containing a qualitatively minimal number of exceptions.
typology study of french technical texts, with a view to developing a machine translation system. within the industrial context of the information society, technical translation represents a considerable commercial stake. in the light of this, machine translation is considered as being an application of paramount importance. it is for this reason that the activities of b'vital have always centered around the processing of technical texts.the following article gives an account of the various tasks carried out over the last few years on corpus analysis. we have drawn conclusions as to the validity of the notion of text typologies, applied in particular to technical matter, with a view to developing a machine translation system. the stuyd was conducted using a fair amount of french documents and has led us to observe in particular, that a same typology may be identified in texts originating from varying fields.
arguing about planning alternatives. in discourse processing, two major problems are understanding the underlying connections between successive dialog utterances and deciding on the content of a coherent dialog response. this paper presents a computational model of these tasks for a restricted class of argumentative dialogs. in these dialogs, each response presents a belief that justifies or contradicts another belief presented or inferred earlier in the dialog. understanding a response involves relating a stated belief to these earlier beliefs, and producing a response involves selecting a belief to justify and deciding upon the set of beliefs to provide as its justification. our approach is knowledge based, using general, common-sense justification rules to recognize how a belief is being justified and to form new justifications for beliefs. this approach provides the ability to recognise and respond to never before seen belief justifications, a necessary capability for any system that participates in dialogs involving disagreements.
a formalism for universal segmentation of text. sumo is a formalism for universal segmentation of text. its purpose is to provide a framework for the creation of segmentation applications. it is called "universal" as the formalism itself is independent of the language of the documents to process and independent of the levels of segmentation (e.g. words, sentences, paragraphs, morphemes...) considered by the target application. this framework relies on a layered structure representing the possible segmentations of the document. this structure and the tools to manipulate it are described, followed by detailed examples highlighting some features of sumo.
les experiences d'indexation a l'inist. we talk, in this paper, about the operation of indexation at inist. we present two experiments carried out within the department of research and new products that aim at the automation of indexation process. the first one comes within the scope of scientometric studies on text database. we have developped a software toolbox with which we can build a chain of treatments up to the generation of hyperdocuments. therefore, indexation from a large corpus of source documents is the first module of that chain. in this part, we use linguistic and statistical methods to produce keywords from a stream of data. linguitic heuristics are used to extract compound nouns or noun phrases from the text and combinational treatments determine the importance of each term according to the document. keywords are here the input of an hypertext system. the second one is the development of a workstation for the information specialist integrating a computer-aided indexing system on title and abstract in bibliographical records. this indexing process works on a single bibliographical record and combines both linguistic methods and artificial intelligence (keywords generation). we use the same extraction module based on linguistic and add a knowledge based system to deduce implicit keywords. finally, we show that the original specifications and purpose of each experiment are different and we start a discussion on the interest of these methods in relation to the kind of indexation wanted and the qualities expected from automatic indexing systems.
argumentation in representation semantics. it seems rather natural to admit that language use is governed by rules that relate signs, forms and meanings to possible intentions or possible interpretations, in function of utterance situations. not less natural should seem the idea that the meaning of a natural language expression conveys enough material to the input of these rules, so that, given the situation of utterance, they determine the appropriate interpretation. if this is correct, the semantic description of a natural language expression should output not only the 'informative content' of that expression, but also all sorts of indications concerning the way this expression may be used or interpreted. in particular, the argumentative power of utterances is due to argumentative indications conveyed by the sentences uttered, indications that are not part of their informative content. this paper emphasizes the role of argumentation in language and shows how it could be accounted for in a formal representation semantics framework. an example of an analysis is provided in order to show the "system at work".
using contextual spelling correction to improve retrieval effectiveness in degraded text collections. the study presented relies on the design and evaluation of an improved ir system susceptible to cope with textual misspellings. after selecting an optimal weighting scheme for the engine, we evaluate the effect of misspellings on the retrieval effectiveness. then, we compare the improvement brought to the engine by the adjunction of two different non-interactive spelling correction strategies: a classical one, based on a string-to-string edit distance calculus, and a contextual one, which adds linguistically-motivated features to the string distance module. the results for the latter suggest that average precision in degraded texts can be reduced to a few percents (4%).
automatic translation of noun compounds. this paper describes the treatment of nominal compounds in a tranarer based machine translation system; it presents a new approach for resolving ambiguities in compound segmentation and constituent structure selection using a combination of linguistic rules and statistical data. an introduction to the general as well as to the german-english-specific problems of compound translation is given (sect. 1). in section 2, the analysis phase is described with its linguistics as well as its computational aspects. section 3 deals with the transfer and generation process, focussing on corpus based techniques.
a context-sensitive model for probabilistic lr parsing of spoken language with transformation-based postprocessing. this paper describes a hybrid approach to spontaneous speech parsing. the implemented parser uses an extended probabilistic lr parsing model with rich context and and its output is post-processed by a symbolic tree transformation routine that tries to eliminate systematic errors of the parser. the parser has been trained for three different languages and was successfully integrated in the verbmobil speech-to-speech translation system. the parser achieves more than 90%/90% labeled precision/recall on parsed verbmobil utterances while 3% of german and 5% of all english input cannot be parsed.
creating a finite-state parser with application semantics. parsli is a finite-state (fs) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. the lexicon is defined in terms of a lexicalized tree adjoining grammar, which is subsequently mapped to a fs representation. this approach gives the application designer better and easier control over the natural language understanding component than using an off-the-shelf parser. we present results using parsli on an application that creates 3d-images from typed input.
genetic nps and habitual vps. we propose a simple, intuitively satisfying treatment of the semantics of bare plural nps. this treatment avoids the use of non-standard logics, and avoids the need for systematic ambiguity of verb semantics.
a syntactic and morphological analyzer for a text-to-speech system. this paper presents a system which analyzes an input text syntactically and morphologically and converts the text from the graphemic to the phonetic representation (or vice versa). we describe the grammar formalism used and report a parsing experiment which compared eight parsing strategies within the framework of chart parsing. although the morphological and syntactic analyzer has been developed for a text-to-speech system for german, it is language independent and general enough to be used for dialog systems, nl-interfaces or speech recognition systems.
aspect and aktionsart: fighting or cooperating? it is widely accepted that semantic theories should, as far as possible, be compositional. the claim that a theory is compositional, however, lacks bite if lexical and pre-lexical items are allowed to mean different things in different contexts. the aim of the current paper is to show how to deal with a well-known phenomenon by relying on combinatorial effects to infer different consequences from the same items in different contexts without altering the contributions that these items make individually.
kcat: a korean corpus annotating tool minimizing human intervention. while large pos (part-of-speech) annotated corpora play an important role in natural language processing, the annotated corpus requires very high accuracy and consistency. to build such an accurate and consistent corpus, we often use a manual tagging method. but the manual tagging is very labor intensive and expensive. furthermore, it is not easy to get consistent results from the human experts. in this paper, we present an efficient tool for building large accurate and consistent corpora with minimal human labor. the proposed tool supports semiautomatic tagging. using disambiguation rules acquired from human experts. it minimizes the human intervention in both the manual tagging and post-editing steps.
unscrambling english word order. we propose a treatment of 'extraposition' which allows items to be assimilated directly even when they appear far from their canonical positions. this treatment supports analyses of a number of phenomena which are otherwise hard to describe. the approach requires a generalisation of standard chart parsing techniques.