Paper Info
Title
Partial descriptions and systemic grammar
Abstract
This paper examines the properties of featurebased partial descriptions built on top of Halliday's systemic networks. We show that the crucial operation of consistency checking for such descriptions is NP-complete, and therefore probably intractable, but proceed to develop algorithms which can sometimes alleviate the unpleasant consequences of this intractability.
Year
DOI
Venue
1990
10.3115/991146.991153
COLING
Keywords
Field
DocType
systemic grammar,unpleasant consequence,consistency checking,systemic network,crucial operation,featurebased partial description
Computer science,Grammar,Artificial intelligence,Natural language processing
Conference
Volume
ISBN
Citations 
C90-3
952-90-2028-7
1
PageRank 
References 
Authors
0.39
4
1
Name
Order
Citations
PageRank
Chris Brew132144.44