waashk/dblp huggingface dataset:
bootstrapping named entity recognition with automatically generated gazetteer lists. current named entity recognition systems suffer from the lack of hand-tagged data as well as degradation when moving to other domain. this paper explores two aspects: the automatic generation of gazetteer lists from unlabeled data; and the building of a named entity recognition system with labeled and unlabeled data.
mathematical aspects of command relations. in gb, the importance of phrase-structure rules has dwindled in favour of nearness conditions. today, nearness conditions play a major role in defining the correct linguistic representations. they are expressed in terms of special binary relations on trees called command relations. yet, while the formal theory of phrase-structure grammars is quite advanced, no formal investigation into the properties of command relations as been done. we will try to close this gap. in particular, we will study the intrinsic properties of command relations has relations on trees as well as the possibility to reduce nearness conditions expressed by command relations to phrase-structure rules.
suregen-2: a shell system for the generation of clinical documents. suregen-2 applications are intended for use as add-on modules for clinical information systems. currently, suregen-2 permits refinement of the predefined medical ontology, specification of text plans and description knowledge for objects of the ontology. it has built-in constructs for referential expressions, aggregation, enumeration and recurrent semantic constellations. a first application built with suregen-2, which currently supports german only, is in routine use.
the multilingual named entity recognition framework. this paper presents a multilingual system designed to recognize named entities in a wide variety of languages (currently more than 12 languages are concerned). the system includes original strategies to deal with a wide variety of encoding character sets, analysis strategies and algorithms to process these languages.
an open-source environment for compiling typed unification grammars into speech recognisers. we present regulus, an open source environment which compiles typed unification grammars into context free grammar language models compatible with the nuance toolkit. the environment includes a large general unification grammar of english and corpus-based tools for creating efficient domain-specific recognisers from it. we will demo applications built using the system, including a speech translator and a command and control system for a simulated robotic domain, and show how the development environment can be used to edit and extend them.
information structure in topological dependency grammar. topological dependency grammar (tdg) is a lexicalized dependency grammar formalism, able to model languages with a relatively free word order. in such languages, word order variation often has an important function: the realization of information structure. the paper discusses how to integrate information structure into tdg, and presents a constraint-based approach to modelling information structure and the various means to realize it, focusing on (possibly simultaneous use of) word order and tune.
some remarks on case relations. the topic of the paper is the problem how to define case relations by semantic predicates. a general principle is outlined, which renders it possible to "calculate" case relations for a given representation of a (verb-)sememe by means of expressions. this principle is based on an assignment of case relations to primitive predicates and modification rules for nested expressions. contrary to the traditional case grammar it turns out that one needs mixed case relations, especially for two reasons: arguments occur at "too different" places in an expression or arguments have combined case relations. the consequence is that case relations don't form a set of isolated elements but a structured system.
a formal representation of propositions and temporal adverbials. the topic of the paper is the introduction of a formalism that permits a homogeneous representation of definite temporal adverbials, temporal quantifications (as frequency and duration), temporal conjunctions and tenses, and of their combinations with propositions. this unified representation renders it possible to show how these components refer to each other and interact in creating temporal meanings. the formal representation is based on the notions "phase-set" and "phase-operator", and it involves an interval logic. furthermore logical connections are used, but the (always troublesome) logical quantifications may be avoided. the expressions are rather near to linguistic structures, which facilitates the link to text analysis. some emprical confirmations are outlined.
µ-tbl lite: a small, extendible transformation-based learner. this short paper describes - and in fact gives the complete source for - a tiny prolog program implementing a flexible and fairly efficient transformation-based learning (tbl) system.
detecting novel compounds: the role of distributional evidence. research on the discovery of terms from corpora has focused on word sequences whose recurrent occurrence in a corpus is indicative of their terminological status, and has not addressed the issue of discovering terms when data is sparse. this becomes apparent in the case of noun compounding, which is extremely productive: more than half of the candidate compounds extracted from a corpus are attested only once. we show how evidence about established (i.e., frequent) compounds can be used to estimate features that can discriminate rare valid compounds from rare nonce terms in addition to a variety of linguistic features than can be easily gleaned from corpora without relying on parsed text.
determinants of adjective-noun plausibility. this paper explores the determinants of adjective-noun plausibility by using correlation analysis to compare judgements elicited from human subjects with five corpus-based variables: co-occurrence frequency of the adjective-noun pair, noun frequency, conditional probability of the noun given the adjective, the log-likelihood ratio, and resnik's (1993) selectional association measure. the highest correlation is obtained with the co-occurrence frequency, which points to the strongly lexicalist and collocational nature of adjective-noun combinations.
a semantics and pragmatics for the pluperfect. we offer a semantics and pragmatics of the pluperfect in narrative discourse. we examine in a formal model of implicature, how the reader's knowledge about the discourse, gricean-maxims and causation contribute to the meaning of the pluperfect. by placing the analysis in a theory where the interactions among these knowledge resources can be precisely computed, we overcome some problems with previous reichenbachian approaches.
temporal connectives in a discourse context. we examine the role of temporal connectives in multi-sentence discourse. in certain contexts, sentences containing temporal connectives that are equivalent in temporal structure can fail to be equivalent in terms of discourse coherence. we account for this by offering a novel, formal mechanism for accommodating the presuppositions in temporal subordinate clauses. this mechanism encompasses both accommodation by discourse attachment and accomodation by temporal addition. as such, it offers a precise and systematic model of interactions between presupposed material, discourse context, and the reader's background knowledge. we show how the results of accommodation help to determine a discourse's coherence.
an indexing technique for implementing command relations. command relations are important tools in linguistics, especially in anaphora theory. in this paper i present an indexing technique which allows us to implement a simple and efficient check for most cases of command relations which have been presented in linguistic literature. i also show a wide perspective of applications for the indexing technique in the implementation of other linguistic phenomena in syntax as well as in semantics.
morphology in the eurotra base level concept. in recent years the nature and the role of a morphological component in nlp systems has attracted a lot of attention.the two-level model of koskenniemi which relates graphemic to morphological structure has been succesfully implemented in the form of finite state automata.in eurotra a solution which combines morphological and surface syntactic processing in one cfg implemented in a unification grammar framework has been tried out. this article contrasts these two approaches considering especially the feasibility of building morphological modules for a big multilingual mt system in a decentralised r & d project.
criteria for measuring term recognition. this paper qualifies what a true term-recognition systems would have to recognize. the exact bracketing of the maximal termform is then proposed as an achieveable goal upon which current system performance should be measured. how recall and precision metrics are best adapted for measuring term recognition is suggested.
bidirectional parsing of lexicalized tree adjoining grammars. in this paper a bidirectional parser for lexicalized tree adjoining grammars will be presented. the algorithm takes advantage of a peculiar characteristic of lexicalized tags, i.e. that each elementary tree is associated with a lexical item, called its anchor. the algorithm employs a mixed strategy: it works bottom-up from the lexical anchors and then expands (partial) analyses making top-down predictions. even if such an algorithm does not improve the worst-case time bounds of already known tags parsing methods, it could be relevant from the perspective of linguistic information processing, because it employs lexical information in a more direct way.
towards efficient parsing with proof-nets. this paper presents a method for parsing associative lambek grammars based on graph-theoretic properties. connection graphs, which are a simplified version of proof-nets, are actually a mere conservative extension of the earlier method of syntactic connexion, discovered by ajduckiewicz [1935]. the method amounts to find alternating spannig trees in graphs. a sketch of an algorithm for finding such a tree is provided. interesting properties of time-complexity for this method are expected. it has some similarities with chart-parsing ([k&ouml;ning, 1991, 1992], [hepple, 1992]) but is different at least in the fact that intervals are here edges and words are vertices (or trees) instead of the contrary in classical chart-parsing.
a robust parser based on syntactic information. an extragrammatical sentence is what a normal parser fails to analyze. it is important to recover it using only syntactic information although results of recovery are better if semantic factors are considered. a geneal algorithm for least-errors recognition, which is based only on syntactic information, was proposed by g. lyon to deal with the extragrammaticality. we extended this algorithm to recover extragrammatical sentence into grammatical one in running text. our robust parser with recovery mechanism - extended general algorithm for least-errors recognition - can be easily scaled up and modified because it utilize only syntactic information. to upgrade this robust parser we proposed heuristics through the analysis on the penn treebank corpus. the experimental result shows 68% ~ 77% accuracy in error recovery.
non-deterministic recursive ascent parsing. a purely functional implementation of lr-parsers is given, together with a simple correctness proof. it is presented as a generalization of the recursive descent parser. for non-lr grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. memo-functions also facilitate a simple way to construct a very compact representation of the parse forest. for lr(0) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by kruseman aretz [1] and roberts [2]. extended cf grammars (grammars with regular expressions at the right hand side) can be parsed with a simple modification of the lr-parser for normal cf grammars.
towards a core vocabulary for a natural language system. the desire to construct robust and portable natural language systems has led to research on how a core vocabulary for such systems can be defined. statistical methods and semantic criteria for doing this are discussed and compared. currently it does not seem possible to precisely define the notion of core vocabulary, but it is argued that workable criteria can nevertheless be found. finally it is emphasized that the implementation of a core vocabulary must be seen as a long-range research program rather than as a short-term goal.
language-based environment for natural language parsing. this paper introduces a special programming environment for the definition of grammars and for the implementation of corresponding parsers. in natural language processing systems it is advantageous to have linguistic knowledge and processing mechanisms separated. our environment accepts grammars consisting of binary dependency relations and grammatical functions. well-formed expressions of functions and relations provide constituent surroundings for syntactic categories in the form of two-way automata. these relations, functions, and automata are described in a special definition language.in focusing on high level descriptions a linguist may ignore computational details of the parsing process. he writes the grammar into a dpl-description and a compiler translates it into efficient lisp-code. the environment has also a tracing facility for the parsing process, grammar-sensitive lexical maintenance programs, and routines for the interactive graphic display of parse trees and grammar definitions. translator routines are also available for the transport of compiled code between various lisp-dialects. the environment itself exists currently in interlisp and franzlisp. this paper focuses on knowledge engineering issues and does not enter linguistic argumentation.
learning to identify fragmented words in spoken discourse. disfluent speech adds to the difficulty of processing spoken language utterances. in this paper we concentrate on identifying one disfluency phenomenon: fragmented words. our data, from the spoken dutch corpus, samples nearly 45,000 sentences of human discourse, ranging from spontaneous chat to media broadcasts. we classify each lexical item in a sentence either as a completely or an incompletely uttered, i.e. fragmented, word. the task is carried out both by the ib 1 and ripper machine learning algorithms, trained on a variety of features with an extensive optimization strategy. our best classifier has a 74.9% f-score, which is a significant improvement over the baseline. we discuss why memory-based learning has more success than rule induction in correctly classifying fragmented words.
a flexible natural language parser based on a two-level representation of syntax. in this paper we present a parser which a<u>l</u> lows to make explicit the interconnections between syntax and semantics, to analyze the sentences in a quasi-deterministic fashion and, in many cases, to identify the roles of the various constituents even if the sentance is ill-formed. the main fe<u>a</u>ture of the approach on which the parser is based consists in a two-level representation of the sy<u>n</u>tactic knowledge: a first set of rules emits h<u>y</u>potheses about the constituents of the sentence and their functional role and another set of rules verifies whether a hypothesis satisfies the co<u>n</u>straints about the well-formedness of sentences. however, the application of the second set of rules is delayed until the semantic knowledge co<u>n</u>firms the acceptability of the hypothesis. if the semantics reject it, a new hypothesis is obtained by applying a simple and relatively unexpensive "natural" modification; a set of these modific<u>a</u>tions is predefined and only when none of them is applicable a real backup is performed: in most cases this situation corresponds to a case where people would normally garden path.
lambek theorem proving and feature unification. feature unification can be integrated with lambek theorem proving in a simple and straightforward way. two principles determine all distribution of features in ltp. it is not necessary to stipulate other principles or include category-valued features where other theories do. the structure of categories is discussed with respect to the notion of category structure of gazdar et al. (1988).
contents and evaluation of the first slovenian-german online dictionary. this paper presents the first slovenian-german and german-slovenian online dictionary and contains evaluation figures for its slovenian part. evaluations are based on coverage of a slovenian newspaper corpus as well as on user queries.
computational semantics of mass terms. although the formalisms normally used for describing the semantics of natural languages are far from computationally tractable, it is possible to isolate particular semantic phenomena and interpret them within simpler formal systems. quantified mass noun phrases is one such part. we describe a simple formal system suitable for the interpretation of quantified mass noun phrases. the main issue of this paper is to develop an algorithm for deciding the validity of sentences in the formal system and hence for deciding the validity of natural language inferences where all the involved noun phrases are quantified mass noun phrases. the decision procedure is based on a tableau calculus.
repair strategies for lexicalized tree grammars. this paper presents a framework for the definition of monotonic repair rules on chart items and lexicalized tree grammars. we exploit island representations and a new level of granularity for the linearization of a tree called connected routes. it allows to take into account the topology of the tree in order to trigger additional rules. these local rules cover ellipsis and common extra-grammatical phenomena such as self-repairs. first results with a spoken language corpora are presented.
sublanguages in machine translation. there have been various attempts at using the sublanguage notion for disambiguation and the selection of target langauge equivalents in machine translation. in this paper a theoretical concept and its implementation in a real mt application are presented. above this, means of linguistic engineering like weighting mechanisms are proposed.
a fast partial parse of natural language sentences using a connectionist method. the pattern matching capabilities of neural networks can be used to locate syntactic constituents of natural language. this paper describes a fully automated hybrid system, using neural nets operating within a grammatic framework. it addresses the representation of language for connectionist processing, and describes methods of constraining the problem size. the function of the network is briefly explained, and results are given.
pearl: a probabilistic chart parser. this paper describes a natural language parsing algorithm for unrestricted text which uses a probability-based scoring function to select the "best" parse of a sentence. the parser, pearl, is a time-asynchronous bottom-up chart parser with earley-type top-down prediction which pursues the highest-scoring theory in the chart, where the score of a theory represents the extent to which the context of the sentence predicts that interpretation. this parser differs from previous attempts at stochastic parsers in that it uses a richer form of conditional probabilities based on context to predict likelihood. pearl also provides a framework for incorporating the results of previous work in part-of-speech assignment, unknown word models, and other probabilistic models of linguistic features into one parsing tool, interleaving these techniques instead of using the traditional pipeline architecture. in preliminary tests, pearl has been successful at resolving part-of-speech and word (in speech processing) ambiguity, determining categories for unknown words, and selecting correct parses first using a very loosely fitting covering grammar.
deterministic consistency checking of lp constraints. we provide a constraint based computational model of linear precedence as employed in the hpsg grammar formalism. an extended feature logic which adds a wide range of constraints involving precedence is described. a sound, complete and terminating deterministic constraint solving procedure is given. deterministic computational model is achieved by weakening the logic such that it is sufficient for linguistic applications involving word-order.
complementing wordnet with roget's and corpus-based thesauri for information retrieval. this paper proposes a method to overcome the drawbacks of wordnet when applied to information retrieval by complementing it with roget's thesaurus and corpus-derived thesauri. words and relations which are not included in wordnet can be found in the corpus-derived thesauri. effects of polysemy can be minimized with weighting method considering all query terms and all of the thesauri. experimental results show that our method enhances information retrieval performance significantly.
the tipster summac text summarization evaluation. the tipster text summarization evaluation (summac) has established definitively that automatic text summarization is very effective in relevance assessment tasks. summaries as short as 17% of full text length sped up decision-making by almost a factor of 2 with no statistically significant degradation in f-score accuracy. summac has also introduced a new intrinsic method for automated evaluation of informative summaries.
case role filling as a side effect of visual search. this paper addresses the problem of generating communicatively adequate extended responses in the absence of specific knowledge concerning the intensions of the questioner. we formulate and justify a heuristic for the selection of optional deep case slots not contained in the question as candidates for the additional information contained in an extended response. it is shown that, in a visually present domain of discourse, case role filling for the construction of an extended response can be regarded as a side effect of the visual search necessary to answer a question containing a locomotion verb. the paper describes the various representation constructions used in the german language dialog system ham-ans for dealing with the semantics of locomotion verbs and illustrates their use in generating extended responses. in particular, we outline the structure of the geometrical scene description, the representation of events in a logic-oriented semantic representation language, the case-frame lexicon and the representation of the referential semantics based on the flavor system. the emphasis is on a detailed presentation of the application of object-oriented programming methods for coping with the semantics of locomotion verbs. the process of generating an extended response is illustrated by an extensively annotated trace.