waashk/dblp huggingface dataset:
qualifier: question answering by lexical fabric and external resources. one of the major challenges in trec-style question-answering (qa) is to overcome the mismatch in the lexical representations in the query space and document space. this is particularly severe in qa as exact answers, rather than documents, are required in response to questions. most current approaches overcome the mismatch problem by employing either data redundancy strategy through the use of web or linguistic resources. this paper investigates the integration of lexical relations and web knowledge to tackle this problem. the results obtained on trec11 qa corpus indicate that our approach is both feasible and effective.
detection of japanese homophone errors by a decision list including a written word as a default evidence. in this paper, we propose a practical method to detect japanese homophone errors in japanese texts. it is very important to detect homophone errors in japanese revision systems because japanese texts suffer from homophone errors frequently. in order to detect homophone errors, we have only to solve the homophone problem. we can use the decision list to do it because the homophone problem is equivalent to the word sense disambiguation problem. however, the homophone problem is different from the word sense disambiguation problem because the former can use the written word but the latter cannot. in this paper, we incorporate the written word into the original decision list by obtaining the identifying strength of the written word. the improved decision list can raise the f-measure of error detection.
a tradeoff between compositionality and complexity in the semantics of dimensional adjectives. linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far, fast-slow, etc. semantic analyses of the dimensional adjectives differ on whether the meaning of the differential comparative (6 cm shorter than) and the equative with factor term (three times as long as) is a compositional function of the meanings the difference and factor terms (6 cm and three times) and the meanings of the simple comparative and equative, respectively. the compositional treatment comes at the price of a meaning representation that some authors ([pinkal, 1990], [klein, 1991]) find objectionally unparsimonious. in this paper, i compare semantic approaches by investigating the complexity of reasoning that they entail; specifically, i show the complexity of constraint propagation over real-valued intervals using the waltz algorithm in a system where the meaning representations of sentences appear as constraints (cf. [davis, 1987]). it turns out that the compositional account is more complex on this measure. however, i argue that we face a tradeoff rather than a knock-down argument against compositionality, since the increased complexity of the compositional approach may be manageable if certain assumptions about the application domain can be made.
focusing on scenario recognition in infomation extraction. this paper reports a research effort in information extraction, especially in template pattern matching. our approach uses reach domain knowledge in the football (soccer) area and logical form representation for necessary inferences of facts and templates filling. our system fret1 (football reports extraction templates) is compatible to the language-engineering environment gate and handles its internal representations and some intermediate analysis results.
development of corpora within the clark system: the bultreebank project experience. clark is an xml-based software system for corpora development. it incorporates several technologies: xml technology; unicode; regular cascaded grammars; constraints over xml documents. the basic components of the system are: a tagger, a concordancer, an extractor, a grammar processor, a constraint engine.
an evaluation of metal: the lrc machine translation system. the linguistics research center (lrc) at the university of texas at austin is currently developing metal, a fully-automatic high quality machine translation system, for market introduction in 1985. this paper will describe the current status of metal, emphasizing the results of the most recent post-editors' evaluation, and will briefly indicate some future directions for the system. a 6-page german original text and a raw (unedited, but automatically reformatted) metal translation of that text into english are included as appendices.
describing syntax with star-free regular expressions. syntactic constraints in koskenniemi's finite-state intersection grammar (fsig) are logically less complex than their formalism (koskenniemi et al., 1992) would suggest: it turns out that although the constraints in voutilainen's (1994) fsig description of english make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, complement and concatenation. this is an essential improvement to the descriptive complexity of engfsig. the result opens a door for further analysis of logical properties and possible optimizations in the fsig descriptions. the proof contains a new formula for compiling koskenniemi's restriction operation without any marker symbols.
summarizing neonatal time series data. we describe our investigations in generating textual summaries of physiological time series data to aid medical personnel in monitoring babies in neonatal intensive care units. our studies suggest that summarization is a communicative task that requires data analysis techniques for determining the content of the summary. we describe a prototype system that summarizes physiological time series.
a unified management and processing of word-forms, idioms and analytical compounds. the paper presents a morpho-lexical environment, designed for the management of root-oriented natural language dictionaries. it also encapsulates the basic morpho-lexical processings: analysis and synthesis of individual word-forms or compounds (idioms and analytic constructions).
automatic authorship attribution. in this paper we present an approach to automatic authorship attribution dealing with real-world (or unrestricted) text. our method is based on the computational analysis of the input text using a text-processing tool. besides the style markes relevant to the output of this tool we also use analysis-dependent style markers, that is, measures that represent the way in which the text has been processed. no word frequency counts, nor other lexically-based measures are taken into account. we show that the proposed set of style markers is able to distinguish texts of various authors of a weekly newspaper using multiple regression. all the experiments we present were performed using real-world text downloaded from the world wide web. our approach is easily trainable and fully-automated requiring no manual text preprocessing nor sampling.
new frontiers beyond context-freeness: di-grammars and di-automata. a new class of formal languages will be defined - the distributed index languages (di-languages). the grammar-formalism generating the new class - the di-grammars - cover unbound dependencies in a rather natural way. the place of di-languages in the chomsky-hierarchy will be determined: like aho's indexed languages, di-languages represent a proper subclass of type 1 (contextsensitive languages) and properly include type 2 (context-free languages), but the di-class is neither a subclass nor a superclass of aho's indexed class. it will be shown that, apart from di-grammars, di-languages can equivalently be characterized by a special type of automata - di-automata. finally, the time complexity of the recognition-problem for an interesting subclass of di-grammars will approximately be determined.
string-tree correspondence grammar: a declarative grammar formalism for defining the correspondence between strings of terms and tree structures. the paper introduces a grammar formalism for defining the set of sentences in a language, a set of labeled trees (not the derivation trees of the grammar) for the representation of the interpretation of the sentences, and the (possibly non-projective) correspondence between subtrees of each tree and substrings of the related sentence. the grammar formalism is motivated by the linguistic approach (adopted at geta) where a multilevel interpretative structure is associated to a sentence. the topology of the multilevel structure is 'meaning' motivated, and hence its substructures may not correspond projectively to the substrings of the related sentence.
a state-transition grammar for data-oriented parsing. this paper presents a grammar formalism designed for use in data-oriented approaches to language processing. it goes on to investigate ways in which a corpus pre-parsed with this formalism may be processed to provide a probabilistic language model for use in the parsing of fresh texts.
towards reusable linquistic resources. 1. the paper will try to identify the various concurrent factors which, in the last years, have contributed to the increasing attention paid to the issue of reusable linguistic resources for natural language processing. the role of various major organisations (eec, council of europe, darpa, neh, etc.) will be examined, taking into account the reasons which seem to have stimulated their active participation. the recognition of the need of reusable linguistic resources by various sectors of "automated linguistic data processing" will also be considered as a catalyzer for the recent trend towards the cooperation of various scientific and professional associations (acl, allc, ach, etc.).2. various interpretations of the term "reusability" have been proposed. we shall consider the relationships and differences between:- the feasibility of the utilization of existing repositories of linguistic information, as potential sources for the construction of nlp components;- the feasibility of constructing new large linguistic knowledge bases, explicitly designed for multifunctional uses, in various research frameworks and development activities.in particular, we shall examine the connections between various core aspects of the construction of reusable linguistic resources, and- the general problems of the "evaluation" in the field of natural language processing, both at the general level of shareability of the state-of-the-art knowledge, and at the level of specific nlp systems or linguistic data collection;- the design of "standards" at the level of representation formalisms and of the identification of linguistic units and description categories.3. examples will be taken by some of the various international projects nowadays underway in the field of lexica (et7, acquilex, multilex, genelex, the lexical consortium, etc.), corpora (european network of textual corpora, british national corpus, data collection initiative, etc.), and standards (text encoding initiative).4. the paper will review and compare some of the results already acquired, and will state some problems, both at the scientific and organizational level which, in the opinion of the author, are still to be solved, and represent major controversial issues. it is expected that the round table, which will be held during the conference with the participation of the representatives of some of those projects, will discuss these problems and indicate priorities for research, practicable ways towards their solution, and possible convergence of efforts.
relating syntax and semantics: the syntactico-semantic lexicon of the system vie-lang. this paper describes the structure and evaluation of the syntactico-semantic lexicon (ssl) of the german natural language understanding system vie-lang [3]. vie-lang uses an si-net [2] as internal representation. the ssl contains the rules according to which the mapping between net-structures and surface structures of a sentence is carried out. this information is structured in a way that it can be evaluated from two sides. the parser interprets it as production-rules that control the analysis. syntactic and semantic features of the input sentence are evaluated and individuals are created in the semantic net. the generator uses the same rules to express selected net-structures in adequate natural language expressions. it is shown how both processes can make effective use of the ssl. the different possibilities for evaluating the ssl are explained and illustrated by examples.
a corpus-based approach to deriving lexical mappings. this paper proposes a novel, corpusbased, method for producing mappings between lexical resources. results from a preliminary experiment using part of speech tags suggests this is a promising area for future research.
developments in affect detection in e-drama. we report work in progress on adding affect-detection to an existing program for virtual dramatic improvisation, monitored by a human director. to partially automate the directors' functions, we have partially implemented the detection of emotions, etc. in users' text input, by means of pattern-matching, robust parsing and some semantic analysis. the work also involves basic research into how affect is conveyed by metaphor.
automatic verb classification using distributions of grammatical features. we apply machine learning techniques to classify automatically a set of verbs into lexical semantic classes, based on distributional approximations of diatheses, extracted from a very large annotated corpus. distributions of four grammatical features are sufficient to reduce error rate by 50% over chance. we conclude that corpus data is a usable repository of verb class information, and that corpus-driven extraction of grammatical features is a promising methodology for automatic lexical acquisition.
question answering using web news as knowledge base. answerbus news engine1 is a question answering system using the contents of cnn web site2 as its knowledge base. comparing to other question answering systems including its previous versions, it has a totally independent crawling and indexing system and a fully functioning search engine. because of its dynamic and continuous indexing, it is possible to answer questions on just-happened facts. again, it reaches high correct answer rate. in this demonstration we will present the living system as well as its new technical features.
distributives, quantifiers and a multiplicity of events. with the intention of indicating some temporal/event-theoretic characteristics of distributive clauses, a generalisation is made over distributives and clauses marked for iterative aspect: two kinds of semantic phenomena which have normally been confined to separate theoretical domains. it is shown that in particular, both give rise to an 'inferential set construction' problem. an informal outline is given of what might constitute such a generalisation. the generalisation is proposed intially on grounds of prima facie plausibility, but its ultimate defensibility and explanatory value will depend on the validity of its consequence, that distributive clauses entail a multiplicity of temporal entities or events. this proposal is considered with respect to two types of discourse phenomena; anaphoric reference to event entities, and temporal binding. these provide further support for making the generalisation, clarify its nature and indicate in what respect the entailment claim can be true of distributives. the set construction problem is of practical importance for computational models of natural language interaction, and since the concept of iterated action is central to planning, the generalisation across iteration and distributives, along with the observations about their nature, have interesting implications for work in this area.
theoretical evaluation of estimation methods for data-oriented parsing. we analyze estimation methods for data-oriented parsing, as well as the theoretical criteria used to evaluate them. we show that all current estimation methods are inconsistent in the "weight-distribution test", and argue that these results force us to rethink both the methods proposed and the criteria used.
coping with dynamic syntactic strategies: an experimental environment for an experimental parser. an environment built around wednesday 2, a chart based parser is introduced. the environment is in particular oriented towards exploring dynamic aspects of parsing. it includes a number of specialized tools that consent an easy, graphics-based interaction with the parser. it is shown in particular how a combination of the characteristics of the parser(based on the lexicon and on dynamic unification) and of the environment allow a nonspecialized user to explore heuristics that may alter the basica control of the system. in this way, for instance, a psycholinguist may explore ideas on human parsing strategies, or a "language engineer" may find useful heuristics for parsing within a particular application.
learning-based named entity recognition for morphologically-rich, resource-scarce languages. named entity recognition for morphologically rich, case-insensitive languages, including the majority of semitic languages, iranian languages, and indian languages, is inherently more difficult than its english counterpart. worse still, progress on machine learning approaches to named entity recognition for many of these languages is currently hampered by the scarcity of annotated data and the lack of an accurate part-of-speech tagger. while it is possible to rely on manually-constructed gazetteers to combat data scarcity, this gazetteer-centric approach has the potential weakness of creating irreproducible results, since these name lists are not publicly available in general. motivated in part by this concern, we present a learning-based named entity recognizer that does not rely on manually-constructed gazetteers, using bengali as our representative resource-scarce, morphologically-rich language. our recognizer achieves a relative improvement of 7.5% in f-measure over a baseline recognizer. improvements arise from (1) using induced affixes, (2) extracting information from online lexical databases, and (3) jointly modeling part-of-speech tagging and named entity recognition.
wednesday: parsing flexible word order languages. a parser for "flexible" word order languages must be substantially data driven. in our view syntax has two distinct roles in this connection: (1) to give impulses for assembling cognitive representations, (ii) to structure the space of search for fillers. wednesday is an interpreter for a language describing the lexicon and operating on natural language sentences. the system operates from left to right, interpreting the various words comprising the sentence one at a time. the basic ideas of the approach are the following:a) to introduce into the lexicon linguistic knowledge that in other systems is in a centralized module. the lexicon therefore carries not only morphological data and semantic descriptions. also syntactic knowledge is distributed throughout it, partly of a procedural kind.b) to build progressively a cognitive representation of the sentence in the form of a semantic network, in a global space, accessible from all levels of the analysis.c) to introduce procedures invoked by the words themselves for syntactic memory management. simply stated, these procedures decide on the opening, closing, and mantaining of search spaces; they use detailed constraints and take into account the active expectations.wednesday is implemented in magma-lisp and with a stress on the non-deterministic mechanism.
rich bitext projection features for parse reranking. many different types of features have been shown to improve accuracy in parse reranking. a class of features that thus far has not been considered is based on a projection of the syntactic structure of a translation of the text to be parsed. the intuition for using this type of bitext projection feature is that ambiguous structures in one language often correspond to unambiguous structures in another. we show that reranking based on bitext projection features increases parsing accuracy significantly.
parsetalk about sentence- and text-level anaphora. we provide a unified account of sentence-level and text-level anaphora within the framework of a dependency-based grammar model. criteria for anaphora resolution within sentence boundaries rephrase major concepts from gb's binding theory, while those for text-level anaphora incorporate an adapted version of a grosz-sidner-style focus model.
text summarization model based on maximum coverage problem and its variant. we discuss text summarization in terms of maximum coverage problem and its variant. we explore some decoding algorithms including the ones never used in this summarization formulation, such as a greedy algorithm with performance guarantee, a randomized algorithm, and a branch-and-bound method. on the basis of the results of comparative experiments, we also augment the summarization model so that it takes into account the relevance to the document cluster. through experiments, we showed that the augmented model is superior to the best-performing method of duc'04 on rouge-1 without stopwords.
incorporating "unconscious reanalyses" into an incremental, monotonic parser. this paper describes the author's implementation of a parser aimed at reproducing, in a computationally explicit system, the constraints of a particular psycholinguistic model (gorrell in press). in gorrell's model, "unconscious" garden paths may be processed via the addition of structural relations to a monotone increasing set at the point of disambiguation, but there is no discussion as to how the parser decides which relations to add. we model this decision as a search for a node in the tree at which an explicitly defined parsing operation, tree-lowering may be applied. with reference to english and japanese processing data, we show the importance of this search for empirical adequacy of the psycholinguistic model.
generating spatio-temporal descriptions in pollen forecasts. we describe our initial investigations into generating textual summaries of spatiotemporal data with the help of a prototype natural language generation (nlg) system that produces pollen forecasts for scotland.
a corpus-centered approach to spoken language translation. this paper reports the latest performance of components and features of a project named corpus-centered computation (c3), which targets a translation technology suitable for spoken language translation. c3 places corpora at the center of the technology. translation knowledge is extracted from corpora by both ebmt and smt methods, translation quality is gauged by referring to corpora, the best translation among multiple-engine outputs is selected based on corpora and the corpora themselves are paraphrased or filtered by automated processes.
sequential labeling with latent variables: an exact inference algorithm and its efficient approximation. latent conditional models have become popular recently in both natural language processing and vision processing communities. however, establishing an effective and efficient inference method on latent conditional models remains a question. in this paper, we describe the latent-dynamic inference (ldi), which is able to produce the optimal label sequence on latent conditional models by using efficient search strategy and dynamic programming. furthermore, we describe a straightforward solution on approximating the ldi, and show that the approximated ldi performs as well as the exact ldi, while the speed is much faster. our experiments demonstrate that the proposed inference algorithm outperforms existing inference methods on a variety of natural language processing tasks.