Problems in the Application of Rhetorical Structure Theory to Text Generation

Total Page:16

File Type:pdf, Size:1020Kb

Problems in the Application of Rhetorical Structure Theory to Text Generation Problems in the Application of Rhetorical Structure Theory to Text Generation. Thesis submitted in partial fulfilment of the M. Eng. Sc. (Cognitive Science) Degree. University of Melbourne June 1994 Nick Nicholas Colours of rethoryk been to me queynte; My spirit feeleth noght of swich mateere. — Geoffrey Chaucer, The Franklin’s Tale 726–727. Statement of Authorship. To the best of my knowledge, the work contained within this thesis is entirely my own, except that which is appropriately attributed to other authors. Nor has this work, either in part or in whole, been submitted as assessment to any other degree or diploma. Nick Nicholas June 1994 Acknowledgements. Την ευγνωµοσυνη´ µου και το ϑαυµασµο´ µου πρ´επει να απευϑυνω´ στην επι− σταµεν´ η´ µου, ∆ρα. Λ´εσλι Στ´ερλιγκ, που ε´ιχε την υποµονη´ και τη γνωση´ να µε καϑοδηγησει´ τους περασµ´ενους ´εξι µηνες,´ απο´ τους οπο´ιους τους τ´εσσερεις τους π´ερασα να οδηγω´ σε κυκλους.´ Θα ηϑελα´ επ´ισης να ευχαριστησω´ το ∆ρα. Ροµπερτ´ Ντ´ειλ, που µου προµηϑευσε´ αρκετ´ες χρησιµοτατες´ πηγ´ες την τελευ− τα´ια στιγµη.´ 1 ghotpu’vamvaD tlho’ vIja’ je: vIyo’na watSonvaD, jup QaQ Damo’ ’ej “ghItlhlIj yIruch” reH jIHvaD jatlhmo’; <melbIn> DuSaQ’a’ DIvI’ nawlogh loHvaD, DIvI’ngan QaQ Damo’ ’ej “ghItlhlIj yIruch” jIHvaD lujatlhQo’mo’; moHamaD maHDIrajIvaD, taHmo’ ghaH, yaH wIwavtaHvIS qaStaHvIS DIS bID, ’ej rIQchugh, vaj QIH ru’ neH SIQpu’; jon Hajeq QeDpInvaD, jIHvaD Qu’ nobmo’ ghaH, ’ej pagh lup buD vIghaj ’e’ HeQmoHmo’; tlhIngan Hollo- HvaD, tlhIngan De’wI’ QonoS je jeSwI’ HochvaD, lupmeyvetlh buD’e’ bong vIghajbogh waQmo’ chaH (nem tlhIngan Hol vIpojmeH, chay’ SoQvaD chen mu’tlheghghom pab ’e’ qel- bogh nger (ChSChMTlhGhP’KNg) vIlo’jaj); robet <lojbab> leSevalIy- ervaD, lojban De’wI’ QonoS jeSwI’ HochvaD je, jIHvaD HolQeD lulIHmo’ qaSpa’ latlh Hoch (jonwI’ lI’be’ vImojlaHbej, vaj Do’ vI- mojbe’pu’); ’ej ’Intlha kurtlhImvaD, Qaw’wI’’a’qoqvaD, loHvaD po’meH wIch Dachu’mo’ ’ej Sengmeyvo’ muleHmo’. HochvaD Qapla’ van je!2 1Appreciation and gratitude must go to my supervisor, Dr Lesley Stirling, for having the patience and the know- how to steer me through these past six months, of which I spent four running myself over. I would also like to thank Dr Robert Dale, who provided me with several useful references at the last minute. 2Thanks also to Fiona Watson, for being a good mate and telling me to do my thesis; to the Executive Committee of the Melbourne University Star Trek Club, for being good Trekkies and not telling me to do my thesis; to Mohammad Mahdiraji, for enduring a semester of sharing an office with me while undergoing little if any permanent damage; to Dr John Hajek, for employing me and making sure I should never have an idle moment; to all at the Klingon Language Institute and the Klingon Mailing List, for filling up those idle hours I somehow ended up having anyway (I hope I’ll do a Rhetorical Structure Theory (RST) analysis of Klingon one day!); to Bob ‘Lojbab’ LeChevalier and all those at the Lojban Mailing List, for getting me into linguistics in the first place (I’d have been pathetic as an engineer anyway); and to Indra ‘The Destroyer’ Kurzeme, for being an all-round legend of administrative dexterity and keeping me out of trouble. Success and salutations to you all! Contents. Statement of Authorship. .................................................................................iii Acknowledgements.......................................................................................... iv 1. Introduction..................................................................................................1 1.1. Rhetorical Structure Theory. ............................................................. 2 1.2. Computational Linguistics. .............................................................. 4 1.3. Connectives and Rhetorical Structure. ................................................. 5 1.4. Scott & de Souza’s Hypothesis.......................................................... 7 1.5. The issues considered. ...................................................................... 9 1.5.1. RST Ontology (Chapter 2).................................................9 1.5.2. RST Taxonomy (Chapter 3). .............................................10 1.5.3. The Scott & de Souza programme (Chapter 4). .....................11 2. RST Ontology............................................................................................ 12 2.1. What is a rhetorical relation? ............................................................12 2.1.1. The relational criterion. ....................................................14 2.1.2. Testing the relational criterion. ..........................................15 2.1.3. Against Volitionality. ......................................................16 2.1.4. Against Temporals. .........................................................17 2.1.5. For ELABORATION ..........................................................18 2.1.6. Computational implications. .............................................19 2.2. What is rhetorically related? .............................................................20 2.2.1. ........................................................................Clauses. 20 2.2.2. Propositions...................................................................22 2.2.3. Problems with a propositional RST. ...................................24 2.3. ..................................................................................Conclusion. 26 3. RST Taxonomy.......................................................................................... 28 3.1. Longacre’s taxonomy...................................................................... 29 3.2. Halliday & Hasan’s taxonomy. .........................................................31 3.2.1. Knott & Dale’s substitution classes. ...................................34 3.3. Mann & Thompson’s classifications.................................................. 35 3.3.1. The CAUSE Cluster. ........................................................35 3.3.2. The Causation cluster....................................................... 36 3.3.3. Relation pairings............................................................. 38 ENABLEMENT–MOTIVATION.......................................... 39 JUSTIFY–EVIDENCE...................................................... 39 ANTITHESIS–CONCESSION .............................................39 EVALUATION–INTERPRETATION. ....................................40 Other pairings. .............................................................40 3.4. The Tilburg taxonomy. ...................................................................40 3.4.1. The relations the Tilburg taxonomy includes. .......................40 3.4.2. The two CONCESSIONS ....................................................41 3.6. Hobbs’ taxonomy. .........................................................................43 3.7. A synthesis of taxonomies............................................................... 45 3.7.1. The taxonomical parameters. .............................................46 Presentational/Informational............................................ 46 Adversative/Non-Adversative. ..........................................47 Basic/Elaborative. .........................................................48 Deontic/Non-Deontic. ....................................................48 Modal/Non-Modal. ........................................................49 Illocutionary/Epistemic. .................................................49 BACKGROUND. ............................................................50 ANTITHESIS .................................................................51 3.7.2. Explaining connectives using the taxonomy. ........................51 3.8. Computational implications of an RST taxonomy. ..............................54 4. The Scott & de Souza programme.............................................................. 56 4.1. What Scott & de Souza propose: Theoretical heuristics. ........................57 4.1.1. Heuristic 1: ‘Accurate and unambiguous’. ............................57 4.1.2. Heuristic 2: ‘Keep the propositions together’. .......................59 4.1.3. Heuristic 3: ‘Single sentence’. ...........................................60 4.1.4. Heuristic 3: Van Dijk & Kintsch’s model. ...........................61 4.1.5. Heuristic 3: How many propositions per sentence? ................63 4.1.6. Heuristic 3: Clearer text? ..................................................65 4.2. What Scott & de Souza accomplish: Embedding. .................................66 4.2.1. Textual marking for ELABORATIONS.................................. 67 4.2.2. Where should ELABORATIONS be embedded? ........................69 4.2.3. Dangling sentences. .........................................................71 4.2.4. Syntactic complexity of embedding..................................... 72 4.3. What Scott & de Souza accomplish: Parataxis. ....................................73 4.3.1. ....................................................................Evaluation. 75 4.4. Filling in the blanks: Hypotaxis. ......................................................76 4.4.1. Distinguishing adversative relations textually. ......................79 4.5. Blanking out the fillers: Unsignalled rhetorical relations. .......................81 4.5.1. Unsignalled Presentational relations. ...................................81 4.5.2. OLUTIONHOOD. ............................................................S
Recommended publications
  • Querying Wikidata: Comparing SPARQL, Relational and Graph Databases
    Querying Wikidata: Comparing SPARQL, Relational and Graph Databases Daniel Hernández1, Aidan Hogan1, Cristian Riveros2, Carlos Rojas2, and Enzo Zerega2 Center for Semantic Web Research 1 Department of Computer Science, Universidad de Chile 2 Department of Computer Science, Pontificia Universidad Católica de Chile Resource type: Benchmark and Empirical Study Permanent URL: https://dx.doi.org/10.6084/m9.figshare.3219217 Abstract: In this paper, we experimentally compare the efficiency of various database engines for the purposes of querying the Wikidata knowledge-base, which can be conceptualised as a directed edge-labelled graph where edges can be annotated with meta-information called quali- fiers. We take two popular SPARQL databases (Virtuoso, Blazegraph), a popular relational database (PostgreSQL), and a popular graph database (Neo4J) for comparison and discuss various options as to how Wikidata can be represented in the models of each engine. We design a set of experiments to test the relative query performance of these representa- tions in the context of their respective engines. We first execute a large set of atomic lookups to establish a baseline performance for each test setting, and subsequently perform experiments on instances of more com- plex graph patterns based on real-world examples. We conclude with a summary of the strengths and limitations of the engines observed. 1 Introduction Wikidata is a new knowledge-base overseen by the Wikimedia foundation and collaboratively edited by a community of thousands of users [21]. The goal of Wikidata is to provide a common interoperable source of factual information for Wikimedia projects, foremost of which is Wikipedia. Currently on Wikipedia, articles that list entities – such as top scoring football players – and the info- boxes that appear on the top-right-hand side of articles – such as to state the number of goals scored by a football player – must be manually maintained.
    [Show full text]
  • Processing Natural Language Arguments with the <Textcoop>
    Argument and Computation Vol. 3, No. 1, March 2012, 49–82 Processing natural language arguments with the <TextCoop> platform Patrick Saint-Dizier* IRIT-CNRS, 118 route de Narbonne 31062 Toulouse, France (Received 15 June 2011; final version received 31 January 2012) In this article, we first present the <TextCoop> platform and the Dislog language, designed for discourse analysis with a logic and linguistic perspective. The platform has now reached a certain level of maturity which allows the recognition of a large diversity of discourse structures including general-purpose rhetorical structures as well as domain-specific discourse structures. The Dislog language is based on linguistic considerations and includes knowledge access and inference capabilities. Functionalities of the language are presented together with a method for writing discourse analysis rules. Efficiency and portability of the system over domains and languages are investigated to conclude this first part. In a second part, we analyse the different types of arguments found in several document genres, most notably: procedures, didactic texts and requirements. Arguments form a large class of discourse relations. A generic and frequently encountered form emerges from our analysis: ‘reasons for conclusion’ which constitutes a homogeneous family of arguments from a language, functional and conceptual point of view. This family can be viewed as a kind of proto-argument. We then elaborate its linguistic structure and show how it is implemented in <TextCoop>. We then investigate the cooperation between explanation and arguments, in particular in didactic texts where they are particularly rich and elaborated. This article ends with a prospective section that develops current and potential uses of this work and how it can be extended to the recognition of other forms of arguments.
    [Show full text]
  • Arxiv:1910.13561V1 [Cs.LG] 29 Oct 2019 E-Mail: [email protected] M
    Noname manuscript No. (will be inserted by the editor) A Heuristically Modified FP-Tree for Ontology Learning with Applications in Education Safwan Shatnawi · Mohamed Medhat Gaber ∗ · Mihaela Cocea Received: date / Accepted: date Abstract We propose a heuristically modified FP-Tree for ontology learning from text. Unlike previous research, for concept extraction, we use a regular expression parser approach widely adopted in compiler construction, i.e., deterministic finite automata (DFA). Thus, the concepts are extracted from unstructured documents. For ontology learning, we use a frequent pattern mining approach and employ a rule mining heuristic function to enhance its quality. This process does not rely on predefined lexico-syntactic patterns, thus, it is applicable for different subjects. We employ the ontology in a question-answering system for students' content-related questions. For validation, we used textbook questions/answers and questions from online course forums. Subject experts rated the quality of the system's answers on a subset of questions and their ratings were used to identify the most appropriate automatic semantic text similarity metric to use as a validation metric for all answers. The Latent Semantic Analysis was identified as the closest to the experts' ratings. We compared the use of our ontology with the use of Text2Onto for the question-answering system and found that with our ontology 80% of the questions were answered, while with Text2Onto only 28.4% were answered, thanks to the finer grained hierarchy our approach is able to produce. Keywords Ontologies · Frequent pattern mining · Ontology learning · Question answering · MOOCs S. Shatnawi College of Applied Studies, University of Bahrain, Sakhair Campus, Zallaq, Bahrain E-mail: [email protected] M.
    [Show full text]
  • Building Dialogue Structure from Discourse Tree of a Question
    The Workshops of the Thirty-Second AAAI Conference on Artificial Intelligence Building Dialogue Structure from Discourse Tree of a Question Boris Galitsky Oracle Corp. Redwood Shores CA USA [email protected] Abstract ed, chat bot’s capability to maintain the cohesive flow, We propose a reasoning-based approach to a dialogue man- style and merits of conversation is an underexplored area. agement for a customer support chat bot. To build a dia- When a question is detailed and includes multiple sen- logue scenario, we analyze the discourse tree (DT) of an ini- tences, there are certain expectations concerning the style tial query of a customer support dialogue that is frequently of an answer. Although a topical agreement between ques- complex and multi-sentence. We then enforce what we call tions and answers have been extensively addressed, a cor- complementarity relation between DT of the initial query respondence in style and suitability for the given step of a and that of the answers, requests and responses. The chat bot finds answers, which are not only relevant by topic but dialogue between questions and answers has not been thor- also suitable for a given step of a conversation and match oughly explored. In this study we focus on assessment of the question by style, argumentation patterns, communica- cohesiveness of question/answer (Q/A) flow, which is im- tion means, experience level and other domain-independent portant for a chat bots supporting longer conversation. attributes. We evaluate a performance of proposed algo- When an answer is in a style disagreement with a question, rithm in car repair domain and observe a 5 to 10% im- a user can find this answer inappropriate even when a topi- provement for single and three-step dialogues respectively, in comparison with baseline approaches to dialogue man- cal relevance is high.
    [Show full text]
  • Semantic Web: a Review of the Field Pascal Hitzler [email protected] Kansas State University Manhattan, Kansas, USA
    Semantic Web: A Review Of The Field Pascal Hitzler [email protected] Kansas State University Manhattan, Kansas, USA ABSTRACT which would probably produce a rather different narrative of the We review two decades of Semantic Web research and applica- history and the current state of the art of the field. I therefore do tions, discuss relationships to some other disciplines, and current not strive to achieve the impossible task of presenting something challenges in the field. close to a consensus – such a thing seems still elusive. However I do point out here, and sometimes within the narrative, that there CCS CONCEPTS are a good number of alternative perspectives. The review is also necessarily very selective, because Semantic • Information systems → Graph-based database models; In- Web is a rich field of diverse research and applications, borrowing formation integration; Semantic web description languages; from many disciplines within or adjacent to computer science, Ontologies; • Computing methodologies → Description log- and a brief review like this one cannot possibly be exhaustive or ics; Ontology engineering. give due credit to all important individual contributions. I do hope KEYWORDS that I have captured what many would consider key areas of the Semantic Web field. For the reader interested in obtaining amore Semantic Web, ontology, knowledge graph, linked data detailed overview, I recommend perusing the major publication ACM Reference Format: outlets in the field: The Semantic Web journal,1 the Journal of Pascal Hitzler. 2020. Semantic Web: A Review Of The Field. In Proceedings Web Semantics,2 and the proceedings of the annual International of . ACM, New York, NY, USA, 7 pages.
    [Show full text]
  • Problem of Extracting the Knowledge of Experts Fkom the Perspective of Experimental Psychology
    AI Magazine Volume 8 Number 2 (1987) (© AAAI) The ‘Problem of Extracting the Knowledge of Experts fkom the Perspective of Experimental Psychology RobertR.Hoffman or perceptual and conceptual and represent their special knowledge The first step in the development of an problems requiring the skills of . [It] may take several months of the expert system is the extraction and charac- an expert, expertise is rare, the expert’s time and even more of the terization of the knowledge and skills of an expert’s knowledge is extremely system builder’s” (p. 264). Three years expert. This step is widely regarded as the detailed and interconnected, and our later, Duda and Shortliffe (1983) major bottleneck in the system develop- scientific understanding of the echoed this lament: “The identifica- ment process To assist knowledge engi- expert’s perceptual and conceptual tion and encoding of knowledge is one neers and others who might be interested in the development of an expert system, I processes is limited. Research on the of the most complex and arduous offer (1) a working classification of meth- skills of experts in any domain affords tasks encountered in the construction ods for extracting an expert’s knowledge, an excellent opportunity for both of an expert system” (p. 265). (2) some ideas about the types of data that basic and practical experimentation. Some common phrases that occur the methods yield, and (3) a set of criteria My investigations fall on the experi- in the literature are “knowledge acqui- by which the methods can be compared mental psychology side of expert sys- sition is the time-critical component” relative to the needs of the system develop- tem engineering, specifically the prob- (Freiling et al.
    [Show full text]
  • Towards Unsupervised Knowledge Extraction
    Towards Unsupervised Knowledge Extraction Dorothea Tsatsoua,b, Konstantinos Karageorgosa, Anastasios Dimoua, Javier Carbob, Jose M. Molinab and Petros Darasa aInformation Technologies Institute (ITI), Centre for Research and Technology Hellas (CERTH), 6th km Charilaou-Thermi Road, 57001, Thermi, Thessaloniki, Greece bComputer Science Department, University Carlos III of Madrid, Av. Universidad 30, Leganes, Madrid 28911, Spain Abstract Integration of symbolic and sub-symbolic approaches is rapidly emerging as an Artificial Intelligence (AI) paradigm. This paper presents a proof-of-concept approach towards an unsupervised learning method, based on Restricted Boltzmann Machines (RBMs), for extracting semantic associations among prominent entities within data. Validation of the approach is performed in two datasets that connect lan- guage and vision, namely Visual Genome and GQA. A methodology to formally structure the extracted knowledge for subsequent use through reasoning engines is also offered. Keywords knowledge extraction, unsupervised learning, spectral analysis, formal knowledge representation, symbolic AI, sub-symbolic AI, neuro-symbolic integration 1. Introduction Nowadays, artificial intelligence (AI) is linked mostly to machine learning (ML) solutions, enabling machines to learn from data and subsequently make predictions based on unidentified patterns in data, taking advantage of neural network (NN)-based methods. However, AI is still far from encompassing human-like cognitive capacities, which include not only learning but also understanding1, abstracting, planning, representing knowledge and logically reasoning over it. On the other hand, Knowledge Representation and Reasoning (KRR) techniques allow machines to reason about structured knowledge, in order to perform human-like complex problem solving and decision-making. AI foundations propose that all the aforementioned cognitive processes (learning, abstracting, representing, reasoning) need to be integrated under a unified strategy, in order to advance to In A.
    [Show full text]
  • Automated Knowledge Base Management: a Survey
    Automated Knowledge Base Management: A Survey Jorge Martinez-Gil Software Competence Center Hagenberg (Austria) email: [email protected], phone number: 43 7236 3343 838 Keywords: Information Systems, Knowledge Management, Knowledge-based Technology Abstract A fundamental challenge in the intersection of Artificial Intelligence and Databases consists of devel- oping methods to automatically manage Knowledge Bases which can serve as a knowledge source for computer systems trying to replicate the decision-making ability of human experts. Despite of most of tasks involved in the building, exploitation and maintenance of KBs are far from being trivial, signifi- cant progress has been made during the last years. However, there are still a number of challenges that remain open. In fact, there are some issues to be addressed in order to empirically prove the technology for systems of this kind to be mature and reliable. 1 Introduction Knowledge may be a critical and strategic asset and the key to competitiveness and success in highly dynamic environments, as it facilitates capacities essential for solving problems. For instance, expert systems, i.e. systems exploiting knowledge for automation of complex or tedious tasks, have been proven to be very successful when analyzing a set of one or more complex and interacting goals in order to determine a set of actions to achieve those goals, and provide a detailed temporal ordering of those actions, taking into account personnel, materiel, and other constraints [9]. However, the ever increasing demand of more intelligent systems makes knowledge has to be cap- tured, processed, reused, and communicated in order to complete even more difficult tasks.
    [Show full text]
  • Ontology and Information Systems
    Ontology and Information Systems 1 Barry Smith Philosophical Ontology Ontology as a branch of philosophy is the science of what is, of the kinds and structures of objects, properties, events, processes and relations in every area of reality. ‘Ontology’ is often used by philosophers as a synonym for ‘metaphysics’ (literally: ‘what comes after the Physics’), a term which was used by early students of Aristotle to refer to what Aristotle himself called ‘first philosophy’.2 The term ‘ontology’ (or ontologia) was itself coined in 1613, independently, by two philosophers, Rudolf Göckel (Goclenius), in his Lexicon philosophicum and Jacob Lorhard (Lorhardus), in his Theatrum philosophicum. The first occurrence in English recorded by the OED appears in Bailey’s dictionary of 1721, which defines ontology as ‘an Account of being in the Abstract’. Methods and Goals of Philosophical Ontology The methods of philosophical ontology are the methods of philosophy in general. They include the development of theories of wider or narrower scope and the testing and refinement of such theories by measuring them up, either against difficult 1 This paper is based upon work supported by the National Science Foundation under Grant No. BCS-9975557 (“Ontology and Geographic Categories”) and by the Alexander von Humboldt Foundation under the auspices of its Wolfgang Paul Program. Thanks go to Thomas Bittner, Olivier Bodenreider, Anita Burgun, Charles Dement, Andrew Frank, Angelika Franzke, Wolfgang Grassl, Pierre Grenon, Nicola Guarino, Patrick Hayes, Kathleen Hornsby, Ingvar Johansson, Fritz Lehmann, Chris Menzel, Kevin Mulligan, Chris Partridge, David W. Smith, William Rapaport, Daniel von Wachter, Chris Welty and Graham White for helpful comments.
    [Show full text]
  • Ontology to Appear in the Encyclopedia of Database Systems, Ling Liu and M
    Ontology to appear in the Encyclopedia of Database Systems, Ling Liu and M. Tamer Özsu (Eds.), Springer-Verlag, 2008. TITLE OF ENTRY Ontology BYLINE Tom Gruber, http://tomgruber.org. Formerly of Stanford University, Intraspect Software, and RealTravel.com. SYNONYMS computational ontology, semantic data model, ontological engineering DEFINITION In the context of computer and information sciences, an ontology defines a set of representational primitives with which to model a domain of knowledge or discourse. The representational primitives are typically classes (or sets), attributes (or properties), and relationships (or relations among class members). The definitions of the representational primitives include information about their meaning and constraints on their logically consistent application. In the context of database systems, ontology can be viewed as a level of abstraction of data models, analogous to hierarchical and relational models, but intended for modeling knowledge about individuals, their attributes, and their relationships to other individuals. Ontologies are typically specified in languages that allow abstraction away from data structures and implementation strategies; in practice, the languages of ontologies are closer in expressive power to first-order logic than languages used to model databases. For this reason, ontologies are said to be at the "semantic" level, whereas database schema are models of data at the "logical" or "physical" level. Due to their independence from lower level data models, ontologies are used for integrating heterogeneous databases, enabling interoperability among disparate systems, and specifying interfaces to independent, knowledge-based services. In the technology stack of the Semantic Web standards [1], ontologies are called out as an explicit layer. There are now standard languages and a variety of commercial and open source tools for creating and working with ontologies.
    [Show full text]
  • A Knowledge Acquisition Assistant for the Expert System Shell Nexpert-Object
    Rochester Institute of Technology RIT Scholar Works Theses 1988 A knowledge acquisition assistant for the expert system shell Nexpert-Object Florence Perot Follow this and additional works at: https://scholarworks.rit.edu/theses Recommended Citation Perot, Florence, "A knowledge acquisition assistant for the expert system shell Nexpert-Object" (1988). Thesis. Rochester Institute of Technology. Accessed from This Thesis is brought to you for free and open access by RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administrator of RIT Scholar Works. For more information, please contact [email protected]. Rochester Institute of Technology School of Computer Science and Technology A KNOWLEDGE ACQUISITION ASSISTANT FOR THE EXPERT SYSTEM SHELL NEXPERT-OBJECTTM By FLORENCE C. PEROT A thesis, submitted to The Faculty of the School ofCornputer Science and Technology In partial fulfillment of the requ.irements for the degree of Master of Science i.n COF~?uter Science Approved by: 'lIfer! r~ Pro John A. Biles (ICSG Department, R.I.TJ Date Dr. Alain T. Rappaport (President, Neuron Data) Date Dr. Peter G. Anderson (ICSG Chairman, R.I.T.) ;7 1J'{A{e? 'I.-g ROCHESTER, NEW-YORK August, 1988 ABSTRACT This study addresses the problems of knowledge acquisition in expert system development examines programs whose goal is to solve part of these problems. Among them are knowledge acquisition tools, which provide the knowledge engineer with a set of Artificial Intelligence primitives, knowledge acquisition aids, which offer to the knowledge engineer a guidance in knowledge elicitation, and finally, automated systems, which try to replace the human interviewer with a machine interface.
    [Show full text]
  • Ontomap – the Guide to the Upper-Level
    OntoMap – the Guide to the Upper-Level Atanas K. Kiryakov, Marin Dimitrov OntoText Lab., Sirma AI EOOD Chr. Botev 38A, 1000 Sofia, Bulgaria, naso,marin @sirma.bg f g Kiril Iv. Simov Linguistic Modelling Laboratory, Bulgarian Academy of Sciences Akad. G. Bontchev Str. 25A, 1113 Sofia, Bulgaria, [email protected] Abstract. The upper-level ontologies are theories that capture the most common con- cepts, which are relevant for many of the tasks involving knowledge extraction, repre- sentation, and reasoning. These ontologies use to represent the skeleton of the human common-sense in such a formal way that covers as much aspects (or ”dimensions”) of the knowledge as possible. Often the result is relatively complex and abstract philo- sophic theory. Currently the evaluation of the feasibility of such ontologies is pretty expensive mostly because of technical problems such as different representations and terminolo- gies used. Additionally, there are no formal mappings between the upper-level ontolo- gies that could make easier their understanding, study, and comparison. As a result, the upper-level models are not widely used. We present OntoMap — a project with the pragmatic goal to facilitate an easy access, understanding, and reuse of such resources in order to make them useful for experts outside the ontology/knowledge engineering community. A semantic framework on the so called conceptual level that is small and easy enough to be learned on-the-fly is designed and used for representation. Technically OntoMap is a web-site (http://www.ontomap.org) that provides access to upper-level ontologies and hand-crafted mappings between them.
    [Show full text]