waashk/dblp huggingface dataset:
parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars. in this paper we present a general parsing strategy that arose from the development of an earley-type parsing algorithm for tags (schabes and joshi 1988) and from recent linguistic work in tags (abeille 1988).in our approach elementary structures are associated with their lexical heads. these structures specify extended domains of locality (as compared to a context-free grammar) over which constraints can be stated. these constraints either hold within the elementary structure itself or specify what other structures can be composed with a given elementary structure.we state the conditions under which context-free based grammars can be 'lexicalized' without changing the linguistic structures originally produced. we argue that even if one extends the domain of locality of cfgs to trees, using only substitution does not give the freedom to choose the head of each structure. we show how adjunction allows us to 'lexicalize' a cfg freely.we then show how a 'lexicalized' grammar naturally follows from the extended domain of locality of tags and present some of the linguistic advantages of our approach.a novel general parsing strategy for 'lexicalized' grammars is discussed. in a first stage, the parser builds a set structures corresponding to the input sentence and in a second stage, the sentence is parsed with respect to this set. the strategy is independent of the linguistic theory adopted and of the underlying grammar formalism. however, we focus our attention on tags. since the set of trees needed to parse an input sentence is supposed to be finite, the parser can use in principle any search strategy. thus, in particular, a top-down strategy can be used since problems due to recursive structures are eliminated. the parser is also able to use non-local information to guide the search.we then explain how the earley-type parser for tags can be modified to take advantage of this approach.
concurrent lexicalized dependency parsing: a behavioral view on parsetalk events. the behavioral specification of an object-oriented grammar model is considered. the model is based on full lexicalization, head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation. the computation model relies upon the actors paradigm, with concurrency entering through asynchronous message passing between actors. in particular, we here elaborate on principles of how the global behavior of a lexically distributed grammar and its corresponding parser can be specified in terms of event type networks and event networks, resp.
idioms in the rosetta machine translation system. this paper discusses one of the problems of machine translation, namely the translation of idioms. the paper describes a solution to this problem within the theoretical framework of the rosetta machine translation system.rosetta is an experimental translation system which uses an intermediate language and translates between dutch, english and, in the future, spanish.
experiments in german noun chunking. the paper describes a method to process recursive noun phrases with finite-state cascades. it is shown that chunking of recursive noun phrases necessitates a readjustment of the finite-state cascades approach. in particular, the property of monotonicity must be given up. furthermore, the paper explores the influence of pos tags and online agreement checking on the overall performance.
semantic construction from parse forests. the paper describes a system which uses packed parser output directly to build semantic representations. more specifically, the system takes as input packed shared forests in the sense of tomita (tomita, 1985) and produces packed underspecified discourse representation structures. the algorithm visits every node in the parse forest only a bounded number of times, so that a significant increase in efficiency is registered for ambiguous sentences.
experiments in automated lexicon building for text searching. this paper describes experiments in the automatic construction of lexicons that would be useful in searching large document collections for text fragments that address a specific information need, such as an answer to a question.
generating multimodal output - conditions, advantages and problems. in natural communication situations, multimodel referent specification is frequent and efficient. the linguistic component are deictic expressions, e.g. 'this and 'here'. extralinguistic devices in dialogs are different body movements, mainly pointing gestures. their functional equivalent in texts are means like arrows and indices.this paper has two intentions. first, it discusses the advantages of multimodal reference in interhuman communication which motivate the integration of extralinguistic "pointing" devices into nl dialog systems. the generation of multimodal output poses specific problems, which have no counterpart in the analysis of multimodal input. the second part presents the strategy for generating multimodal output which has been developed within the framework of the xtra system (a nl access system to expert systems). xtra allows the combination of verbal descriptions and pointing gestures in order to specify elements of the given visual context, i.e. a form displayed on the screen. the component popel generates referential expressions which may be accompanied by a pointing gesture. the appearance of these gestures depends on several factors, e.g. the type of referent (whether it is a region or an entry of the form) and its complexity.
a generative probability model for unification-based grammars. a generative probability model for unification-based grammars is presented in which rule probabilities depend on the feature structure of the expanded constituent. the presented model is the first model which requires no normalization and allows the application of dynamic programming algorithms for disambiguation (viterbi) and training (inside-outside). another advantage is the small number of parameters.
lexicalization of probabilistic grammars. two general methods for the lexicalization of probabilistic grammars are presented which are modular, powerful and require only a small number of parameters. the first method multiplies the unlexicalized parse tree probability with the exponential of the mutual information terms of all word-governor pairs in the parse. the second lexicalization method accounts for the dependencies between the different arguments of a word. the model is based on a em clustering model with word classes and selectional restrictions as hidden features. this model is useful for finding word classes, selectional restrictions and word sense probabilities.
part-of-speech tagging with neural networks. text corpora which are tagged with part-of-speech information are useful in many areas of linguistic research. in this paper, a new part-of-speech tagging method based on neural networks (net-tagger) is presented and its performance is compared to that of a hmm-tagger (cutting et al., 1992) and a trigram-based tagger (kempe, 1993). it is shown that the net-tagger performs as well as the trigram-based tagger and better than the hmm-tagger.
robust german noun chunking with a probabilistic context-free grammar. we present a noun chunker for german which is based on a head-lexicalised probabilistic context-free grammar. a manually developed grammar was semi-automatically extended with robustness rules in order to allow parsing of unrestricted text. the model parameters were learned from unlabelled training data by a probabilistic context-free parser. for extracting noun chunks, the parser generates all possible noun chunk analyses, scores them with a novel algorithm which maximizes the best chunk sequence criterion, and chooses the most probable chunk sequence. an evaluation of the chunker on 2,140 hand-annotated noun chunks yielded 92% recall and 93% precision.
a syntactic description of german in a formalism designated for machine translation. this paper presents a syntactic description of a fragment of german that has been worked out within the machine translation project eurotra. it represents the syntactic part of the german module of this multilingual translation system. the linguistic tool for the following analyses is the so-called cat-framework.in the first two sections of this paper an introduction of the formalism and a linguistic characterization of the framework is given. the cat formalism as a whole is a theory of machine translation, the syntactic analysis part which is the subject of this paper is an lfg-like mapping of a constituent structure onto a functional structure.a third section develops principles for a phrase structure and a functional structure for german and the mapping of phrase structure onto functional structure.in a fourth section a treatment of unbounded movement phenomena is sketched. as the cat-framework does not provide any global mechanisms i try to give a local treatment of this problem.
lean formalisms, linguistic theory and applications. grammar development in alep. this paper describes results achieved in a project which addresses the issue of how the gap between unification-based grammars as a scientific concept and real world applications can be narrowed down1. application-oriented grammar development has to take into account the following parameters: efficiency: the project chose a so called 'lean' formalism, a term-encodable language providing efficient term unification, alep. coverage: the project adopted a corpus-based approach. completeness: all modules needed from text handling to semantics must be there. the paper reports on a text handling component, two level morphology, word structure, phrase structure, semantics and the interfaces between these components. mainstream approach: the approach claims to be mainstream, very much indebted to hpsg, thus based on the currently most prominent and recent linguistic theory. the relation (and tension) between these parameters are described in this paper.
parsing schemata for grammars with variable number and order of constituents. we define state transition grammars (stg) as an intermediate formalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy from the grammar formalism. this allows to define more general parsing algorithms for larger classes of grammars, including grammars where the number and order of subconstituents defined by a production may not be fixed. various grammar formalisms are characterized in terms of properties of stg's. we define an earley parsing schema for stg's and characterize the valid parse items. we also discuss the usability of stg's for head-corner parsing and direct parsing of sets of tree constraints.
concurrent parsing in programmable logic array (pla-) nets problems and proposals. this contribution attempts a conceptual and practical introduction into the principles of wiring or constructing special machines for language processing tasks instead of programming a universal machine. construction would in principle provide higher descriptive adequacy in computationally based linguistics. after all, our heads do not apply programs on stored symbol arrays but are appropriately wired for understanding or producing language.
the translation of constitutent structure grammars into connectionist networks. description of a connectionist implementation of an earley parser.
the semantics and syntax of russian pronominal structure: a feature breakdown. elaborating one of the points of his coling bonn 1986 paper, the author discusses pronominality, which is due to a special semantic stratum, singulative identificational deixis. personal, reflexive and interrogative pronouns have additional transmissional deictic markings, but singulative identificational pronominality alone has a direct anaphoric effect and tends to reinforce syntactically. this explains, for instance, german <u>sich selbst</u>.
realizing expressions of doubt in collaborative dialogue. one way to begin a negotiation subdialogue is to express doubt at a proposition. however, expressions of doubt occur in a variety of forms, each of which conveys information about the nature of the doubt that is important for the subsequent resolution of the conflict. this paper presents our work on realizing expressions of doubt appropriately in natural language dialogues.
on parsing preferences. it is argued that syntactic preference principles such as <u>right association</u> and <u>minimal attachment</u> are unsatisfactory as usually formulated. among the difficulties are: (1) dependence on ill-specified or implausible principles of parser operation; (2) dependence on questionable assumptions about syntax; (3) lack of provision, even in principle, for integration with semantic and pragmatic preference principles; and (4) apparent counterexamples, even when discounting (1)--(3). a possible approach to a solution is sketched.
implicitness as a guiding principle in machine translation. multilingual extensibility requires an mt system to have a language-independent pivot. it is argued that an ideal, purely semantic pivot is impossible. a translation method is described in which semantic relations are kept implicit in syntax, while the semantic and distinctions are implicit in the words of a full-fledged language used as pivot.
interleaved semantic interpretation in environment-based parsing. this paper extends a polynomial-time parsing algorithm that resolves structural ambiguity in input sentences by calculating and comparing the denotations of rival constituents, given some model of the application environment (schuler, 2001). the algorithm is extended to incorporate a full set of logical operators, including quantifiers and conjunctions, into this calculation without increasing the complexity of the overall algorithm beyond polynomial time, both in terms of the length of the input and the number of entities in the environment model.
anaphoric reference to events and actions: a representation and its advantages. this paper focuses on anaphora interpreted as referring to entities of type event and action. it considers two issues: (i) what aspects of the discourse give evidence of the events and the actions the speaker is talking about, and (ii) how actions and events are represented in the discourse in order to be able to refer to them anaphorically.
language without a central pushdown stack. we will attempt to show how human performance limitations on various types of syntactic embedding constructions in germanic languages can be modelled in a relational network linguistic framework. after arguing against centralized data stores such as pushdown stacks and queues, we will demonstrate how interconnections among levels of linguistic structure can account for many of the psycholinguistic facts.
antonymy and conceptual vectors. for meaning representations in nlp, we focus our attention on thematic aspects and conceptual vectors. the learning strategy of conceptual vectors relies on a morphosyntaxic analysis of human usage dictionary definitions linked to vector propagation. this analysis currently doesn't take into account negation phenomena. this work aims at studying the antonymy aspects of negation, in the larger goal of its integration into the thematic analysis. we present a model based on the idea of symmetry compatible with conceptual vectors. then, we define antonymy functions which allows the construction of an antonymous vector and the enumeration of its potentially antinomic lexical items. finally, we introduce a measure which evaluates how a given word is an acceptable antonym for a term.
sensitive parsing: error analysis and explanation in an intelligent language tutoring system. we present a uniform framework for dealing with errors in natural language sentences within the context of automated second language teaching. the idea is to use a feature grammar and to analyse errors as being sentences where features have other values than those they should have. by using a feature grammar it is possible to describe various types of errors (agreement, syntactic and semantic errors) in a uniform framework, to define in a clear and transparent way what an error is and - this is very important for our application - to analyse errors as arising form a misunderstanding or ignorance of grammatical rules on the part of students.
extending the expressive capacity of the semantic component of the opera system. opera is a natural language question answering system allowing the interrogation of a data base consisting of an extensive listing of operas. the linguistic front-end of opera is a comprehensive grammar of french, and its semantic component translates the syntactic analysis into logical formulas (first order logic formulas).however there are quite a fiew constructions which can be analysed syntactically in the grammar but for which we are unable to specify translations. foremost among these are anaphoric and elliptic contructions. thus this paper describes the extension of opera to anaphoric and elliptic constructions on the basis of the discourse representation theory (drt).
presentation of the eurolang project. international trade in general and particularly the single european market will bring about a considerable increase in the already huge documentation market. nlp products will contribute to improving the competitiveness of industry in this strategic field.the industrial objective of eurolang is thus to provide efficient nlp tools and to give the european business community a better opportunity to maintain a command of multilingual technical and commercial communication.the technical objective of the eurolang project is to build an mt/nlp toolbox, offering a wide range of 'open' and powerful tools, which reflect the state-of-the-art in computing and linguistic techniques. these tools will then be validated via the production of a multilingual mt system based on second generation principles.with respect to the computing aspects, the main technical choices are: portability, maintainability, openness, possibility of evolution and ergonomy. this implies the use of standard techniques and tools (unix, x11, motif, c, sql, sgml).the linguistic developments, based on a syntactico-semantic analysis, will follow an industrial methodology, implying formal linguistic specifications. the use of specialised languages will ensure a better separation between software and lingware, and thus better modularity. the three-phase translation process guarantees the multilingual aspect of the mt system.
a probabilistic method for analyzing japanese anaphora integrating zero pronoun detection and resolution. this paper proposes a method to analyze japanese anaphora, in which zero pronouns (omitted obligatory cases) are used to refer to preceding entities (antecedents). unlike the case of general coreference resolution, zero pronouns have to be detected prior to resolution because they are not expressed in discourse. our method integrates two probability parameters to perform zero pronoun detection and resolution in a single framework. the first parameter quantifies the degree to which a given case is a zero pronoun. the second parameter quantifies the degree to which a given entity is the antecedent for a detected zero pronoun. to compute these parameters efficiently, we use corpora with/without annotations of anaphoric relations. we show the effectiveness of our method by way of experiments.
machine translation based on nlg from xml-db. the purpose of this study is to propose a new method for machine translation. we have proceeded through with two projects for report generation (kittredge and polguere, 2000): weather forecast and monthly economic report to be produced in four languages: english, japanese, french, and german. their input data is stored in xml-db. we applied a three-stage pipelined architecture (reiter and dale, 2000), and each stage was implemented as xml transformation processes. we regard xml stored data as language-neutral intermediate form and employ the so-called 'sublanguage approach' (somers, 2000). the machine translation process is implemented via xml-db as a kind of interlingua approach instead of the conventional structure transfer approach.
japanese dependency analysis using a deterministic finite state transducer. a deterministic finite state transducer is a fast device for analyzing strings. it takes o(n) time to analyze a string of length n. in this paper, an application of this technique to japanese dependency analysis will be described. we achieved the speed at a small cost in accuracy. it takes about 0.17 millisecond to analyze one sentence (average length is 10 bunsetsu, based on pentiumiii 650mhz pc, linux) and we actually observed the analysis time to be proportional to the sentence length. the accuracy is about 81% even though very little lexical information is used. this is about 17% and 9% better than the default and a simple system, respectively. we believe the gap between our performance and the best current performance on the same task, about 7%, can be filled by introducing lexical or semantic information.
modeling topic coherence for speech recognition. statistical language models play a major role in current speech recognition systems. most of these models have focussed on relatively local interactions between words. recently, however, there have been several attempts to incorporate other knowledge sources, in particular longer-range word dependencies, in order to improve speech recognizers. we will present one such method, which tries to antomatically utilize properties of topic continuity. when a base-line speech recognition system generates alternative hypotheses for a sentence, we will utilize the word preferences based on topic coherence to select the best hypothesis. in our experiment, we achieved a 0.65% improvement in the word error rate on top of the base-line system. it corresponds to 10.40% of the possible word error improvement.
japanese named entity extraction evaluation - analysis of results. we will report on one of the two tasks in the irex (information retrieval and extraction exercise) project, an evaluation-based project for information retrieval and information extraction in japanese (sekine and isahara, 2000) (irex committee, 1999). the project started in 1998 and concluded in september 1999 with many participants and collaborators (45 groups in total from japan and the us). in this paper, the named entity (ne) task is reported. it is a task to extract ne's, such as names of organizations, persons, locations and artifacts, time expressions and numeric expressions from newspaper articles. first, we will explain the task and the definition, as well as the data we created and the results. second, the analyses of the results will be described, which include analysis of task difficulty across the ne types and system types, analysis of domain dependency and comparison to human performance.
backward beam search algorithm for dependency analysis of japanese. backward beam search for dependency analysis of japanese is proposed. as dependencies normally go from left to right in japanese, it is effective to analyze sentences backwards (from right to left). the analysis is based on a statistical method and employs a beam search strategy. based on experiments varying the beam search width, we found that the accuracy is not sensitive to the beam width and even the analysis with a beam width of 1 gets almost the same dependency accuracy as the best accuracy using a wider beam width. this suggested a deterministic algorithm for backwards japanese dependency analysis, although still the beam search is effective as the n-best sentence accuracy is quite high. the time of analysis is observed to be quadratic in the sentence length.