Sciweavers

12 search results - page 1 / 3
» Lexical Operations in a Unification-Based Framework
Sort
View
SIGLEX
1991
13 years 8 months ago
Lexical Operations in a Unification-Based Framework
We consider lexicM operations and their representation in a unification based lexicon and the role of lexical semantic information. We describe a unified treatment of the linguist...
Ann A. Copestake, Ted Briscoe
ACL
1993
13 years 6 months ago
A Unification-Based Parser for Relational Grammar
We present an implemented unification-based parser for relational grammars developed within the stratified feature grammar (SFG) framework, which generalizes Kasper-Rounds logic t...
David E. Johnson, Adam Meyers, Lawrence S. Moss
CORR
2004
Springer
125views Education» more  CORR 2004»
13 years 4 months ago
High-Level Networking With Mobile Code And First Order AND-Continuations
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
Paul Tarau, Verónica Dahl
AAAI
2007
13 years 7 months ago
Semantic Inference at the Lexical-Syntactic Level
Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on complex logical representation...
Roy Bar-Haim, Ido Dagan, Iddo Greental, Eyal Shnar...
CC
2004
Springer
177views System Software» more  CC 2004»
13 years 10 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking