The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Several tree transformation devices that are relevant in natural language processing are presented with a focus on the dependencies that they are able to capture. In many cases, the consideration of the dependencies alone can be used to provide a high-level explanation of the short-comings of tree transformation devices and allows surprising insights into their structure.
The recent emergence of linguistic formalisms exclusively based on the simply-typed λ-calculus to represent both syntax and semantics led to the presentation of innovative techniques which apply to both the problems of parsing and generating natural languages. A common feature of these techniques consists in using strong relations between typing properties and syntactic structures of families of simply-typed...
We consider the idea of defining syntactic structure relative to a language, rather than to a grammar for a language. This allows us to define a notion of hierarchical structure that is independent of the particular grammar, and that depends rather on the properties of various algebraic structures canonically associated with a language. Our goal is not necessarily to recover the traditional ideas...
Over the last decade, probabilistic parsing has become the standard in the parsing literature where one of the purposes of those probabilities is to discard unlikely parses. We investigate the effect that discarding low probability parses has on both the weak and strong generative power of context-free grammars. We prove that probabilistic context-free grammars are more powerful than their non-probabilistic...
The paper presents two case studies of multi-agent information exchange involving generalized quantifiers. We focus on scenarios in which agents successfully converge to knowledge on the basis of the information about the knowledge of others, so-called Muddy Children puzzle [1] and Top Hat puzzle. We investigate the relationship between certain invariance properties of quantifiers and the successful...
Minimalist Grammars (MGs) provide a setting for rigourous investigations of ideas that have been proposed at a more intuitive level in mainstream work in generative syntax. I address one such idea, namely the possibility that when an element appears to be “displaced”, it might be usefully analysed not as having merged into one position and then moved to another position, but rather as simply having...
Within the framework of Generative Lexicon theory (GL) we address some problems which subtype coercion poses for the type theory of classical formal semantics exemplified by pre-nominal genitive constructions and the coercion of sortal nouns into relational readings in such constructions. Relational interpretations of sortal nouns in genitive constructions depend on the ontological types of the referents...
In this paper we investigate the weak generative capacity of minimalist grammars with late adjunction. We show that by viewing the Specifier Island Condition as the union of three separate constraints, we obtain a more nuanced perspective on previous results on constraint interaction in minimalist grammars, as well as the beginning of a map of the interaction between late adjunction and movement constraints...
Chinese language has been generally regarded as a Subject-Verb -Object (SVO) language and the basic semantic unit is the Chinese word that is usually consisted by two or more Chinese characters. However, word-centered structure of Chinese language has been controversial in linguistics. Some recent research in computational linguistics in Chinese language suggests that the character-based models perform...
Bit vectors provide a way to compute the existence of least upper bounds in partial orders, which is a fundamental operation needed by any unification-based parser. However, bit vectors have seen relatively little adoption because of their length and associated speed disadvantages. We present a novel bit vector technique based on allowing one-sided errors; the resulting approximate bit vectors can...
Common versions of event semantics do not naturally explain the obligatory narrow scope of existential quantification over events, or the typically event-oriented modification by adverbials. We argue that these linguistic properties reflect a distinction between overt arguments and purely semantic slots like the event argument. The distinction is naturally captured in Abstract Categorial Grammar (ACG)...
We present a class of infinite automata, in which all local computations are performed by finite state machines. These automata characterize an abstract family of languages which does not seem to coincide with any other known class, and which seems to cut across the Chomsky hierarchy. We show results regarding recognizing power and closure properties, and sketch the use of machine growth as a refined...
We investigate what happens if , a co-inductive language, formalizes itself. We analyze the truth concept in fuzzy logics by formalizing truth degree theory in the framework of truth theories in fuzzy logics. Hájek-Paris-Shepherdson’s paradox [HPS00] involves that so called truth degrees do not represent the degrees of truthhood (defined by the truth predicate)...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.