1.

Record Nr.

UNINA9910455363903321

Titolo

Adverbs and adverbial adjuncts at the interfaces [[electronic resource] /] / edited by Katalin E. Kiss

Pubbl/distr/stampa

Berlin ; ; New York, : Mouton de Gruyter, c2009

ISBN

1-282-18805-4

9786612188053

3-11-021480-6

Descrizione fisica

1 online resource (386 p.)

Collana

Interface explorations ; ; 20

Classificazione

EK 2350

Altri autori (Persone)

KissKatalin É

Disciplina

494/.511576

Soggetti

Hungarian language - Adverb

Hungarian language - Adverbials

Electronic books.

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references (p. [349]-374) and index.

Nota di contenuto

Frontmatter -- Contents -- 1. Introduction -- Merge-in position and interpretation -- 2. Syntactic, semantic, and prosodic factors determining the position of adverbial adjuncts -- 3. ''Incorporated'' locative adverbials in Hungarian -- 4. The syntax of Hungarian -vA adverbial participles: A single affix with variable merge-in locations -- 5. Adverbial (dis)ambiguities. Syntactic and prosodic features of ambiguous predicational adverbs -- 6. Temporal adverbial clauses with or without operator movement -- Questions of category and grammatical function -- 7. Adverbial versus adjectival constructions with BE -- 8. Obligatory adjuncts licensing Definiteness Effect constructions -- 9. Comitative adjuncts: appositives and non-appositives -- 10. Types of temporal adverbials and the fine structure of events -- 11. Aspect and adverb interpretation - the case of quickly -- Interaction with focus -- 12. Scalar adverbs in and out of focus -- 13. Adverbs of quantification, it-clefts and Hungarian focus -- Backmatter

Sommario/riassunto

This book clarifies - on the basis of mainly Hungarian data - basic issues concerning the category 'adverb,' the function 'adverbial,' and the grammar of adverbial modification. It argues for the PP analysis of



adverbials, and claims that they enter the derivation via left- and right-adjunction. Their merge-in position is determined by the interplay of syntactic, semantic, and prosodic factors. The semantically motivated constraints discussed also include a type restriction affecting adverbials semantically incorporated into the verbal predicate, an obligatory focus position for scalar adverbs representing negative values of bidirectional scales, cooccurrence restrictions between verbs and adverbials involving incompatible subevents, etc. The order and interpretation of adverbials in the postverbal domain is shown to be affected by such phonologically motivated constraints as the Law of Growing Constituents, and by intonation phrase restructuring. The shape of the light-headed chain arising in the course of locative PP incorporation is determined by morpho-phonological requirements. The types of adverbs and adverbials analyzed include locatives, temporals, comitatives, epistemic adverbs, adverbs of degree, manner, counting, and frequency, quantificational adverbs, and adverbial participles.

2.

Record Nr.

UNINA9910483710303321

Titolo

Algorithms – ESA 2005 : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / / edited by Gerth S. Brodal, Stefano Leonardi

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005

Edizione

[1st ed. 2005.]

Descrizione fisica

1 online resource (XVIII, 901 p.)

Collana

Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3669

Altri autori (Persone)

BrodalGerth Stlting <1969->

LeonardiS (Stefano)

Disciplina

005.11

Soggetti

Computer programming

Algorithms

Computer networks

Artificial intelligence - Data processing

Numerical analysis

Computer science - Mathematics

Discrete mathematics

Programming Techniques

Computer Communication Networks

Data Science

Numerical Analysis

Discrete Mathematics in Computer Science



Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut -- Relax-and-Cut for Capacitated Network Design -- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, -- The Complexity of Games on Highly Regular Graphs -- Computing Equilibrium Prices: Does Theory Meet Practice? -- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length -- Linear-Time Enumeration of Isolated Cliques -- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs -- Delineating Boundaries for Imprecise Regions -- Exacus: Efficient and Exact Algorithms for Curves and Surfaces -- Min Sum Clustering with Penalties -- Improved Approximation Algorithms for Metric Max TSP -- Unbalanced Graph Cuts -- Low Degree Connectivity in Ad-Hoc Networks -- 5-Regular Graphs are 3-Colorable with Positive Probability -- Optimal Integer Alphabetic Trees in Linear Time -- Predecessor Queries in Constant Time? -- An Algorithm for Node-Capacitated Ring Routing -- On Degree Constrained Shortest Paths -- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time -- Roll Cutting in the Curtain Industry -- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation -- Cache-Oblivious Comparison-Based Algorithms on Multisets -- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation -- Allocating Memory in a Lock-Free Manner -- Generating Realistic Terrains with Higher-Order Delaunay Triangulations -- I/O-Efficient Construction of Constrained Delaunay Triangulations -- Convex Hull and Voronoi Diagram of Additively Weighted Points -- New Tools and Simpler Algorithms for Branchwidth -- Treewidth Lower Bounds with Brambles -- Minimal Interval Completions -- A 2-Approximation Algorithm for Sorting by Prefix Reversals -- Approximating the 2-Interval Pattern Problem -- A Loopless Gray Code for Minimal Signed-Binary Representations -- Efficient Approximation Schemes for Geometric Problems? -- Geometric Clustering to Minimize the Sum of Cluster Sizes -- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs -- Packet Routing and Information Gathering in Lines, Rings and Trees -- Jitter Regulation for Multiple Streams -- Efficient c-Oriented Range Searching with DOP-Trees -- Matching Point Sets with Respect to the Earth Mover’s Distance -- Small Stretch Spanners on Dynamic Graphs -- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure -- Experimental Study of Geometric t-Spanners -- Highway Hierarchies Hasten Exact Shortest Path Queries -- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays -- Fairness-Free Periodic Scheduling with Vacations -- Online Bin Packing with Cardinality Constraints -- Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines --



Engineering Planar Separator Algorithms -- Stxxl: Standard Template Library for XXL Data Sets -- Negative Cycle Detection Problem -- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees -- Online View Maintenance Under a Response-Time Constraint -- Online Primal-Dual Algorithms for Coveringand Packing Problems -- Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information -- Using Fractional Primal-Dual to Schedule Split Intervals with Demands -- An Approximation Algorithm for the Minimum Latency Set Cover Problem -- Workload-Optimal Histograms on Streams -- Finding Frequent Patterns in a String in Sublinear Time -- Online Occlusion Culling -- Shortest Paths in Matrix Multiplication Time -- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs -- Greedy Routing in Tree-Decomposed Graphs -- Making Chord Robust to Byzantine Attacks -- Bucket Game with Applications to Set Multicover and Dynamic Page Migration -- Bootstrapping a Hop-Optimal Network in the Weak Sensor Model -- Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs -- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem -- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack -- Robust Approximate Zeros -- Optimizing a 2D Function Satisfying Unimodality Properties.