Refine
Has Fulltext
- yes (183)
Year of publication
Document Type
- Conference Proceeding (183) (remove)
Language
- English (160)
- German (13)
- Multiple languages (9)
- French (1)
Is part of the Bibliography
- no (183) (remove)
Keywords
- Archiv (4)
- Nachlass (4)
- Information Structure (3)
- middleware (3)
- Universitätsarchiv (2)
- additive particle (2)
- Aspektorientierte Softwareentwicklung (1)
- Betriebssysteme (1)
- Coccinelle (1)
- Constraint Solving (1)
- Contrast (1)
- Correction (1)
- Deduction (1)
- Grundrechte (1)
- Herodotos (1)
- History of pattern occurrences (1)
- Integration (1)
- Ishkashimi (1)
- Kongress (1)
- Kulturmanagement (1)
- Kulturwissenschaften (1)
- Kwa languages (1)
- Landesverfassung (1)
- Logic Programming (1)
- Logics (1)
- Markedness (1)
- Middleware (1)
- Optimization (1)
- PF Interface (1)
- Planing (1)
- Polonist (1)
- Polonistik (1)
- Prolog (1)
- Prosody (1)
- Romanistik (1)
- Russian Scrambling (1)
- Russian Sign Language (1)
- Schulpolitik (1)
- Sign Language of the Netherlands (1)
- Systemsoftware (1)
- VIL (1)
- Verfassungsentstehung und -änderung (1)
- Verfassungsgerichtsbarkeit (1)
- Verfassungsprinzipien (1)
- Virtuelle Maschinen (1)
- XM (1)
- aspect adapter (1)
- aspect oriented programming (1)
- aspect-oriented (1)
- aspects (1)
- aspectualization (1)
- bottom–up (1)
- bracketing paradox (1)
- bug tracking (1)
- built–in predicates (1)
- cognitive activation (1)
- complexity (1)
- concurrency (1)
- consistency (1)
- contrast (1)
- crosscutting wrappers (1)
- deductive databases (1)
- degree of givenness (1)
- discourse referent (1)
- distributed systems (1)
- doubling (1)
- dynamic reconfiguration (1)
- extensions of logic programs (1)
- floods (1)
- focus (1)
- focus particle (1)
- foregrounding (1)
- forward / backward chaining (1)
- function symbols (1)
- generalized logic programs (1)
- geomorphology (1)
- global change (1)
- information status (1)
- invasive aspects (1)
- knowledge representation (1)
- micro- and nanotechnologies (1)
- mountainous rivers (1)
- multi-valued logic (1)
- natural hazards (1)
- nonlinear dynamics (1)
- operating systems (1)
- paraconsistency (1)
- perception (1)
- pitch accent (1)
- program analysis (1)
- programming language (1)
- prominence (1)
- prosody (1)
- reflection (1)
- reusable aspects (1)
- security policies (1)
- self-organization (1)
- semantics (1)
- service-oriented (1)
- stratification (1)
- systems software (1)
- top– down (1)
- tuple spaces (1)
- views (1)
- virtual machines (1)
Institute
- Extern (128)
- Institut für Künste und Medien (18)
- Interdisziplinäres Zentrum für Musterdynamik und Angewandte Fernerkundung (17)
- Institut für Slavistik (10)
- Institut für Physik und Astronomie (9)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (7)
- Institut für Geowissenschaften (6)
- Sonderforschungsbereich 632 - Informationsstruktur (6)
- Institut für Informatik und Computational Science (3)
- Institut für Biochemie und Biologie (2)
We present a new analysis of illocutionary forces in dialogue. We analyze them as complex conversational moves involving two dimensions: what Speaker commits herself to and what she calls on Addressee to perform. We start from the analysis of speech acts such as confirmation requests or whimperatives, and extend the analysis to seemingly simple speech acts, such as statements and queries. Then, we show how to integrate our proposal in the framework of the Grammar for Conversation (Ginzburg, to app.), which is adequate for modelling agents' information states and how they get updated.
Since Harris’ parser in the late 50s, multiword units have been progressively integrated in parsers. Nevertheless, in the most part, they are still restricted to compound words, that are more stable and less numerous. Actually, language is full of semi-fixed expressions that also form basic semantic units: semi-fixed adverbial expressions (e.g. time), collocations. Like compounds, the identification of these structures limits the combinatorial complexity induced by lexical ambiguity. In this paper, we detail an experiment that largely integrates these notions in a finite-state procedure of segmentation into super-chunks, preliminary to a parser.We show that the chunker, developped for French, reaches 92.9% precision and 98.7% recall. Moreover, multiword units realize 36.6% of the attachments within nominal and prepositional phrases.
Jesper Juul has convincingly argued that the conflict over the proper object of study has shifted from “rules or story” to “player or game.” But a key component of digital games is still missing from either of these oppositions: that of the computer itself. This paper offers a way of thinking about the phenomenology of the videogame from the perspective of the computer rather than the game or the player.
Finite state methods for natural language processing often require the construction and the intersection of several automata. In this paper, we investigate the question of determining the best order in which these intersections should be performed. We take as an example lexical disambiguation in polarity grammars. We show that there is no efficient way to minimize the state complexity of these intersections.
We have analyzed the spectra of seven Galactic O4 supergiants, with the NLTE wind code CMFGEN. For all stars, we have found that clumped wind models match well lines from different species spanning a wavelength range from FUV to optical, and remain consistent with Hα data. We have achieved an excellent match of the P V λλ1118, 1128 resonance doublet and N IV λ1718, as well as He II λ4686 suggesting that our physical description of clumping is adequate. We find very small volume filling factors and that clumping starts deep in the wind, near the sonic point. The most crucial consequence of our analysis is that the mass loss rates of O stars need to be revised downward significantly, by a factor of 3 and more compared to those obtained from smooth-wind models.
Deductive databases need general formulas in rule bodies, not only conjuctions of literals. This is well known since the work of Lloyd and Topor about extended logic programming. Of course, formulas must be restricted in such a way that they can be effectively evaluated in finite time, and produce only a finite number of new tuples (in each iteration of the TP-operator: the fixpoint can still be infinite). It is also necessary to respect binding restrictions of built-in predicates: many of these predicates can be executed only when certain arguments are ground. Whereas for standard logic programming rules, questions of safety, allowedness, and range-restriction are relatively easy and well understood, the situation for general formulas is a bit more complicated. We give a syntactic analysis of formulas that guarantees the necessary properties.
Because software development is increasingly expensive and timeconsuming, software reuse gains importance. Aspect-oriented software development modularizes crosscutting concerns which enables their systematic reuse. Literature provides a number of AOP patterns and best practices for developing reusable aspects based on compelling examples for concerns like tracing, transactions and persistence. However, such best practices are lacking for systematically reusing invasive aspects. In this paper, we present the ‘callback mismatch problem’. This problem arises in the context of abstraction mismatch, in which the aspect is required to issue a callback to the base application. As a consequence, the composition of invasive aspects is cumbersome to implement, difficult to maintain and impossible to reuse. We motivate this problem in a real-world example, show that it persists in the current state-of-the-art, and outline the need for advanced aspectual composition mechanisms to deal with this.
We introduce and discuss a number of issues that arise in the process of building a finite-state morphological analyzer for Urdu, in particular issues with potential ambiguity and non-concatenative morphology. Our approach allows for an underlyingly similar treatment of both Urdu and Hindi via a cascade of finite-state transducers that transliterates the very different scripts into a common ASCII transcription system. As this transliteration system is based on the XFST tools that the Urdu/Hindi common morphological analyzer is also implemented in, no compatibility problems arise.