Systemic classification and its efficiency
Published 1 December 1991
C. Brew
Citations15
SJR quartileQ1
SJR score1.15
SNIP4.16
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that the problem of classifying linguistic objects on the basis of information encoded in the system network formalism developed by Halliday is NP-hard, and a restriction to the formalism is suggested.
Abstract
This paper examines the problem of classifying linguistic objects on the basis of information encoded in the system network formalism developed by Halliday. It is shown that this problem is NP-hard, and a restriction to the formalism, which renders the classification problem soluble in polynomial time, is suggested. An algorithm for the unrestricted classification problem, which separates a potentially expensive second stage from a more tractable first stage, is then presented.
Keywords
Computer Science
Cognitive PsychologyUnderstanding natural language
2,802 Citations1972Terry Winograd
A computer system for understanding English that contains a parser, a recognition grammar of English, programs for semantic analysis, and a general problem solving system based on the belief that in modeling language understanding, it must deal in an integrated way with all of the aspects of language—syntax, semantics, and inference.
Cognitive ScienceAn overview of the KL-ONE Knowledge Representation System
1,620 Citations1985R. J. Brachman, James G. Schmolze
The kernel ideas of KL-ONE are presented, emphasizing its ability to form complex structured descriptions, and notions of taxonomy and classification that are central to it are highlighted.
Digital Access to Scholarship at Harvard (DASH) (Harvard University)An introduction to unification-based approaches to grammar
946 Citations1986Stuart M. Shieber
Lecture notes in computer scienceReasoning and Revision in Hybrid Representation Systems
401 Citations1990Bernhard Nebel
The universal term-forming formalism is a hybrid representation formalism that combines terminological cycles, representation and management of knowledge, and reasoning in the formalism.
Language<b>Prolog and natural language analysis</b> . By Fernando C.N. Pereira and Stuart M. Shieber (CSLI Lecture Notes 10.) Stanford: Center for the Study of Language and Information, 1987. Pp. viii, 266.
370 Citations1988S. P. Harrison
This well-written book mainly devoted to Prolog and logic grammars to a large extent meets the challenge and is probably the best presentation of the topic I have ever seen, apart from the excellent book The Art of Prolog.
Computational complexity and natural language
273 Citations1987Geoff Barton, Robert C. Berwick +1 more
A unified and coherent account emerges of how complexity theory can probe the information-processing structure of grammars, discovering why a grammar is easy or difficult to process and suggesting where to look for additional grammatical constraints.
The Loom Knowledge Representation Language.
185 Citations1987Robert M. MacGregor, Raymond L. Bates
This paper describes the knowledge representation language developed for the Loom system, where the traditional single-classifier architecture is replaced by one containing a collection of classifiers which exhibit increasingly powerful inference capabilities.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Nigel: A Systemic Grammar for Text Generation.
100 Citations1983William C. Mann, Christian M.I.M. Matthiessen
The report consists of three papers on Nigel: an introductory overview, the script of a demonstration of its use in generation, and an exposition of how Nigel relates to the systemic framework.
Decision Support SystemsRecent developments in NIKL
77 Citations1987Thomas S. Kaczmarek
This article reports on the extensions that are found necessary to the NIKL language, based on experiences in several different testbeds and the motivations for the extensions are presented.
A unification method for disjunctive feature descriptions
70 Citations1987Robert Kasper
This paper describes a method of unification by successive approximation, resulting in better average performance for descriptions containing large quantities of disjunction.
Unification of disjunctive feature descriptions
40 Citations1988Andreas Eisele, Jochen Dörre
The paper describes a new implementation of feature structures containing disjunctive values, which can be characterized by the following main points: local representation of embedded disjunctions, avoidance of expansion to disJunctive normal form and of repeated test-unifications for checking consistence.
An experimental parser for systemic grammars
37 Citations1988Robert Kasper
This paper constructs a parser by compiling systemic grammars into the notation of Functional Unification Grammar, and testing is the basis for some observations about the bidirectional use of a grammar.
International Journal of Man-Machine StudiesProcedural systemic grammars
21 Citations1977Michael C. McCord
A formalism PSGL has been developed, along with a computer system for interpreting it and parsing sentences, that allows one to write compact and linguistically apt grammars.
Natural Language GenerationA Formal Model of Systemic Grammar
19 Citations1987Terry Patten, Graéme Ritchie
The formal model of systemic grammar presented here will involve ‘rigorous rules’ but will not compromise the functional perspective of language as a ‘resource’.
Informatik-FachberichteBACK to Consistency and Incompleteness
7 Citations1986Kai von Luck, Bernhard Nebel +2 more
The knowledge representation system BACK, a descendant of the ‘New Implementation of SRL’, is described focussing on the problems of how to achieve a consistent knowledge base and how to cope with incomplete knowledge.