Journal of Logic, Language and Information 8 (1):1-16 (1999)
|Abstract||Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well founded, whereas in the presence of cycles general TFS subsumption is not well founded. We show an application of this result for parsing, where the well-foundedness of subsumption is used to guarantee termination for grammars that are off-line parsable. We define a new version of off-line parsability that is less strict than the existing one; thus termination is guaranteed for parsing with a larger set of grammars.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Daniel Feinstein & Shuly Wintner (2008). Highly Constrained Unification Grammars. Journal of Logic, Language and Information 17 (3).
Pablo Gamallo (2013). Lexical Inheritance with Meronymic Relationships. Axiomathes 23 (1):165-185.
Robert C. Cummins (1983). Analysis and Subsumption in the Behaviorism of Hull. Philosophy of Science 50 (March):96-111.
Guido Starosta (2003). Scientific Knowledge and Political Action: On the Antinomies of Lukács' Thought in "History and Class Consciousness". Science and Society 67 (1):39 - 67.
Neil Levy (2004). Epistemic Akrasia and the Subsumption of Evidence. Croatian Journal of Philosophy 4 (1):149-156.
P. Garbacz (2004). Subsumption and Relative Identity. Axiomathes 14 (4):341-360.
Robert C. Cummins (1978). Explanation and Subsumption. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1978:163 - 175.
Efrat Jaeger, Nissim Francez & Shuly Wintner (2005). Unification Grammars and Off-Line Parsability. Journal of Logic, Language and Information 14 (2).
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,507 of 548,973 )
Recent downloads (6 months)0
How can I increase my downloads?