{"title":"Developing natural language interfaces through NALIGE","authors":"B. Manaris, R. Glanville, Timothy E. Gillis","doi":"10.1109/TAI.1994.346482","DOIUrl":"https://doi.org/10.1109/TAI.1994.346482","url":null,"abstract":"The paper discusses the development of natural language interfaces to interactive computer systems through the NALIGE user interface management system. Such an activity is reduced to producing a set of well-formed specifications which describe lexical, syntactic, semantic, and pragmatic aspects of the selected application domain. These specifications are converted by NALIGE to an autonomous natural language interface that exhibits the prescribed linguistic and functional behavior. The development of a natural language interface to Unix and its subsequent porting to MS-DOS, VAX/VMS, and VM/CMS is presented. Finally, the development of a natural language interface for Internet navigation and resource location is discussed.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127271659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel method for parsing complex sentences in syntactically free languages","authors":"S. Michos, N. Fakotakis, G. Kokkinakis","doi":"10.1109/TAI.1994.346483","DOIUrl":"https://doi.org/10.1109/TAI.1994.346483","url":null,"abstract":"Free word-order languages cause problems when being analysed due to their great composing power and flexibility. The paper deals with the problems stemming from the analysis of complex sentences as well as with the adoption of suitable grammars to parse them in free word-order languages. Based on a careful study of large Greek corpora, we propose a method for parsing complex sentences in such languages that combines heuristic information and pattern matching techniques in early processing levels. Although this method has been implemented and tested in the Greek language, its theoretical background and results are language independent and can be proved useful for many practical applications.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127529326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Solving diagramless crossword puzzles","authors":"Edward Pershits, R. Stansifer","doi":"10.1109/TAI.1994.346521","DOIUrl":"https://doi.org/10.1109/TAI.1994.346521","url":null,"abstract":"An interesting computational challenge is posed by finding the diagram in diagramless crossword puzzles. We describe two approaches to placing the words in the diagram to form a crossword puzzle, given the \"across\" and the \"down\" words. One algorithm systematically tries the possibilities. By discarding partially completed puzzles the solutions for large puzzles can be found in a reasonable amount of time. The second algorithm uses on intelligent search strategy building up the diagram word-by-word. Both methods were programmed in Modula-3, a strongly-typed, object-oriented language. We describe the programs and analyze their performance on a SPARC computer.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128936344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrating external functions in an object oriented reasoning system","authors":"Tang Yu, L. Henschen","doi":"10.1109/TAI.1994.346419","DOIUrl":"https://doi.org/10.1109/TAI.1994.346419","url":null,"abstract":"The paper describes an object-oriented system that smoothly integrates procedural function invocation and declarative rule reasoning into a single homogeneous system. This allows efficient computations expressed as external functions to be incorporated into rule systems to improve computational efficiency and extensibility of intelligent systems. We first discuss the differences between declarative rules and procedural functions. We then describe an object-oriented model that incorporates both of these. The model has a translation phase and an execution phase. We also discuss problems arising from the different ways that data are represented (terms in rules vs. data objects in functions), from the existence of user-defined types in functions and the necessary argumentations to the unification process in the rule system.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132101799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Knowledge-based querying","authors":"F.-Y. Villemin, A. Paoli","doi":"10.1109/TAI.1994.346467","DOIUrl":"https://doi.org/10.1109/TAI.1994.346467","url":null,"abstract":"The system we present is an intelligent database assistant based on a knowledge level view of databases: When a user wants to retrieve data from a database, he first conceptualizes the question (usually expressed by means of other concepts common to persons doing the same job, or \"trade concepts\"), then translates this \"mental\" concept into a (Set) query. In our L/sub ex/ system, concepts are implemented in a hybrid language closed to mental concept formulation. Each well-formed concept in L/sub ex/ corresponds a safe extended relational calculus of tuples formula, and, therefore, a SQL query. In our system, a relational database is first reified (a \"concept vision\" of the database is built in L/sub ex/). Domain knowledge and user knowledge are expressed by a set of L/sub ex/ concepts. A query is viewed as computing the interpretation of its corresponding concept, which is done by (automatically) rewriting it into a SQL query.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130282885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Context free language induction with genetic programming","authors":"B. Dunay","doi":"10.1109/TAI.1994.346391","DOIUrl":"https://doi.org/10.1109/TAI.1994.346391","url":null,"abstract":"This paper reports on the induction of context free languages using genetic programming. The focus is on language inference, i.e. the inference of formal languages such as those of the Chomsky hierarchy from positive (and negative) sample strings. In this paper, the inference process is extended to the class of context-free grammars. Deterministic pushdown automata are induced from samples of context free languages. The algorithm is a variation of genetic algorithms using free shaped chromosomes to represent the transition tables of the various automata.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126083523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A neural network for supervised learning of natural language grammar","authors":"Dominique Archambault, J. Bassano","doi":"10.1109/TAI.1994.346481","DOIUrl":"https://doi.org/10.1109/TAI.1994.346481","url":null,"abstract":"Within the framework of the expert information retrieval system, DIALECT 2, we propose a connectionist method for a linguistic morpho-syntactic parser of the French language. The system is based upon a three layered neural network with a recursive sentence structure. This network is in charge of the acquisition of natural language grammatical competence. The learning stage is supervised and distributed into several levels. The learning algorithm uses a measure grounded on an entropic computation. We describe the overall architecture of the system and show the first results obtained with samples made up with sentences from schoolbooks for children who are taught reading.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121076743","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
John R. R. Leavitt, Deryle W. Lonsdale, K. Keck, Eric Nyberg
{"title":"Tooling the lexicon acquisition process for large-scale KBMT","authors":"John R. R. Leavitt, Deryle W. Lonsdale, K. Keck, Eric Nyberg","doi":"10.1109/TAI.1994.346479","DOIUrl":"https://doi.org/10.1109/TAI.1994.346479","url":null,"abstract":"Large-scale lexical knowledge acquisition is one of the most time critical steps in developing a knowledge-based machine translation system. In particular, developing the syntactic lexicon for the target language can be an unwieldy task, as on-line knowledge assets are likely to be more scarce than for the source language. This paper addresses this problem within the KANT machine translation system and describes how we structure the KA process to address this problem. This was done by first determining the nature of the desired process and then developing tools to implement that process. The tools themselves and the ways in which the helped us to realize our design goals are described. We conclude that, while the problem of lexical acquisition can be formidable, it can be overcome with proper foresight and tool design.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The RISE system: conquering without separating","authors":"Pedro M. Domingos","doi":"10.1109/TAI.1994.346421","DOIUrl":"https://doi.org/10.1109/TAI.1994.346421","url":null,"abstract":"Current rule induction systems (e.g. CN2) typically rely on a \"separate and conquer\" strategy, learning each rule only from still-uncovered examples. This results in a dwindling number of examples being available for learning successive rules, adversely affecting the system's accuracy. An alternative is to learn all rules simultaneously, using the entire training set for each. This approach is implemented in the RISE 1.0 system. Empirical comparison of RISE with CN2 suggests that \"conquering without separating\" performs similarly to its counterpart in simple domains, but achieves increasingly substantial gains in accuracy as the domain difficulty grows.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"9 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134624950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A resonance correlation network with adaptive fuzzy leader clustering","authors":"Randy B. Cleary, P. Israel","doi":"10.1109/TAI.1994.346499","DOIUrl":"https://doi.org/10.1109/TAI.1994.346499","url":null,"abstract":"Cluster analysis is a significant area of research in pattern recognition. Determining the optimal number of clusters in any real data set remains a difficult problem. The paper develops a new neural network model with the combined advantages of self-organization and no sequential search (as in the resonance correlation network) with more stable, fewer and better clusters (as in the adaptive fuzzy leader clustering network). This new model is the Adaptive Fuzzy Leader Clustering Resonance Correlation Network (AFLCRCN). It adaptively clusters continuous-valued data into classes without a priori knowledge of the entire data set or ifs number of clusters. AFLCRCN incorporates the fuzzy K-means learning rule used in the AFLC network into the RCN control structure. It has a modular design that allows metric replacement for improved performance in a specific problem. Applications for the model include classification, feature extraction, and pattern recognition.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115989032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}