waashk/dblp huggingface dataset:
lexicon-grammar and the syntactic analysis of french. a lexicon-grammar is constituted of the elementary sentences of a language. instead of considering words as basic syntactic units to which grammatical information is attached, we use simple sentences (subject-verb-objects) as dictionary entries. hence, a full dictionary item is a simple sentence with a description of the corresponding distributional and transformational properties.the systematic study of french has led to an organization of its lexicon-grammar based on three main components:- the lexicon-grammar of free sentences, that is, of sentences whose verb imposes selectional restrictions on its subject and complements (e.g. to fall, to eat, to watch),- the lexicon-grammar of frozen or idiomatic expressions (e.g. n takes n into account, n raises a question,- the lexicon-grammar of support verbs. these verbs do not have the common selectional restrictions, but more complex dependencies between subject and complement (e.g. to have, to make in n has an impact on n, n makes a certain impression on n)these three components interact in specific ways. we present the structure of the lexicon-grammar built for french and we discuss its algorithmic implications for parsing.the construction of a lexicon-grammar of french has led to an accumulation of linguistic information that should significantly bear on the procedures of automatic analysis of natural languages. we shall present the structure of a lexicon-grammar built for french and will discuss its algorithmic main implications.
dialogic: a core natural-language processing system. the dialogic system translates english sentences into representations of their literal meaning in the context of an utterance. these representations, or "logical forms," are intended to be a purely formal language that is as close as possible to the structure of natural language, while providing the semantic compositionality necessary for meaning-dependent computational processing. the design of dialogic (and of its constituent modules) was influenced by the goal of using it as the core language-processing component in a variety of systems, some of which are transportable to new domains of application.
automatic construction of discourse representation structures. kamp's discourse representation theory is a major breakthrough regarding the systematic translation of natural language discourse into logical form. we have therefore chosen to marry the user specialty languages system, which was originally designed as a natural language frontend to a relational database system, with this new theory. in the paper we try to show taking - for the sake of simplicity - kamp's fragment of english how this is achieved. the research reported is going on in the context of the project linguistics and logic based legal expert system undertaken jointly by the ibm heidelberg scientific center and the universit&auml;t t&uuml;bingen.
goal oriented parsing: improving the efficiency of natural language access to relational data bases. this paper is devoted to present a new approach to natural language understanding which is called here goal-oriented parsing. the interaction in natural language with artificial systems (robots, data base systems, program generators, question-answering systems, etc.) does not require in most cases of actual interest a full (human like) comprehension of natural language in all its details and nuances. a partial understanding is often enough, wich extracts from the natural language expressions the only significant information which is necessary to construct a correct formal input for the target system. in such a model of comprehension the same meaning is assigned to several different natural language expressions, thus defining a many-to-one mapping between natural language sentences and corresponding formal representations. we argue that a bounded scope, restricted, goal-oriented understanding of natural language may greatly increase the efficency of representation models and parsing algorithms, thus allowing the construction of effective systems. this claim is supported by the design and implementation of a natural language interface to a relational data base called nli and developed at the milan polytechnic artificial intelligence project. in the paper the architecture of the system, the linguistic models, and the parsing algorithms are presented and illustrated through selected examples. promising directions for future research are outlined as well.
variables et categories grammaticales dans un modele ariane. toutes tes cat&eacute;gories grammaticales utilis&eacute;es dans un mod&eacute;le de traduction ariane sont formalis&eacute;es et cod&eacute;es de fa&ccedil; mn&eacute;monique en tant que variables et valeurs de variables. l'ensemble des variables d'un qui permet de d&eacute;crire la langue source et la langue cible de ce mod&eacute;le.la structure de donn&eacute;es du syst&egrave;me est une arborescence dont chaque noeud polte une d&eacute;coration. les d&eacute;corations contiennent les variables d&eacute;clar&eacute;es por le syst&egrave;me et affect&eacute;es de certaines valeur. les variables appraissent &eacute;galement dans les grammires d'analyse, de transfert et de g&eacute;n&eacute;ration, deans les dictionnaires monolingues d'analyse ou de g&eacute;n&eacute;ration et bilingues de transfert lexical, ainsl que dans les sp&eacute;cifications de mod&eacute;le linguistique (grammaires statiques).
a sign expansion approach to dynamic, multi-purpose lexicons. two problematic issues in most lexicon systems today are their size and restricted domain of use. in this paper, we introduce a new approach to lexical organization that leads to more compact and flexible lexicons. the lexical entries are conceptual/phonological frames rather then word entries, and a number of expansion rules are used to generate entries of actual words from these frames. a single frame supports not only all forms of a word, but also words of different categories that are derived from the same semantic basis. the whole theory is now being implemented in the troll lexicon project.
on the generation and interpretation of demonstrative expressions. this paper presents necessary and sufficient conditions for the use of demonstrative expressions in english and discusses implications for current discourse processing algorithms. we examine a broad range of texts to show how the distribution of demonstrative forms and functions is genre dependent. this research is part of a larger study of anaphoric expressions, the results of which will be incorporated into a natural language generation system.
parsing turkish using the lexical functional grammar formalism. this paper describes our work on parsing turkish using the lexical-functional grammar formalism. this work represents the first effort for parsing turkish. our implementation is based on tomita's parser developed at carnegie-mellon university center for machine translation. the grammar covers a substantial subset of turkish including simple and complex sentences, and deals with a reasonable amount of word order freeness. the complex agglutinative morphology of turkish lexical structures is handled using a separate two-level morphological analyzer. after a discussion of key relevant issues regarding turkish grammar, we discuss aspects of our system and present results from our implementation. our initial results suggest that our system can parse about 82% of the sentences directly and almost all the remaining with very minor pre-editing.
is there content in empty heads? we describe a technique for automatically constructing a taxonomy of word senses from a machine readable dictionary. previous taxonomies developed from dictionaries have two properties in common. first, they are based on a somewhat loosely defined notion of the is-a relation. second, they require human intervention to identify the sense of the genus term being used. we believe that for taxonomies of this type to serve a useful role in subsequent natural language processing tasks, the taxonomy must be based on a consistent use of the is-a relation which allows inheritance and transitivity. we show that hierarchies of this type can be automatically constructed, by using the semantic category codes and the subject codes of the longman dictionary of contemporary english (ldoce) to disambiguate the genus terms in noun definitions. in addition, we discuss how certain genus terms give rise to other semantic relations between definitions.
extension of zipf's law to words and phrases. zipf's law states that the frequency of word tokens in a large corpus of natural language is inversely proportional to the rank. the law is investigated for two languages english and mandarin and for n-gram word phrases as well as for single words. the law for single words is shown to be valid only for high frequency words. however, when single word and n-gram phrases are combined together in one list and put in order of frequency the combined list follows zipf's law accurately for all words and phrases, down to the lowest frequencies in both languages. the zipf curves for the two languages are then almost identical.
referential nets with attributes. one of the essential problems in natural language production and understanding is the problem of processing referential relations. in this paper i describe a model for representing and processing referential relations: referential nets with attributes. both processes (analyzing and generating referential expressions) are controlled by attributes. there are two types of attributes, on one hand, the ones to the internal substitutes of the objects spoken about, on the other hand, the ones to the descriptions of these objects.
plurals, cardinalities, and structures of determination. this paper presents an approach for processing incomplete and inconsistent knowledge. basis for attacking these problems are 'structures of determination', which are extensions of scott's approximation lattices taking into consideration some requirements from natural language processing and representation of knowledge. the theory developed is exemplified with processing plural noun phrases referring to objects which have to be understood as classes or sets. referantial processes are handled by processes on 'referential nets', which are a specific knowledge structure developed for the representation of object-oriented knowledge. problems of determination with respect to cardinality assumptions are emphasized.
a description of the vespra speech processing system. the vespra system is designed for the processing of chains of (not connected utterances of) wordforms. these strings of wordforms correspond to sentences except that they are not realised in connected speech. vespra means: verarbeitung und erkennung gesprochener sprache (processing and recognition of speech). vespra will be used to control different types of machines by voice input (for instance: non critical control functions in cars and in trucks, voice box in digital telephone systems, text processing systems, different types of office work-stations).
symbolic word clustering for medium-size corpora. when trying to identify essential concepts and relationships in a medium-size corpus, it is not always possible to rely on statistical methods, as the frequencies are too low. we present an alternative method, symbolic, based on the simplification of parse trees. we discuss the results on nominal phrases of two technical corpora, analyzed by two different robust parsers used for terminology updating in an industrial company. we compare our results with hindle's scores of similarity.
reading distinction in mt. in any system for natural language processing having a dictionary, the question arises as to which entries are included in it. in this paper, i address the subquestion as to whether a lexical unit having two senses should be considered ambiguous or vague with respect to them. the inadequacy of some common strategies to answer this question in machine translation (mt) systems is shown. from a semantic conjecture, tests are developed that are argued to give more consistent and theoretically well-founded results.
a knowledge acquisition and management system for morphological dictionaries. a system for the acquisition and management of reusable morphological dictionaries is clearly a useful tool for nlp. as such, most currently popular finite-state morphology systems have a number of drawbacks. in the development of word manager, these problems have been taken into account. as a result, its knowledge acquisition component is well-developed, and its knowledge representation enables more flexible use than typical finite-state systems.
multimodal database query. the paper proposes a multimodal interface for a real sales database application. we show how natural language processing may be integrated with a visual, direct manipulation method of database query, to produce a user interface which supports a flexible form of query specification, provides implicit guidance about the coverage of the linguistic component, and allows more focused discourse reference.
interaction of knowledge sources in a portable natural language interface. this paper describes a general approach to the design of natural language interfaces that has evolved during the development of datalog, an english database query system based on cascaded atn grammar. by providing separate representation schemes for linguistic knowledge, general world knowledge, and application domain knowledge, datalog achieves a high degree of portability and extendability.
textual expertise in word experts: an approach to text parsing based on topic/comment monitoring. in this paper prototype versions of two word experts for text analysis are dealt with which demonstrate that word experts are a feasible tool for parsing texts on the level of text cohesion as well as text coherence. the analysis is based on two major knowledge sources: context information is modelled in terms of a frame knowledge base, while the co-text keeps record of the linear sequencing of text analysis. the result of text parsing consists of a text graph reflecting the thematic organization of topics in a text.
on text coherence parsing. in this paper global patterns of thematic text organization are considered within the framework of a distributed model of text understanding. based on the parsing results of prior text cohesion analysis, specialized text grammar modules determine whether some well-defined text macro-organization pattern is computable from the available text representation structures. the model underlying text coherence parsing formalizes hither-to entirely intuitive textlinguistic notions whose origin can be traced back to danes's work on thematic progression patterns.
an integrated model of semantic and conceptual interpretation from dependency structures. we propose a two-layered model for computing semantic and conceptual interpretations from dependency structures. abstract interpretation schemata generate semantic interpretations of 'minimal' dependency subgraphs, while production rules whose specification is rooted in ontological categories derive a canonical conceptual interpretation from semantic interpretation structures. configurational descriptions of dependency graphs increase the linguistic generality of interpretation schemata, while interfacing schemata and productions to lexical and conceptual class hierarchies reduces the amount and complexity of semantic specifications.
topic essentials. an overview of topic is provided, a knowledge-based text information system for the analysis of german-language texts. topic supplies text condensates (summaries) on variable degrees of generality and makes available facts acquired from the texts. the presentation focuses on the major methodological principles underlying the design of topic: a frame representation model that incorporates various integrity constraints, text parsing with focus on text cohesion and text coherence properties of expository texts, a lexically distributed semantic text grammar in the format of word experts, a model of partial text parsing, and text graphs as appropriate representation structures for text condensates.
bridging textual ellipses. we present a hybrid text understanding methodology for the resolution of textual ellipsis. it integrates language-independent conceptual criteria and language-dependent functional constraints. the methodological framework for text ellipsis resolution is the centering model that has been adapted to constraints reflecting the functional information structure within utterances, i.e., the distinction between context-bound and unbound discourse elements.
formal morphology. it is generally accepted that in principle it''s possible to formalize completely almost all of present-day mathematics. the practicability of actually doing so is widely doubted, as is the value of the result. but in the computer age we believe that such formalization is possible and desirable. in contrast to the qed manifesto however, we do not offer polemics in support of such a project. we merely try to place the formalization of mathematics in its historical perspective, as well as looking at existing praxis and identifying what we regard as the most interesting issues, theoretical and practical.
spelling-checking for highly inflective languages. spelling-checkers have become an integral part of most text processing software. from different reasons among which the speed of processing prevails they are usually based on dictionaries of word forms instead of words. this approach is sufficient for languages with little inflection such as english, but fails for highly inflective languages such as czech, russian, slovak or other slavonic languages. we have developed a special method for describing inflection for the purpose of building spelling-checkers for such languages. the speed of the resulting program lies somewhere in the middle of the scale of existing spelling-checkers for english and the main dictionary fits into the standard 360k floppy, whereas the number of recognized word forms exceeds 6 million (for czech). further, a special method has been developed for easy word classification.
deletions and their reconstruction in tectogrammatical syntactic tagging of very large corpora. the procedure of reconstruction of the underlying structure of sentences (in the process of tagging a very large corpus of czech) is described, with a special attention paid to the conditions under which the reconstruction of ellipted nodes is carried out.
inferencing on linguistically based semantic structures. the paper characterizes natural language inferencing in the tibaq method of question-answering, focussing on three aspects: (i) specification of the structures on which the inference rules operate, (ii) classification of the rules that have been formulated and implemented up to now, according to the kind of modification of the input structure the rules invoke, and (iii) discussion of some points in which a properly designed inference procedure may help the search of the answer, and vice versa.
hierarchy of salience and discourse analysis and production. the hierarchy of salience of the items of the knowledge assumed by the speaker to be shared by him and by the hearer constitutes one aspect of a dynamic account of discourse (sect. 1). it is claimed that a representation of this hierarchy is a good support for discourse analysis (reference assignement, sect. 2) and for discourse production (pronominalization, definite description, sect. 3).
stock of shared knowledge - a tool for solving pronominal anaphora. the paper develops further the idea of using the notion of the stock of shared knowledge (ssk) for anaphora resolution following a more subtle treatment of the influence of the topic/focus articulation of the sentence on the degrees of salience of items of the ssk. an algorithmic evaluation procedure of the ssk is formulated taking into account the notions of contextual boundness, syntactic associations, complexity of the sentences and existence/nonexistence of possible competitors, and a general evaluating function is proposed, essential for the process of anaphora resolution. in the present paper the analysis is performed for czech; however, the considerations are claimed to be of a universal validity, the actual relations between different factors and the values, of course, being language-dependent.
statistical morphological disambiguation for agglutinative languages. in this paper, we present statistical models for morphological disambiguation in turkish. turkish presents an interesting problem for statistical models since the potential tag set size is very large because of the productive derivational morphology. we propose to handle this by breaking up the morhosyntactic tags into inflectional groups, each of which contains the inflectional features for each (intermediate) derived form. our statistical models score the probability of each morhosyntactic tag by considering statistics over the individual inflection groups in a trigram model. among the three models that we have developed and tested, the simplest model ignoring the local morphotactics within words performs the best. our best trigram model performs with 93.95% accuracy on our test data getting all the morhosyntactic and semantic features correct. if we are just interested in syntactically relevant features and ignore a very small set of semantic features, then the accuracy increases to 95.07%.
lexical-functional grammar and order-free semantic composition. this paper summarizes the extension of the theory of lexical-functional grammar to include a formal, model-theoretic, semantics. the algorithmic specification of the semantic interpretation procedures is order-free which distinguishes the system from other theories providing model-theoretic interpretation for natural language. attention is focused on the computational advantages of a semantic interpretation system that takes as its input functional structures as opposed to syntactic surface-structures.
a compression technique for arabic dictionaries: the affix analysis. in every application that concerns the automatic processing of natural language, the problem of the dictionary size is posed. in this paper, we propose a compression dictionary algorithm based on an affix analysis of the non diacritical arabic.it consists in decomposing a word into its first elements taking into account the different linguistic transformations that can affect the morphological structures.this work has been achieved as part of a study of the automatic detection and correction of spelling errors in the non diacritical arabic texts.
a reestimation algorithm for probabilistic recursive transition network. probabilistic recursive transition network (prtn) is an elevated version of rtn to model and process languages in stochastic parameters. the representation is a direct derivation from the rtn and keeps much the spirit of hidden markov model at the same time. we present a resetination algorithm for prtn that is a variation of inside-outside algorithm that computes the values of the probabilistic parameters from sample sentences (parsed or unparsed).
an intelligent digester for interactive text processings. this paper outlines a practical approach to our project to design an intelligent system that supports an expert user for his understanding and representing news reports on a special world of the japanese computer industry. with the extensive help of the intelligent system the expert user purposefully assimilates new information in a knowledge data base of a frame-like representation through a multiple window interface.