Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,970
Syntactic Expression as Morphological Exponence
"... this paper I will explore the hypotheses that certain analytically expressed predicates conveying agreement, tense, and polarity information should be: ..."
Abstract
- Add to MetaCart
this paper I will explore the hypotheses that certain analytically expressed predicates conveying agreement, tense, and polarity information should be:
1The Syntactic Expression of Tense
"... In this article I defend the view that many central aspects of the semantics of tense are determined by independently-motivated principles of syntactic theory. I begin by decomposing tenses syntactically into a temporal ordering predicate (the true tense, on this approach) and two time-denoting argu ..."
Abstract
- Add to MetaCart
In this article I defend the view that many central aspects of the semantics of tense are determined by independently-motivated principles of syntactic theory. I begin by decomposing tenses syntactically into a temporal ordering predicate (the true tense, on this approach) and two time
The Bedwyr system for model checking over syntactic expressions
- 21th Conference on Automated Deduction, LNAI 4603, 391–397
, 2007
"... Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expressions possibly containing bindings. This system, written in OCaml, is a direct implementation of two recent advances in the theory of proof search. The first is centered on the fact that both finit ..."
Abstract
-
Cited by 29 (18 self)
- Add to MetaCart
Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expressions possibly containing bindings. This system, written in OCaml, is a direct implementation of two recent advances in the theory of proof search. The first is centered on the fact that both
Finding structure in time
- COGNITIVE SCIENCE
, 1990
"... Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very important. One approach is to represent time implicitly by its effects on processing rather than explicitly (as in a spatial representation). The current report develops a pro ..."
Abstract
-
Cited by 2071 (23 self)
- Add to MetaCart
of prior internal states. A set of simulations is reported which range from relatively simple problems (temporal version of XOR) to discovering syntactic/semantic features for words. The networks are able to learn interesting internal representations which incorporate task demands with memory demands
A.: Learning syntactic patterns for automatic hypernym discovery.
- Advances in Neural Information Processing Systems
, 2004
"... Abstract Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by the problem of automatically constructing and extending such taxonomies, in this paper we present a new algori ..."
Abstract
-
Cited by 223 (6 self)
- Add to MetaCart
algorithm for automatically learning hypernym (is-a) relations from text. Our method generalizes earlier work that had relied on using small numbers of hand-crafted regular expression patterns to identify hypernym pairs. Using "dependency path" features extracted from parse trees, we introduce a
Constructions at Work: The Nature of Generalization in Language
, 2006
"... Adele Goldberg's Constructions at work is a welcome sequel to her (1995) Constructions, by now a landmark in linguistics. The new book extends her previous analyses and explores new and exciting territories. Since G is arguably the leading figure in Construction Grammar currently, the theory is ..."
Abstract
-
Cited by 317 (5 self)
- Add to MetaCart
. Constructions are form-function pairings, and the idea is that grammar is "constructions all the way down " (p. 18). In other words, clause-level syntactic constructions, phrases, collocations, words, and morphemes are all analyzed in a similar, "construction " fashion. In addition
Information flow inference for ML
- ACM Trans. Program. Lang. Syst
"... This paper presents a type-based information flow analysis for a call-by-value λ-calculus equipped with references, exceptions and let-polymorphism, which we refer to as Core ML. The type system is constraint-based and has decidable type inference. Its noninterference proof is reasonably light-weigh ..."
Abstract
-
Cited by 259 (4 self)
- Add to MetaCart
-weight, thanks to the use of a number of orthogonal techniques. First, a syntactic segregation between values and expressions allows a lighter formulation of the type system. Second, noninterference is reduced to subject reduction for a nonstandard language extension. Lastly, a semi-syntactic approach to type
SELECTION AND INFORMATION: A CLASS-BASED APPROACH TO LEXICAL RELATIONSHIPS
, 1993
"... Selectional constraints are limitations on the applicability of predicates to arguments. For example, the statement “The number two is blue” may be syntactically well formed, but at some level it is anomalous — BLUE is not a predicate that can be applied to numbers. According to the influential theo ..."
Abstract
-
Cited by 272 (9 self)
- Add to MetaCart
Selectional constraints are limitations on the applicability of predicates to arguments. For example, the statement “The number two is blue” may be syntactically well formed, but at some level it is anomalous — BLUE is not a predicate that can be applied to numbers. According to the influential
Syntactic Semigroups
, 1997
"... Introduction This chapter gives an overview on what is often called the algebraic theory of finite automata. It deals with languages, automata and semigroups, and has connections with model theory in logic, boolean circuits, symbolic dynamics and topology. Kleene's theorem [70] is usually con ..."
Abstract
-
Cited by 54 (0 self)
- Add to MetaCart
considered as the foundation of this theory. It shows that the class of recognizable languages (i.e. recognized by finite automata), coincides with the class of rational languages, which are given by rational expressions. The definition of the syntactic monoid , a monoid canonically attached to each language
Parsing Expression Grammars: A Recognition-Based Syntactic Foundation
- Symposium on Principles of Programming Languages
, 2004
"... For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ambiguity is crucial to their original purpo ..."
Abstract
-
Cited by 122 (1 self)
- Add to MetaCart
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ambiguity is crucial to their original
Results 1 - 10
of
2,970
