Prolog and natural-language analysis
Prolog and natural-language analysis
Feature structures: a logical theory with application to language analysis
Feature structures: a logical theory with application to language analysis
Implementing systemic classification by unification
Computational Linguistics
Reasoning and revision in hybrid representation systems
Reasoning and revision in hybrid representation systems
Understanding Natural Language
Understanding Natural Language
Computational Complexity and Natural Language
Computational Complexity and Natural Language
BACK to Consistency and Incompleteness
GWAI '85 Proceedings of the 9th German Workshop on Artificial Intelligence
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Unification of disjunctive feature descriptions
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
An experimental parser for systemic grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
ProFIT: prolog with features, inheritance and templates
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Computational and Quantitative Studies
Computational Linguistics
Product matching algorithm for cooperative commerce model
ACACOS'11 Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science
| Hi-index | 0.00 |
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.