DOCSLIB.ORG

Lexical Resource Reconciliation in the Xerox Linguistic Environment

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lexical Resource Reconciliation in the Xerox Linguistic Environment Lexical Resource Reconciliation in the Xerox Linguistic Environment Ronald M. Kaplan Paula S. Newman Xerox Palo Alto Research Center Xerox Palo Alto Research Center 3333 Coyote Hill Road 3333 Coyote Hill Road Palo Alto, CA, 94304, USA Palo Alto, CA, 94304, USA kapl an~parc, xerox, com pnewman©parc, xerox, tom Abstract This paper motivates and describes the morpho- logical and lexical adaptations of XLE. They evolved This paper motivates and describes those concurrently with PARGRAM, a multi-site XLF_~ aspects of the Xerox Linguistic Environ- based broad-coverage grammar writing effort aimed ment (XLE) that facilitate the construction at creating parallel grammars for English, French, of broad-coverage Lexical Functional gram- and German (see Butt et. al., forthcoming). The mars by incorporating morphological and XLE adaptations help to reconcile separately con- lexical material from external resources. structed linguistic resources with the needs of the Because that material can be incorrect, in- core grammars. complete, or otherwise incompatible with The paper is divided into three major sections. the grammar, mechanisms are provided to The next section sets the stage by providing a short correct and augment the external material overview of the overall environmental features of the to suit the needs of the grammar developer. original LFG GWB and its provisions for morpho- This can be accomplished without direct logical and lexicon processing. The two following modification of the incorporated material, sections describe the XLE extensions in those areas. which is often infeasible or undesirable. Externally-developed finite-state morpho- 2 The GWB Data Base logical analyzers are reconciled with gram- mar requirements by run-time simulation GWB provides a computational environment tai- of finite-state calculus operations for com- lored especially for defining and testing grammars bining transducers. Lexical entries derived in the LFG formalism. Comprehensive editing fa- by automatic extraction from on-line dic- cilities internal to the environment are used to con- tionaries or via corpus-analysis tools are in- struct and modify a data base of grammar elements corporated and reconciled by extending the of various types: morphologicalrules, lexical entries, LFG lexicon formalism to allow fine-tuned syntactic rules, and "templates" allowing named ab- integration of information from difference breviations for combinations of constraints. (See Ka- sources. plan and Maxwell, 1996; Kaplan and Bresnan, 1982; and Kaplan, 1995 for descriptions of the LFG for- malism.) Separate "configuration" specifications in- 1 Introduction dicate how to select and assemble collections of these elements to make up a complete grammar, and al- The LISP-based LFG Grammar Writers Workbench ternative configurations make it easy to experiment (GWB) (Kaplan and Maxwell, 1996) has long served with different linguistic analyses. both as a testbed for the development of parsing al- This paper focuses on the lexical mapping process, gorithms (Maxwell and Kaplan, 1991; Maxwell and that is, the overall process of translating between the Kaplan, 1993) and as a self-contained environment characters in an input string and the initial edges of for work in syntactic theory. The C/Unix-based Xe- the parse-chart. We divide this process into the typ- rox Linguistic Environment (XLE) further develops ical stages of tokenization, morphological analysis, the GWB parsing algorithms, extends them to gen- and LFG lexicon lookup. In GWB tokenizing is ac- eration, and adapts the environment to a different complished with a finite-state transducer compiled set of requirements. from a few simple rules according to the methods 54 described by (Kaplan and Kay, 1994). It tokenizes same syntactic category appears m more than one the input string by inserting explicit token bound- included rule collection, or an entry for the same ary symbols at appropriate character positions. This headword appears in more than one included lexical process can produce multiple outputs because of un- collection, the instance from the collection of high- certainties in the interpretation of punctuation such est precedence is the one included in the grammar. as spaces and periods. For example, "I like Jan." Thus the grammar writer can tentatively replace a results in two alternatives ("I@like@Jan@.@" and few rules or lexical entries by placing some very small "I@like@Jan.@.@") because the period in "Jan." collections containing the replacements later in the could optionally mark an abbreviation as well as a configuration list. sentence end. We constructed XLE around the same database- Morphological analysis is also implemented as a plus-configuration model but adapted it to operate finite-state transducer again compiled from a set of in the C/Unix world and to meet an additional set rules. These rules are limited to describing only of user requirements. GWB is implemented in a res- simple suffixing and inflectional morphology. The idential Lisp system where rules and definitions on morphological transducer is arranged to apply to in- text files are "loaded" into a memory-based database dividual tokens produced by the tokenizer, not to and then selected and manipulated. In C/Unix we strings of tokens. The result of applying the mor- treat the files themselves as the analog of the GWB phological rules to a token is a stem and one or more database. Thus, the XLE user executes either a inflectional tags, each of which is the heading for an "create-parser" or "create-generator" command to entry in the LFG lexicon. Morphological ambiguity select a file containing one or more configurations can lead to alternative analyses for a single token, so and to select one of those configurations to specify this stage can add further possibilities to the alterna- the current grammar. The selected configuration, in tives coming from the tokenizer. The token "cooks" turn, names a list of files comprising the data base, can be analyzed as "cook +NPL" or "cook +V3SG", and identifies the elements in those files to be used for instance. in the grammar. In the final phase of GWB lexical mapping, these This arrangement still supports alternative ver- stem-tag sequences are looked up in the LFG lexicon sions of lexical entries and rules, but the purpose to discover the syntactic category (N, V, etc.) and is not just to permit easy and rapid exploration of constraints (e.g. (1" NUM)=PL) to be placed on a these alternatives. The XLE database facilities also single edge in the initial parse chart. The category of enable linguistic specifications from different sources that edge is determined by the particular combina- and with different degrees of quality to be combined tion of stems and tags, and the corresponding edge together in an orderly and coherent way. For XLE constraints are formed by conjoining the constraints the goal is to produce efficient, robust, and broad found in the stem/tag lexical entries. Because of the coverage processors for parsing and generation, and ambiguities in tokenization, morphological analysis this requires that we make use of large-scale, in- and also lexical lookup, the initial chart is a network dependently developed morphological analyzers and rather than a simple sequence. lexicons. Such comprehensive, well-engineered com- The grammar writer enters morphological rules, ponents exist for many languages, and can relieve syntactic rules, and lexical entries into a database. the grammar developer of much of the effort and These are grouped by type into named collections. expense of accounting again for those aspects of lan- The collections may overlap in content in that differ- guage processing. ent syntactic rule collections may contain alternative expansions for a particular category and different 3 XLE Morphological Processing lexical collections may contain alternative definitions One obvious obstacle to incorporating externally de- for a particular headword. A configuration contains veloped morphological analyzers, even ones based on an ordered list of collection names to indicate which finite-state technology, is that they may be supplied alternatives to include in the active grammar. in a variety of data-structure formats. We overcame This arrangement provides considerable support this obstacle by implementing special software inter- for experimentation. The grammar writer can in- preters for the different transducer formats. But, as vestigate alternative hypotheses by switching among we learned in an evolutionary process, a more fun- configurations with different inclusion lists. Also, damental problem in integrating these components the inclusion list order is significant, with collec- with syntactic processing is to reconcile the analyses tions mentioned later in the list having higher prece- they produce with the needs of the grammar. dence than ones mentioned earlier. If a rule for the Externally-available morphological components 55 are, at present, primarily aimed at relatively unde- +Vbase : +Verb +Inf manding commercial applications such as informa- +Vbase : +Verb +Not3Sg tion retrieval. As such, they may have mistakes or gaps that have gone unnoticed because they have no Finally, in cases where the output of the exter- effect on the target applications. For example, func- nal analyzer is simply wrong, corrections can be de- tion words are generally ignored in IR, so mistakes veloped again in a locally specified way and com- in those words might go undetected; but those words bined with a "priority union" operator that blocks are crucial in syntactic processing. And even correct the incorrect analyses. The priority union of reg- analyses generally deviate in some respects from the ular relations A and B is defined as A Up B = characterizations desired by the grammar writer. A U lid(Dora(A)) o B]. The relation A Up B con- These mistakes, gaps, and mismatches are often tains all the pairs of strings in A together with all not easy to correct at the source. It may not be the pairs in B except those whose domain string is practical to refer problems back to the supplier as also in the domain of A.
Load more

Recommended publications
  • Wordnet As an Ontology for Generation Valerio Basile
    WordNet as an Ontology for Generation Valerio Basile To cite this version: Valerio Basile. WordNet as an Ontology for Generation. WebNLG 2015 1st International Workshop on Natural Language Generation from the Semantic Web, Jun 2015, Nancy, France. hal-01195793 HAL Id: hal-01195793 https://hal.inria.fr/hal-01195793 Submitted on 9 Sep 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. WordNet as an Ontology for Generation Valerio Basile University of Groningen [email protected] Abstract a structured database of words in a format read- able by electronic calculators. For each word in In this paper we propose WordNet as an the database, WordNet provides a list of senses alternative to ontologies for the purpose of and their definition in plain English. The senses, natural language generation. In particu- besides having a inner identifier, are represented lar, the synset-based structure of WordNet as synsets, i.e., sets of synonym words. Words proves useful for the lexicalization of con- in general belong to multiple synsets, as they cepts, by providing ready lists of lemmas have more than one sense, so the relation between for each concept to generate.
    [Show full text]
  • Modeling and Encoding Traditional Wordlists for Machine Applications
    Modeling and Encoding Traditional Wordlists for Machine Applications Shakthi Poornima Jeff Good Department of Linguistics Department of Linguistics University at Buffalo University at Buffalo Buffalo, NY USA Buffalo, NY USA [email protected] [email protected] Abstract Clearly, descriptive linguistic resources can be This paper describes work being done on of potential value not just to traditional linguis- the modeling and encoding of a legacy re- tics, but also to computational linguistics. The source, the traditional descriptive wordlist, difficulty, however, is that the kinds of resources in ways that make its data accessible to produced in the course of linguistic description NLP applications. We describe an abstract are typically not easily exploitable in NLP appli- model for traditional wordlist entries and cations. Nevertheless, in the last decade or so, then provide an instantiation of the model it has become widely recognized that the devel- in RDF/XML which makes clear the re- opment of new digital methods for encoding lan- lationship between our wordlist database guage data can, in principle, not only help descrip- and interlingua approaches aimed towards tive linguists to work more effectively but also al- machine translation, and which also al- low them, with relatively little extra effort, to pro- lows for straightforward interoperation duce resources which can be straightforwardly re- with data from full lexicons. purposed for, among other things, NLP (Simons et al., 2004; Farrar and Lewis, 2007). 1 Introduction Despite this, it has proven difficult to create When looking at the relationship between NLP significant electronic descriptive resources due to and linguistics, it is typical to focus on the dif- the complex and specific problems inevitably as- ferent approaches taken with respect to issues sociated with the conversion of legacy data.
    [Show full text]
  • TEI and the Documentation of Mixtepec-Mixtec Jack Bowers
    Language Documentation and Standards in Digital Humanities: TEI and the documentation of Mixtepec-Mixtec Jack Bowers To cite this version: Jack Bowers. Language Documentation and Standards in Digital Humanities: TEI and the documen- tation of Mixtepec-Mixtec. Computation and Language [cs.CL]. École Pratique des Hauts Études, 2020. English. tel-03131936 HAL Id: tel-03131936 https://tel.archives-ouvertes.fr/tel-03131936 Submitted on 4 Feb 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Préparée à l’École Pratique des Hautes Études Language Documentation and Standards in Digital Humanities: TEI and the documentation of Mixtepec-Mixtec Soutenue par Composition du jury : Jack BOWERS Guillaume, JACQUES le 8 octobre 2020 Directeur de Recherche, CNRS Président Alexis, MICHAUD Chargé de Recherche, CNRS Rapporteur École doctorale n° 472 Tomaž, ERJAVEC Senior Researcher, Jožef Stefan Institute Rapporteur École doctorale de l’École Pratique des Hautes Études Enrique, PALANCAR Directeur de Recherche, CNRS Examinateur Karlheinz, MOERTH Senior Researcher, Austrian Center for Digital Humanities Spécialité and Cultural Heritage Examinateur Linguistique Emmanuel, SCHANG Maître de Conférence, Université D’Orléans Examinateur Benoit, SAGOT Chargé de Recherche, Inria Examinateur Laurent, ROMARY Directeur de recherche, Inria Directeur de thèse 1.
    [Show full text]
  • Unification of Multiple Treebanks and Testing Them with Statistical Parser with Support of Large Corpus As a Lexical Resource
    Eng. &Tech.Journal, Vol.34,Part (B), No.5,2016 Unification of Multiple Treebanks and Testing Them With Statistical Parser With Support of Large Corpus as a Lexical Resource Dr. Ahmed Hussein Aliwy Computer Science Department, University of Kufa/Kufa Email:[email protected] Received on:12/11/2015 & Accepted on:21/4/2016 ABSTRACT There are many Treebanks, texts with the parse tree, available for the researcher in the field of Natural Language Processing (NLP). All these Treebanks are limited in size, and each one used private Context Free Grammar (CFG) production rules (private formalism) because its construction is time consuming and need to experts in the field of linguistics. These Treebanks, as we know, can be used for statistical parsing and machine translation tests and other fields in NLP applications. We propose, in this paper, to build large Treebank from multiple Treebanks for the same language. Also, we propose to use an annotated corpus as a lexical resource. Three English Treebanks are taken for our study which arePenn Treebank (PTB), GENIA Treebank (GTB) and British National Corpus (BNC). Brown corpus is used as a lexical resource which contains approximately one million tokens annotated with part of speech tags for each. Our work start by the unification of POS tagsets of the three Treebank then the mapping process between Brown Corpus tagset and the unified tagset is done. This is done manually according to our experience in this field. Also, all the non-terminals in the CFG production are unified.All the three Treebanks and the Brown corpus are rebuilt according to the new modification.
    [Show full text]
  • Instructions for ACL-2010 Proceedings
    Towards the Representation of Hashtags in Linguistic Linked Open Data Format Thierry Declerck Piroska Lendvai Dept. of Computational Linguistics, Dept. of Computational Linguistics, Saarland University, Saarbrücken, Saarland University, Saarbrücken, Germany Germany [email protected] [email protected] the understanding of the linguistic and extra- Abstract linguistic environment of the social media post- ing that features the hashtag. A pilot study is reported on developing the In the light of recent developments in the basic Linguistic Linked Open Data (LLOD) Linked Open Data (LOD) framework, it seems infrastructure for hashtags from social media relevant to investigate the representation of lan- posts. Our goal is the encoding of linguistical- guage data in social media so that it can be pub- ly and semantically enriched hashtags in a lished in the LOD cloud. Already the classical formally compact way using the machine- readable OntoLex model. Initial hashtag pro- Linked Data framework included a growing set cessing consists of data-driven decomposition of linguistic resources: language data i.e. hu- of multi-element hashtags, the linking of man-readable information connected to data ob- spelling variants, and part-of-speech analysis jects by e.g. RDFs annotation properties such as of the elements. Then we explain how the On- 'label' and 'comment' , have been suggested to toLex model is used both to encode and to en- be encoded in machine-readable representation3. rich the hashtags and their elements by linking This triggered the development of the lemon them to existing semantic and lexical LOD re- model (McCrae et al., 2012) that allowed to op- sources: DBpedia and Wiktionary.
    [Show full text]
  • The Interplay Between Lexical Resources and Natural Language Processing
    Tutorial on: The interplay between lexical resources and Natural Language Processing Google Group: goo.gl/JEazYH 1 Luis Espinosa Anke Jose Camacho-Collados Mohammad Taher Pilehvar Google Group: goo.gl/JEazYH 2 Luis Espinosa Anke (linguist) Jose Camacho-Collados (mathematician) Mohammad Taher Pilehvar (computer scientist) 3 www.kahoot.it PIN: 7024700 NAACL 2018 Tutorial: The Interplay between Lexical Resources and Natural Language Processing Camacho-Collados, Espinosa-Anke, Pilehvar 4 QUESTION 1 PIN: 7024700 www.kahoot.it NAACL 2018 Tutorial: The Interplay between Lexical Resources and Natural Language Processing Camacho-Collados, Espinosa-Anke, Pilehvar 5 Outline 1. Introduction 2. Overview of Lexical Resources 3. NLP for Lexical Resources 4. Lexical Resources for NLP 5. Conclusion and Future Directions NAACL 2018 Tutorial: The Interplay between Lexical Resources and Natural Language Processing Camacho-Collados, Espinosa-Anke, Pilehvar 6 INTRODUCTION NAACL 2018 Tutorial: The Interplay between Lexical Resources and Natural Language Processing Camacho-Collados, Espinosa-Anke, Pilehvar 7 Introduction ● “A lexical resource (LR) is a database consisting of one or several dictionaries.” (en.wikipedia.org/wiki/Lexical_resource) ● “What is lexical resource? In a word it is vocabulary and it matters for IELTS writing because …” (dcielts.com/ielts-writing/lexical-resource) ● “The term Language Resource refers to a set of speech or language data and descriptions in machine readable form, used for … ” (elra.info/en/about/what-language-resource )
    [Show full text]
  • Exploring Complex Vowels As Phrase Break Correlates in a Corpus of English Speech with Proposel, a Prosody and POS English Lexicon
    This is a repository copy of Exploring complex vowels as phrase break correlates in a corpus of English speech with ProPOSEL, a Prosody and POS English Lexicon. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/81922/ Proceedings Paper: Brierley, C and Atwell, ES (2009) Exploring complex vowels as phrase break correlates in a corpus of English speech with ProPOSEL, a Prosody and POS English Lexicon. In: Proceedings of InterSpeech'2009. INTERSPEECH 2009, 6-10 Sept 2009, Brighton, UK. International Speech Communications Association , 868 - 871. ISBN 9781615676927 Reuse See Attached Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ Exploring Complex Vowels as Phrase Break Correlates in a Corpus of English Speech with ProPOSEL, a Prosody and POS English Lexicon. Claire Brierley 1 2, Eric Atwell 2 1 School of Games Computing and Creative Technologies, University of Bolton, UK 2 School of Computing, University of Leeds, UK [email protected], [email protected] Abstract 2. Features used in phrase break prediction Real-world knowledge of syntax is seen as integral to the Syntactic features are integral to phrase break prediction machine learning task of phrase break prediction but there is a because of the overlap between syntactic and prosodic deficiency of a priori knowledge of prosody in both rule-based phrasing. The boundary annotation / | / in the following and data-driven classifiers.
    [Show full text]
  • Methods for Efficient Ontology Lexicalization for Non-Indo
    Methods for Efficient Ontology Lexicalization for Non-Indo-European Languages The Case of Japanese Bettina Lanser A thesis presented for the degree of Doctor rerum naturalium (Dr. rer. nat.) Bielefeld University June 2017 ii This work was supported by the Cluster of Excellence Cognitive Interaction Technol- ogy CITEC (EXC 277) at Bielefeld University, which is funded by the German Research Foundation (DFG). Printed on non-ageing paper — ISO 9706 ABSTRACT In order to make the growing amount of conceptual knowledge available through on- tologies and datasets accessible to humans, NLP applications need access to information on how this knowledge can be verbalized in natural language. One way to provide this kind of information are ontology lexicons, which apart from the actual verbalizations in a given target language can provide further, rich linguistic information about them. Compiling such lexicons manually is a very time-consuming task and requires expertise both in Semantic Web technologies and lexicon engineering, as well as a very good knowledge of the target language at hand. In this thesis we present two alternative approaches to generating ontology lexicons by means of crowdsourcing on the one hand and through the framework M-ATOLL on the other hand. So far, M-ATOLL has been used with a number of Indo-European languages that share a large set of common characteristics. Therefore, another focus of this work will be the generation of ontology lexicons specifically for Non-Indo-European languages. In order to explore these two topics, we use both approaches to generate Japanese ontology lexicons for the DBpedia ontology: First, we use CrowdFlower to generate a small Japanese ontology lexicon for ten exemplary ontology elements according to a two-stage workflow, the main underlying idea of which is to turn the task of generating lexicon entries into a translation task; the starting point of this translation task is a manually created English lexicon for DBpedia.
    [Show full text]
  • Maurice Gross' Grammar Lexicon and Natural Language Processing
    Maurice Gross’ grammar lexicon and Natural Language Processing Claire Gardent, Bruno Guillaume, Guy Perrier, Ingrid Falk To cite this version: Claire Gardent, Bruno Guillaume, Guy Perrier, Ingrid Falk. Maurice Gross’ grammar lexicon and Natural Language Processing. Language and Technology Conference, Apr 2005, Poznan/Pologne, France. inria-00103156 HAL Id: inria-00103156 https://hal.inria.fr/inria-00103156 Submitted on 3 Oct 2006 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Maurice Gross’ grammar lexicon and Natural Language Processing Claire Gardent♦, Bruno Guillaume♠, Guy Perrier♥, Ingrid Falk♣ ♦CNRS/LORIA ♠INRIA/LORIA ♥University Nancy 2/LORIA ♣CNRS/ATILF Nancy, France [email protected] Abstract Maurice Gross’ grammar lexicon contains an extremly rich and exhaustive information about the morphosyntactic and semantic proper- ties of French syntactic functors (verbs, adjectives, nouns). Yet its use within natural language processing systems is still restricted. In this paper, we first argue that the information contained in the grammar lexicon is potentially useful for Natural Language Processing (NLP). We then sketch a way to translate this information into a format which is arguably more amenable for use by NLP systems. 1. Maurice Gross’s grammar lexicon gether all the verbs which can take besides a subject, an Much work in syntax concentrates on identifying and infinitival complement but not a finite or a nominal one.
    [Show full text]
  • Using Relevant Domains Resource for Word Sense Disambiguation
    Using Relevant Domains Resource for Word Sense Disambiguation Sonia Vázquez, Andrés Montoyo German Rigau Department of Software and Computing Systems Department of Computer Languages and Systems University of Alicante Euskal Herriko Unibertsitatea Alicante, Spain Donostia, Spain {svazquez,montoyo}@dlsi.ua.es [email protected] Abstract educate ourselves. The revolution continues and one of its results is that large volumes of information will be shown in a format that is more natural for users than This paper presents a new method for Word Sense the typical data presentation formats of past computer Disambiguation based on the WordNet Domains systems. Natural Language Processing (NLP) is crucial lexical resource [4]. The underlaying working in solving these problems and language technologies hypothesis is that domain labels, such as will make an indispensable contribution to the success ARCHITECTURE, SPORT and MEDICINE provide a of information systems. natural way to establish semantic relations between Designing a system for NLP requires a large word senses, that can be used during the knowledge on language structure, morphology, syntax, disambiguation process. This resource has already semantics and pragmatic nuances. All of these different been used on Word Sense Disambiguation [5], but it linguistic knowledge forms, however, have a common has not made use of glosses information. Thus, we associated problem, their many ambiguities, which are present in first place, a new lexical resource based on difficult to resolve. WordNet Domains glosses information, named In this paper we concentrate on the resolution of the ªRelevant Domainsº. In second place, we describe a lexical ambiguity that appears when a given word has new method for WSD based on this new lexical several different meanings.
    [Show full text]
  • Using a Lexical Semantic Network for the Ontology Building Nadia Bebeshina-Clairet, Sylvie Despres, Mathieu Lafourcade
    Using a Lexical Semantic Network for the Ontology Building Nadia Bebeshina-Clairet, Sylvie Despres, Mathieu Lafourcade To cite this version: Nadia Bebeshina-Clairet, Sylvie Despres, Mathieu Lafourcade. Using a Lexical Semantic Network for the Ontology Building. RANLP: Recent Advances in Natural Language Processing, Sep 2019, Varna, Bulgaria. 12th International Conference Recent Advances in Natural Language Processing, 2019. hal-02269128 HAL Id: hal-02269128 https://hal.archives-ouvertes.fr/hal-02269128 Submitted on 22 Aug 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Using a Lexical Semantic Network for the Ontology Building Nadia Bebeshina-Clairet Sylvie Despres Mathieu Lafourcade LIRMM / LIMICS LIMICS LIRMM 74 rue Marcel Cachin 860 rue de St Priest 93017 Bobigny 34095 Montpellier Abstract cepts) shared by a community of agents. A con- cept corresponds to a set of individuals sharing sim- In the present article, we focus on mining lexical se- ilar characteristics and may or may not be lexical- mantic knowledge resources for the ontology build- ized. Thus, the ontology labels cannot be polyse- ing and enhancement. The ontology building is of- mous. The strength of ontologies is in their for- ten a descending and manual process where the high mal consistency.
    [Show full text]
  • Inferences for Lexical Semantic Resource Building with Less Supervision
    Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020), pages 2300–2305 Marseille, 11–16 May 2020 c European Language Resources Association (ELRA), licensed under CC-BY-NC Inferences for Lexical Semantic Resource Building with Less Supervision Nadia Bebeshina1;2, Mathieu Lafourcade2 1Praxiling, 2LIRMM Universite´ Paul Valery,´ Universite´ de Montpellier, France [email protected], [email protected] Abstract Lexical semantic resources may be built using various approaches such as extraction from corpora, integration of the relevant pieces of knowledge from the pre-existing knowledge resources, and endogenous inference. Each of these techniques needs human supervision in order to deal with the potential errors, mapping difficulties or inferred candidate validation. We detail how various inference processes can be employed for lexical semantic resource building with less supervision. Our experience is based on the combination of different inference techniques for multilingual resource building and evaluation. Keywords: inference, multilingual knowledge resource, semantic relations, validation 1. Introduction in (Nickel et al., 2015) detail the statistical relational learn- ing on knowledge graphs (KGs) and point out the impor- The lexical and semantic resource building based on infer- tance of type constraints and transitivity. Similar to (Wang ence represents an appealing area of research. Inference et al., 2015), they base their method mainly on large scale consists in proposing new elements automatically based on KBs such as Nell (Carlson et al., 2010), KnowItAll (Et- the existing ones. In the context of a lexical semantic re- zioni et al., 2005), YAGO (Rebele et al., 2016) or DeepDive source, inference is a process of calculating new pieces of (Shin et al., 2015).
    [Show full text]