Sciweavers

134 search results - page 26 / 27
» Higher-Order and Semantic Unification
Sort
View
ACL
1997
14 years 11 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
POPL
2006
ACM
15 years 9 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
WWW
2001
ACM
15 years 10 months ago
Combining RDF and XML schemas to enhance interoperability between metadata application profiles
The term "application profile" has recently become highly topical. Heery and Patel [1] define application profiles as metadata schemas which consist of metadata elements...
Jane Hunter, Carl Lagoze
ICLP
2009
Springer
15 years 10 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
91
Voted
ACL
1994
14 years 10 months ago
Priority Union and Generalization in Discourse Grammars
We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al. We examine their method for re...
Claire Grover, Chris Brew, Suresh Manandhar, Marc ...