Results 1 -
4 of
4
Combining lexical resources: Mapping between propbank and verbnet
- In Proceedings of the 7th International Workshop on Computational Linguistics
, 2007
"... A wide variety of lexical resources have been created to allow automatic semantic processing of novel text. However, each resource has its own practical and theoretical idiosyncracies, making it difficult to combine the information from different resources. We discuss the form that these differences ..."
Abstract
-
Cited by 35 (10 self)
- Add to MetaCart
A wide variety of lexical resources have been created to allow automatic semantic processing of novel text. However, each resource has its own practical and theoretical idiosyncracies, making it difficult to combine the information from different resources. We discuss the form
1Personality and Structure of Resource Preferences TWO STUDIES IN RESOURCE THEORY
"... the stages of development of the PW ("Persönliche Wunschvorstellungen "- "Inventory of Preferences for Interpersonal Resources")- a German version of the "Inventory of Wishes for Interpersonal Resources " (IWIR; Foa & Bosman, 1979)-, the second study reports the res ..."
Abstract
- Add to MetaCart
the results of an application of this psychological instrument. A detailed description of resource theory, its structure, and its premises can be found in some other parts of this book. In this chapter only those characteristics of the theoretical model are mentioned which are in close connection
Syntactic Computation as Labelled Deduction: WH a case study
- Syntactic Categories
, 2000
"... Over the past thirty years, the phenomenon of long-distance dependence has become one of the most well studied phenomena. Requiring as it does correlation between some position in a string and the c-commanding operator which determines its interpretation, it is uncontroversially assumed across diffe ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
different theoretical frameworks to involve an operator-variable binding phenomenon as in standard predicate logics (cf. Chomsky 1981, Morrill 1994, Pollard & Sag 1991, Lappin & Johnson 1996). However, it is known to display a number of properties which distinguish it from the logical operation
Some relations between classes of low computational complexity
- Bulletin of London Mathematical Society
, 1984
"... In 1978 I believed that I had established the results of this paper; in 1980 I tried unsuccessfully to recover the certainly uncouth, possibly fallacious proofs so that they could be included in the Festschrift for Professor Specker's 60th birthday. The reasonably concise proof given here is ne ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
be defined using 2-bounded primitive recursion it can also be defined using simultaneous 0-bounded recursions. By a class %> of number-theoretic functions we shall always mean a collection which contains the successor function, the case function C {Cxyuv = x if u = v, Cxyuv = y\fu^v) and which is closed