Sciweavers

1999 search results - page 70 / 400
» Dependently Typed Grammars
Sort
View
EACL
2003
ACL Anthology
15 years 7 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
IAJIT
2006
92views more  IAJIT 2006»
15 years 6 months ago
A Rule-Based Extensible Stemmer for Information Retrieval with Application to Arabic
: This paper presents a new and extensible method for information retrieval and content analysis in natural languages (NL). The proposed method is stem-based; stems are extracted b...
Haidar Harmanani, Walid Keirouz, Saeed Raheel
CADE
2003
Springer
16 years 6 months ago
Subset Types and Partial Functions
A classical higher-order logic PFsub of partial functions is defined. The logic extends a version of Farmer's logic PF by enriching the type system of the logic with subset ty...
Aaron Stump
MLQ
2008
67views more  MLQ 2008»
15 years 6 months ago
Classical truth in higher types
We study, from a classical point of view, how the truth of a statement about higher type functionals depends on the underlying model. The models considered are the classical set-t...
Ulrich Berger
POPL
2003
ACM
16 years 6 months ago
The essence of XML
The World-Wide Web Consortium (W3C) promotes XML and related standards, including XML Schema, XQuery, and XPath. This paper describes a formalization XML Schema. A formal semantic...
Jérôme Siméon, Philip Wadler