waashk/dblp huggingface dataset:
learning linear precedence rules. a system is described which learns from examples the linear precedence rules in an immediate dominance/linear precedence grammar. given a particular immediate dominance grammar and hierarchies of feature values potentially relevant for linearization (=the system's bias), the learner generates appropriate natural language expressions to be evanaluted as positive or negative by a teacher, and produces as output linear precedence rules which can be directly used by the grammar.
generating a coherent text describing a traffic scene. if a system that embodies a reference semantic for motion verbs and prepositions is to generate a coherent text describing the recognized motions it needs a decision procedure to select the events. in naos event selection is done by use of a specialization hierarchy of motion verbs. the strategy of anticipated visualization is used for the selection of optional deep cases. the system exhibits low-level strategies which are based on verbinherent properties that allow the generation of a coherent descriptive text.
the lingo redwoods treebank: motivation and preliminary applications. the lingo redwoods initiative is a seed activity in the design and development of a new type of treebank. while several medium- to large-scale treebanks exist for english (and for other major languages), pre-existing publicly available resources exhibit the following limitations: (i) annotation is mono-stratal, either encoding topological (phrase structure) or tectogrammatical (dependency) information, (ii) the depth of linguistic information recorded is comparatively shallow, (iii) the design and format of linguistic representation in the treebank hard-wires a small, predefined range of ways in which information can be extracted from the treebank, and (iv) representations in existing treebanks are static and over the (often year- or decade-long) evolution of a large-scale treebank tend to fall behind the development of the field. lingo redwoods aims at the development of a novel treebanking methodology, rich in nature and dynamic both in the ways linguistic data can be retrieved from the treebank in varying granularity and in the constant evolution and regular updating of the treebank itself. since october 2001, the project is working to build the foundations for this new type of treebank, to develop a basic set of tools for treebank construction and maintenance, and to construct an initial set of 10,000 annotated trees to be distributed together with the tools under an open-source license.
soat: a semi-automatic domain ontology acquisition tool from chinese corpus. in this paper, we focus on the domain ontology acquisition from chinese corpus by extracting rules designed for chinese phrases. these rules are noun sequences with part-of-speech tags. experiments show that this process can construct domain ontology prototypes efficiently and effectively.
on formalizations of marcus' parser. lr(k,t), bcp (m,n) and lrrl (k) grammars, and their relations to marcus parsing are discussed.
on the semantic interpretation of nominals. in this paper we examine a subset of polysemous elements, the logical structure of nominals, and argue that many cases of polysemy have well-defined calculi, which interact with the grammar in predictable and determinate ways for disambiguation. these calculi constitute part of the lexical organization of the grammar and contribute to the lexical semantics of a word. the lexical system of the grammar is distinct from the conceptual representation associated with a lexical item, where polysemy is less constrained by grammar. we propose a structured semantic representation, the lexical conceptual paradigm (lcp) which groups nouns into paradigmatic classes exhibiting like behavior.
hinting by paraphrasing in an instruction system. previous work has amphasized the need for paraphrases as means of ensuring a feedback with a system. in this paper, we discuss how a paraphrase may be used as a heuristic device, viz. as a hint. we describe an experimental instruction system in mathematics incorporating this feature. the system accepts a restricted class of algebraic story problems, formulated in non-stylized bulgarian language, and is capable of solving them and providing one or more "hinting" paraphrases, that is, paraphrases alleviating their formalisation (-translation into equations).
parsing a flexible word order language. a logic formalism is presented which increases the expressive power of the id/lp format of gpsg by enlarging the inventory of ordering relations and extending the domain of their application to non-siblings. this allows a concise, modular and declarative statement of intricate word order regularities.
testing the projectivity hypothesis. the empirical validity of the projectivity hypothesis for bulgarian is tested. it is shown that the justification of the hypothesis presented for other languages suffers serious methodological deficiencies. our automated testing, designed to evade such deficiencies, yielded results falsifying the hypothesis for bulgarian: the non-projective constructions studied were in fact grammatical rather than ungrammatical, as implied by the projectivity thesis. despite this, the projectivity/non-projectivity distinction itself has to be retained in bulgarian syntax and, with some provisions, in the systems for automatic processing as well.
interaction grammars. interaction grammars (ig) are a new linguistic formalism which is based on descriptions of underspecified trees in the framework of intuitionistic linear logic (ill). syntactic composition, which is expressed by deduction in linear logic, is controlled by a system of polarized features. in this way, parsing amounts to generating models of trees descriptions and it is implemented as a constraint satisfaction problem.
elementary contracts as a pragmatic basis of language interaction. language interaction (li) as a part of interpersonal communication is considerably influenced by psychological and social roles of the partners and their pragmatic goals. these aspects of communication should be accounted for while elaborating advanced user-computer dialogue systems and developing formal models of li. we propose here a formal description of communicative context of li-situation, namely, a system of indices of li agents1 interest in achieving various pragmatic purposes and a system of contracts which reflect social and psychological roles of the li agents and conventionalize their "rights" and "duties" in the li process. different values of these parameters of communication allow us to state possibility or/and necessity of certain types of speech acts under certain conditions of li-situation.
new dependency based specification of underlying representations of sentences. in this lecture a pushdown store generator of deep, underlying structures (abbrev. us) of sentences is defined. this generator (a pushdown store generative grammar) developed inside the functional generative description (fgd) of language in prague is the first part (from the viewpoint of the generation of a sentence) of the whole stratificational fgd: the output of the generator (a generated us) is transduced to the lower levels of fgd in the direction from function to form (from weaning, generally, to its representation) in order to achieve the final phonetic (graphic) representation of the sentence. our framework comprises the three basic dimensions of the semantics of the sentence: a) valency frames (thetaroles, types of the dependency relation), b) coordination and apposition, and c) topic-focus articulation. the generative grammar reflects the interplay of the mentioned dimensions endeavouring to simulate more closely the process of the formulation of the sentence by a real speaker.
the impatient tutor: an integrated language understanding system. we describe a language understanding system that uses the techniques of segmenting the computation into autonomous modules that communicate by message passing. the goal is to integrate semantic and syntactic processing to achieve greater flexibility and robustness in the design of language understanding systems.
a message-passing control structure for text understanding. this paper describes an object-oriented, message-passing system for natural language text understanding. the application domain is the texts of texas instruments' patent descriptions. the object-oriented environment permits syntactic analysis modules to communicate with domain knowledge modules to resolve ambiguities as they arise.
a translator's workstation. a description is given of the present state of development of a workstation that has been designed to provide the translator with efficient and easy-to-use computational tools. the aim is to offer translators fast and flexible on-line access to existing dictionary databases and bilingual text archives and also to supply them with facilities for updating, adding to and personalizing the system data archives with their own material.
a computational approach to topic and focus in a production model. the aim of the presented research is the development of a linguistic model of the functional concepts topic and focus that can be used in natural language processing systems. the paper deals with two points of investigation: the first point concerns the identification of the topic and focus of an utterance. within the frame of the linguistic discussion on such concepts topic and focus will be considered as semantic, pragmatic and international rather then as syntactic phenomena. an operational definition of topic and focus is obtained on the basis of basic semantic-pragmatic categories which are defined in relation to a specified context. the second point concerns the integration of the topic and focus identification rules in a system for natural language generation. the aim of the application is the validation of the developed topic and focus model with respect to some aspect of the generation process like thematic progression and accent mapping. moreover the identification of topic and focus can be used to make prediction about the thematic progression and the accent mapping in the blocks world texts. for the prediction of indefinite pronouns like "one" and of definite articles within a noun phrase it is necessary to recur to the semantic-pragmatic categories.
modular mt with a learned bilingual dictionary: rapid deployment of a new language pair. the mt system described in this paper combines hand-built analysis and generation components with automatically learned example-based transfer patterns. up to now, the transfer component used a traditional bilingual dictionary to seed the transfer pattern learning process and to provide fallback translations at runtime. this paper describes an improvement to the system by which the bilingual dictionary used for these purposes is instead learned automatically from aligned bilingual corpora, making the system's transfer knowledge entirely derivable from corpora. we show that this system with a fully automated transfer process performs better than the system with a hand-crafted bilingual dictionary. more importantly, this has enabled us to create in less than one day a new language pair, french-spanish, which, for a technical domain, surpasses the quality bar of the commercial system chosen for comparison.
monotonic paradigmatic schemata in italian verb inflection. in recent years, morphological paradigms have been the focus of an extensive investigation, which has thrown in sharp relief the descriptive adequacy of a paradigm-based approach to the morphology of lightly inflecting languages, with particular emphasis on notoriously thorny problems such as stem selection and stem choice in verb conjugation. comparatively little has been done so far to show the practical descriptive advantages of an extensive use of paradigms in a computational system for word analysis/generation. in this paper we report in some detail the results of a fully developed, paradigm-based, computational treatment of the entire conjugational system of italian. we focus on the considerable descriptive economy resulting from drawing on the amount of redundancy exhibited by the paradigmatic structure of both regular and irregular verbs in italian. this redundancy, we suggest, is captured through so-called paradigmatic schemata. our implementation compares favourably with other nonparadigmatic strategies in terms of both descriptive adequacy and economy.
lr(k)-parsing of coupled-context-free grammars. coupled-context-free grammars are a generalization of context-free grammars obtained by combining nonterminals to parentheses which can only be substituted simultaneously. referring to the generative capacity of the grammars we obtain an infinite hierarchy of languages that comprises the context-free languages as the first and all the languages generated by tree adjoining grammars (tags) as the second element. here, we present a generalization of the context-free lr(k)-notion, which characterizes subclasses of coupled-context-free grammars-and therefore for tags - which can be parsed in linear time. the parsing procedure described works incrementally so that it can be used for on-line parsing of natural language. examples show that important tree adjoining languages, e.g. those modelling cross-serial dependencies, can be generated by lr(k)-coupled-context-free grammars.
a formal semantics for generating and editing plurals. we present a formal semantics for an object-oriented formalism which allows for the representation of plural objects (such as 'three n', most of the n', 'some n', . . .). the semantics is given in terms of a mapping to a variant of discourse representation theory. it is motivated by its suitability for natural language generation and interactives editing of the representations.
tagging and chunking with bigrams. in this paper we present an integrated system for tagging and chunking texts from a certain language. the approach is based on stochastic finite-state models that are learnt automatically. this includes biagram models or finite-state automata learnt using grammatical inference techniques. as the models involved in our system are learnt automatically, this is a very flexible and portable system.in order to show the viability of our approach we present results for tagging and chunking using bigram models on the wall street journal corpus. we have achieved an accuracy rate for tagging of 96.8%, and a precision rate for np chunks of 94.6% with a recall rate of 93.6%.
multi-level similar segment matching algorithm for translation memories and example-based machine translation. @we propose a dynamic programming algorithm for calculating the similarity between two segments of words of the same language. the similarity is considered as a vector whose coordinates refer to the levels of analysis of the segments. this algorithm is extremely efficient for retrieving the best example in translation memory systems. the calculus being constructive, it also gives the correspondences between the words of the two segments. this allows the extension of translation memory systems towards example-based machine translation.
text analysis learning strategies. aplec (l'aprenti-lecteur - or learning reader) is an extension of the d&eacute;redec software, a programming system devoted to the content analysis and linguistic treatment of texts.aplec will associate automatically to any text descriptive grammar (tdg - grammaire descriptive de texte) a question/answer module where the questions are asked in a given natural language by the user, and where the answers are tracked down in the textual corpus undergoing examination.
composition of translation schemes with d-trees. generative systems (gs) are defined in this paper as a composition of simple translation schemes with dependency trees. the following issues are discussed: (a) explicative power of gs, (b) the time complexity for the analysis and synthesis for gs.
generation, lambek calculus, montague's semantics and semantic proof nets. most of the studies in the framework of lambek calculus have considered the parsing process and ignored the generation process. this paper wants to rely on the close link between lambek calculus and linear logic to present a method for the generation process with semantic proof nets. we express the process as a proof search procedure based on a graph calculus and the solutions appear as a matrix computation preserving the decidability properties, and we characterize a polynomial time case.
a syntactic approach to discourse semantics. a correct structural analysis of a discourse is a prerequisite for understanding it. this paper sketches the outline of a discourse grammar which acknowledges several different levels of structure. this grammar, the "dynamic discourse model", uses an augmented transition network parsing mechanism to build a representation of the semantics of a discourse in a stepwise fashion, from left to right, on the basis of the semantic representations of the individual clauses which constitute the discourse. the intermediate states of the parser model the intermediate states of the social situation which generates the discourse.the paper attempts to demonstrate that a discourse may indeed be viewed as constructed by means of sequencing and recursive nesting of discourse constituents. it gives rather detailed examples of discourse structures at various levels, and shows how these structures are described in the framework proposed here.
processing complex noun phrases in a natural language interface to a statistical database. analysis of a corpus of queries to a statistical database has shown considerable variation in the location and order of modifiers in complex noun phrases. nevertheless, restrictions can be defined on nominal modification because of certain correspondences between nominal modifiers and the role they fulfill in a statistical database, notably that the names of database tables and columns, and values of columns, are all determined by the modifiers. these restrictions are described. incorporating these restrictions into head-driven phrase structure grammar (hpsg) has caused us to examine the treatment of nominal modification in hpsg. a new treatment is proposed and an implementation within an hpsg based natural language front-end to a statistical database is described.
data-driven classification of linguistic styles in spoken dialogues. language users have individual linguistic styles. a spoken dialogue system may benefit from adapting to the linguistic style of a user in input analysis and output generation. to investigate the possibility to automatically classify speakers according to their linguistic style three corpora of spoken dialogues were analyzed. several numerical parameters were computed for every speaker. these parameters were reduced to linguistically interpretable components by means of a principal component analysis. classes were established from these components by cluster analysis. unseen input was classified by trained neural networks with varying error rates depending on corpus type. a first investigation in using special language models for speaker classes was carried out.
morphological analysis for a german text-to-speech system. a central problem in speech synthesis with unrestricted vocabulary is the automatic derivation of correct pronunciation from the graphemic form of a text. the software module graphon was developed to perform this conversion for german and is currently being extended by a morphological analysis component. this analysis is based on a morph lexicon and a set of rules and structural descriptions for german word-forms. it provides each text input item with an individual characterization such that the phonological, syntactic, and prosodic components may operate upon it. this systematic approach thus serves to minimize the number of wrong transcriptions and at the same time lays the foundation for the generation of stress and intonation patterns, yielding more intelligible, natural-sounding, and generally acceptable synthetic speech.
data-oriented translation. in this article, we present a statistical approach to machine translation that is based on data-oriented parsing: data-oriented translation (dot). in dot, we use linked subtree pairs for creating a derivation of a source sentence. each linked subtree pair has a certain probability, and consists of two trees: one in the source language and one in the target language. when a derivation has been formed with these subtree pairs, we can create a translation from this derivation. since there are typically many different derivations of the same sentence in the source language, there can be as many different translations for it. the probability of a translation can be calculated as the total probability of all the derivations that form this translation. we give the computational aspects for this model, show that we can convert each subtree pair into a productive rewrite rule, and that the most probable translation can be computed by means of monte carlo disambiguation. finally, we discuss some pilot experiments with the verbmobil corpus.
planning texts by constraint satisfaction. a method is described by which a rhetorical-structure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, and other textual patterns, with discourse connectives added (in the correct positions) to mark rhetorical relations. we show that text-structuring can be formulated as a constraint satisfaction problem, so that all solutions respecting constraints on text-structure formation and structural compatibility can be efficiently generated. of the many solutions generated by this method, some are stylistically preferable to others; we show how further constraints can be applied in order to select the best versions. finally, we discuss some extensions such as the generation of indented text structures.
using a probabilistic class-based lexicon for lexical ambiguity resolution. this paper presents the use of probabilistic class-based lexica for disambiguation in target-word selection. our method employs minimal but precise contextual information for disambiguation. that is, only information provided by the target-verb, enriched by the condensed information of a probabilistic class-based lexicon, is used. induction of classes and fine-tuning to verbal arguments is done in an unsupervised manner by em-based clustering techniques. the method shows promising results in an evaluation on real-world translations.
generalized memory manipulating actions for parsing natural language. current (computational) linguistic theories have developed specific formalisms for representing linguistic phenomena such as unbounded dependencies, relatives, etc. in this contribution we present a model of linguistic structures storing and accessing, which accounts for the same phenomena in a procedural way. such a model has been implemented in the frame of an atn parser.
generating the xtag english grammar using metarules. we discuss a grammar development process used to generate the trees of the wide-coverage lexicalized tree adjoining grammar (ltag) for english of the xtag project. result of the coupling of becker's metarules and a simple yet principled hierarchy of rule application, the approach has been successful to generate the large set of verb trees in the grammar, from a very small initial set of trees.