Complex predicates via restriction

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

BUTT, Miriam, Tracy Holloway KING, John T. MAXWELL, 2003. Complex predicates via restriction. LFG03 : 8th International LFG Conference. Saratoga Springs, New York, Jul 16, 2003 - Jul 18, 2003. In: BUTT, Miriam, ed., Tracy Holloway KING, ed.. Proceedings of the LFG03 Conference. Stanford, California:CSLI Publications, pp. 92-104. ISSN 1098-6782

@inproceedings{Butt2003Compl-41407, title={Complex predicates via restriction}, url={http://web.stanford.edu/group/cslipublications/cslipublications/LFG/8/pdfs/lfg03buttetal.pdf}, year={2003}, issn={1098-6782}, address={Stanford, California}, publisher={CSLI Publications}, booktitle={Proceedings of the LFG03 Conference}, pages={92--104}, editor={Butt, Miriam and King, Tracy Holloway}, author={Butt, Miriam and King, Tracy Holloway and Maxwell, John T.} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/41407"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-02-16T09:39:23Z</dcterms:available> <dc:creator>Butt, Miriam</dc:creator> <dc:contributor>Maxwell, John T.</dc:contributor> <dcterms:issued>2003</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:abstract xml:lang="eng">This paper continues the discussion of the RESTRICTION OPERATOR (Kaplan and Wedekind, 1993) and whether it can provide a linguistically adequate solution to the problem posed by syntactic complex predicate formation. The solution introduced here has been implemented as part of an on-going project aimed at the development of a computational grammar for Urdu and can be shown to model the linguistic facts of syntactic complex predicate formation as described by (Alsina, 1996) and (Butt, 1995). This also allows for a straightfoward extension to related phenomena in other languages such as German, Japanese, Norwegian, and French.</dcterms:abstract> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/41407"/> <dcterms:title>Complex predicates via restriction</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/45"/> <dc:language>eng</dc:language> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/45"/> <dc:contributor>Butt, Miriam</dc:contributor> <dc:creator>Maxwell, John T.</dc:creator> <dc:contributor>King, Tracy Holloway</dc:contributor> <dc:creator>King, Tracy Holloway</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-02-16T09:39:23Z</dc:date> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account