waashk/dblp huggingface dataset:
complexity of event structure in ie scenarios. this paper presents new information extraction scenarios which are linguistically and structurally more challenging than the traditional muc scenarios. traditional views on event structure and template design are not adequate for the more complex scenarios.the focus of this paper is to show the complexity of the scenarios, and propose a way to recover the structure of the event. first we identify two structural factors that contribute to the complexity of scenarios: the scattering of events in text, and inclusion relationships between events. these factors cause difficulty in representing the facts in an unambiguous way. then we propose a modular, hierarchical representation where the information is split in atomic units represented by templates, and where the inclusion relationships between the units are indicated by links. lastly, we discuss how we may recover this representation from text, with the help of linguistic cues linking the events.
semantic parsing as graph language transformation - a multidimensional approach to parsing highly inflectional languages. the structure of many languages with "free" word order and rich morphology like finnish is rather configurational than linear. although non-linear structures can be represented by linear formalisms it is often more natural to study multidimensional arrangement of symbols. graph grammars are a multidimensional generalization of linear string grammars. in graph grammars string rewrite rules are generalized into graph rewrite rules. this paper presents a graph grammar formalism and parsing scheme for parsing languages with inherent configurational flavor. a small experimental finnish parsing system has been implemented (hyv&ouml;nen 1983).
kana-kanji conversion system with input support based on prediction. we propose a kana-kanji conversion system with input support based on prediction. this system is composed of two parts: prediction of succeeding kanji character strings from typed kana ones, and ordinary kana-kanji conversion. it automatically shows candidates of kanji character strings which the user intends to input. our prediction method features: (i)arbitrary positions of typed kana character strings are regarded as the top of words. (ii)a system dictionary and a user dictionary are used, and each entry in the system dictionary has certainly factor calculated from the frequency of words in corpora. (iii)candidates are estimated by certainty factor and usefulness factor, and likely ones with greater factors than thresholds are shown. the proposed system could reduce the user's key input operations to 78% from the original ones in our experiments.
multext: multilingual text tools and corpora. multext (multilingual text tools and corpora) is the largest project funded in the commission of european communities linguistic research and engineering program. the project will contribute to the development of generally usable software tools to manipulate and analyse text corpora and to create multilingual text corpora with structural and linguistic markup. it will attempt to establish conventions for the encoding of such corpora, building on and contributing to the preliminary recommendations of the relevant international and european standardization initiatives. multext will also work towards establishing a set of guidelines for text software development, which will be widely published in order to enable future development by others. all tools and data developed within the project will be made freely and publicly available.
three typed pragmatics for dialogue structure analysis. an experimental system for dialogue structure analysis based on a new type plan recognition model for spoken dialogues has been implemented. this model is realized by using four typed plans which are categorized into three kinds of universal pragmatics and a kind of task-dependent knowledge related to common action hierarchies. two experimental system is characterized by higher modularity and computational efficiency through defining a hierarchical usage order between these knowledges. the system can grasp a dialogue structure making it possible to solve problems related to spoken dialogue interpretation.
a statistical method for extracting uninterrupted and interrupted collocations from very large corpora. in order to extract rigid expressions with a high frequency of use, new algorithm that can efficiently extract both uninterrupted and interrupted collocations from very large corpora has been proposed.the statistical method recently proposed for calculating n-gram of arbitrary n can be applied to the extraction of uninterrupted collocations. but this method posed problems that so large volumes of fractional and unnecessary expressions are extracted that it was impossible to extract interrupted collocations combining the results. to solve this problem, this paper proposed a new algorithm that restrains extraction of unnecessary substrings. this is followed by the proposal of a method that enable to extract interrupted collocations.the new methods are applied to japanese newspaper articles involving 8.92 million characters. in the case of uninterrupted collocations with string length of 2 or mere characters and frequency of appearance 2 or more times, there were 4.4 millions types of expressions (total frequency of 31.2 millions times) extracted by the n-gram method. in contrast, the new method has reduced this to 0.97 million types (total frequency of 2.6 million times) revealing a substantial reduction in fractional and unnecessary expressions. in the case of interrupted collocational substring extraction, combining the substring with frequency of 10 times or more extracted by the first method, 6.5 thousand types of pairs of substrings with the total frequency of 21.8 thousands were extracted.
semiautomatic labelling of semantic features. this paper presents the strategy and design of a highly efficient semiautomatic method for labelling the semantic features of common nouns, using semantic relationships between words, and based on the information extracted from an electronic monolingual dictionary. the method, that uses genus data, specific relators and synonymy information, obtains an accuracy of over 99% and a scope of 68,2% with regard to all the common nouns contained in a real corpus of over 1 million words, after the manual labelling of only 100 nouns.
sentence disambiguation by document oriented preference sets. this paper proposes document oriented preference sets(dops) for the disambiguation of the dependency structure of sentences. the dops system extracts preference knowledge from a target document or other documents automatically. sentence ambiguities can be resolved by using domain targeted preference knowledge without using complicated large knowledgebases. implementation and empirical results are described for the analysis of dependency structures of japanese patent claim sentences.
an abstraction method using a semantic engine based on language information structure. this paper describes the framework for a new abstraction method that utilizes event-units written in sentences. event-units are expressed in language information structure (lis) form and the projection of lis from a sentence is performed by a semantic engine. abex (abstraction extraction system) utilizes the lis output of the semantic engine. abex can extract events from sentences and classify them. since abex and the lis form use only limited knowledge, the system need not construct or maintain a large amount of knowledge.
another look at nominal compounds. we present a progress report on our research on nominal compounds (nc's). recent approaches to this problem in linguistics and natural language processing (nlp) are reviewed and criticized. we argue that the notion of "role nominal", which is at the interface of linguistic and extralinguistic knowledge, is crucial for characterizing nc's as well as other linguistic phenomena. we examine a number of constraints on the semantic interpretation rules for nc's. proposals are made that should improve the capability of nlp systems to deal with nc's.
critter: a translation system for agricultural market reports. the critter system is being developed to translate agricultural market reports between english and french. it is based on a transfer model, and designed to be reversible. the source and target language texts are described by means of: a) a surface syntactic representation consisting of a tree annotated with feature structures, built by an extraposition grammar, and b) a semantic representation exhibiting predicate argument structures and constrained by type checking, built in parallel with the syntactic structure in compositional fashion. critters's implementation is still incomplete, but results obtained so far are promising.
transfer and mt modularity. the transfer components of typical second generation (g2) mt systems do not fully conform to the principles of g2 modularity, incorporating extensive target language information while failing to seperate translation facts from linguistic theory. the exclusion from transfer of all non-contrastive information leads us to a system design in which the three major components operate in parallel rather than in sequence. we also propose that mt systems be designed to allow translators to express their knowledge in natural metalanguage statements.
context analysis system for japanese text. a natural language understanding system is described which extracts contextual information from japanese texts. it integrates syntactic, semantic and contextual processing serially. the syntactic analyzer obtains rough syntactic structures from the text. the semantic analyzer treats modifying relations inside noun phrases and case relations among verbs and noun phrases. then, the contextual analyzer obtains contextual information from the semantic structure extracted by the semantic analyzer. our system understands the context using precoded contextual knowledge on terrorism and plugs the event information in input sentences into the contextual structure.
an efficient parser generator for natural language. we have developed a parser generator for natural language processing. the generator named "nlyacc" accepts grammar rules written in the yacc format. nlyacc, unlike yacc, can handle arbitrary context-free grammars using the generalized lr parsing algorithm. the parser produced by nlyacc efficiently parses given sentences and executes semantic actions. nlyacc, which is a free and sharable software, runs on unix workstations and personal computers.
a lesniewskian version of montague grammar. we shall be concerned in this paper with the logical analysis of natural language on the basis of lesniewski's ontology, which is a logical system without type-distinction between individuals and monadic predicates. this, it is believed, is also one of the features of natural language, and use will be made of this feature for developing a fragment of natural language.
a bottom-up generation for principle-based grammars using constraint propagation. a bottom-up generation algorithm for principle-based grammars is proposed. bottom-up generation has (1) an inefficiency because of a high degree of nondeterminism, (2) a limitation caused by inability to process logical forms produced by grammar rules, and (3) an identity semantic problem. this paper describes a solution to these problems and implementation issues for the algorithm using a constraint logic programming language.
efficient support vector classifiers for named entity recognition. named entity (ne) recognition is a task in which proper nouns and numerical information are extracted from documents and are classified into categories such as person, organization, and date. it is a key technology of information extraction and open-domain question answering. first, we show that an ne recognizer based on support vector machines (svms) gives better scores than conventional systems. however, off-the-shelf svm classifiers are too inefficient for this task. therefore, we present a method that makes the system substantially faster. this approach can also be applied to other similar tasks such as chunking and part-of-speech tagging. we also present an svm-based feature selection method and an efficient training method.
knowledge structures for natural language generation. the development of natural language interfaces to artificial intelligence systems is dependent on the representation of knowledge. a major impediment to building such systems has been the difficulty in adding sufficient linguistic and conceptual knowledge to extend and adapt their capabilities. this difficulty has been apparent in systems which perform the task of language production, i. e. the generation of natural language output to satisfy the communicative requirements of a system.the ace framework applies knowledge representation fundamentals to the task of encoding knowledge about language. within this framework, linguistic and conceptual knowledge are organized into hierarchies, and structured associations are used to join knowledge structures that are metaphorically or referentially related. these structured associations permit specialized linguistic knowledge to derive partially from more abstract knowledge, facilitating the use of abstractions in generating specialized phrases. this organization, used by a generator called king (knowledge intensive generator), promotes the extensibility and adaptability of the generation system.
achieving bidirectionality. the topic of bidirectionality, using common knowledge in language processing for both analysis and generation, is of both practical and theoretical concern. theoretically, it is important to determine what knowledge structures can be applied to both. practically, it is important that a competent natural language system be able to generate outputs that are relevant to the inputs it understands, without excessive redundancy. this problem revolves around the ability to relate linguistic structures declaratively to their meaning.
concretion: assumption-based understanding. a language understanding program must produce as precise a meaning representation as possible from a linguistic input. concretion is the process of developing a specific interpretation by combining various levels of conceptual information. this process represents an assumption-based method of language interpretation, and departs from the traditional approach of treating multiple interpretations as independent. concretion allows the language analyzer to develop a sufficiently specific representation without excessive computation or brittle interpretation rules.
to parse or not to parse: relation-driven text skimming. we have designed and implemented a text processing system that can extract important information from hundreds of paragraphs per hour and can be transported within weeks to a new domain. the system performs efficiently because it determines the level of processing required to understand a text. this "skimming" method identifies surface relations in the input text that are likely to contribute to its interpretation in a domain. this approach differs from previous skimming techniques in that it uses conceptual information as part of bottom-up linguistic processing, thus using linguistic knowledge more fully while limiting grammatical complexity.
word sense acquisition for multilingual text interpretation. we discuss a method for using automated corpus analysis to acquire word sense information for multilingual text interpretation. our system, shogun, extracts data from news stories with broad coverage in japanese and english. our approach focuses on tying together word senses, using a combination of world knowledge (oatlogy) with word knowledge (corpus data). we explain the approach and its results in shogun.
guaranteeing parsing termination of unification grammars. unification grammars are known to be turing-equivalent; given a grammar g and a word w, it is undecidable whether w &epsilon; l (g). in order to ensure decidability, several constraints on grammars, commonly known as off-line parsability (olp) were suggested. the recognition problem is decidable for grammars which satisfy olp. an open question is whether it is decidable if a given grammar satisfies olp. in this paper we investigate various definitions of olp, discuss their inter-relations and show that some of them are undecidable.
the primordial soup algorithm: a systematic approach to the specification of parallel parsers. a general framework for parallel parsing is presented, which allows for a unified, systematic approach to parallel parsing. the primordial soup algorithm creates trees by allowing partial parse trees to combine arbitrarily. by adding constraints to the general algorithm, a large class of parallel parsing strategies can be defined. this is exemplified by cyk, (bottom-up) earley and de vreught & honig parsers. from such a parsing strategy algorithms for various machine architectures can be derived in a systematic way.
functional structures for parsing dependency constraints. this paper outlines a high-level language fundpl for expressing functional structures for parsing dependency constraints. the goal of the language is to allow a grammar writer to pinn down his or her grammar with minimal commitment to control. fundpl interpreter has been implemented on top of a lower-level language dpl which we have earlier implemented.
annotating 200 million words: the bank of english project. the bank of english is an international english language project sponsored by harper-collins publishers, glasgow, and conducted by the cobuild team at the university of birmingham, uk. the text bank will comprise some 200 million words of both written and spoken english. the whole 200 million word corpus is being annotated morphologically and syntactically during 1993--94 at the research unit for computational linguistics (rucl), university of helsinki, using the english morphological analyser (engtwol) and english constraint grammar (engcg) parser. the first half of the texts (103 million words) has already been processed in 1993. the project is lead by prof. john sinclair in birmingham, and prof. fred karlsson in helsinki. the present author is responsible for conducting the annotation.
design issue of ectst. this note presents an overview of the english-chinese translation system for tourists (ectst) currently under development at south china university of technology. a brief description of the bilingual dictionary is given, followed by descriptions of grammar rules representation and the main processes involved in translation.
a new probabilistic model for title generation. title generation is a complex task involving both natural language understanding and natural language synthesis. in this paper, we propose a new probabilistic model for title generation. different from the previous statistical models for title generation, which treat title generation as a generation process that converts the 'document representation' of information directly into a 'title representation' of the same information, this model introduces a hidden state called 'information source' and divides title generation into two steps, namely the step of distilling the 'information source' from the observation of a document and the step of generating a title from the estimated 'information source'. in our experiment, the new probabilistic model outperforms the previous model for title generation in terms of both automatic evaluations and human judgments.
the performance of a grammar checker with deviant language input. this paper reports on an evaluation performed on the grammar checker for norwegian (ngc), developed at the text laboratory, university of oslo. the ability of the ngc to find errors made by different "non-standard" linguistic groups is analysed and compared to its performance when tested on texts written by "standard" users. then possible ways of adapting the ngc for use on deviant language input are discussed.
catching the cheshire cat. finding useful phrases is important in applications like information retrieval, and text-to-speech systems. one of the currently most used statistics is the mutual information ratio. this paper compares the mutual information ratio and a measure that takes temporal ordering into account. using this modified measure, some local syntactic constraints as well as phrases are captured.
good bigrams. a desired property of a measure of connective strength in bigrams is that the measure should be insensitive to corpus size. this paper investigates the stability of three different measures over text genres and expansion of the corpus. the measures are (1) the commonly used mutual information, (2) the difference in mutual information, and (3) raw occurrence. mutual information is further compared to using knowledge about genres to remove overlap between genres. this last approach considers the difference between two products of the same process (human text-generation) constrained by different genres. the cancellation of overlap seems to provide the most specific word pairs for each genre.
a discovery procedure for certain phonological rules. acquisition of phonological systems can be insightfully studied in terms of discovery procedures. this paper describes a discovery procedure, implemented in lisp, capable of determining a set of ordered phonological rules, which may be in opaque contexts, from a set of surface forms arranged in paradigms.
discouse, anaphora and parsing. discourse representation theory, as formulated by hans kamp and others, provides a model of inter- and intra-sentential anaphoric dependencies in natural language. in this paper, we present a reformulation of the model which, unlike kamp's, is specified declaratively. moreover, it uses the same rule formalism for building both syntactic and semantic structures. the model has been implemented in an extension of prolog, and runs on a vax 11/750 computer.
semantic abstraction and anaphora. this paper describes a way of expressing syntactic rules that associate semantic formulae with strings, but in a manner that is independent of the syntactic details of these formulae. in particular we show how the same rules construct predicate argument formulae in the style of montague grammar[13], representations reminiscent of situation semantics(barwise and perry [2]) and of the event logic of davidson [5], or representations inspired by the discourse representations proposed by kamp [9]. the idea is that semantic representations are specified indirectly using semantic construction operators, which enforce an abstraction barrier between the grammar and the semantic representations themselves. first we present a simple grammar which is compatible with the three different sets of constructors for the three formalisms. we then extend the grammar to provide one treatment that accounts for quantifier raising in the three different semantic formalisms
compact non-left-recursive grammars using the selective left-corner transform and factoring. the left-corner transform removes left-recursion from (probabilistic) context-free grammars and unification grammars, permitting simple top-down parsing techniques to be used. unfortunately the grammars produced by the standard left-corner transform are usually much larger than the original. the selective left-corner transform described in this paper produces a transformed grammar which simulates left-corner recognition of a user-specified set of the original productions, and top-down recognition of the others. combined with two factorizations, it produces non-left-recursive grammars that are not much larger than the original.