Sciweavers

1999 search results - page 176 / 400
» Dependently Typed Grammars
Sort
View
TSD
2007
Springer
16 years 16 days ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an
SIGGRAPH
2010
ACM
15 years 11 months ago
A connection between partial symmetry and inverse procedural modeling
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel
SIGLEX
1991
15 years 10 months ago
Logical Structures in the Lexicon
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
John F. Sowa
EJC
2008
15 years 7 months ago
Center Fragments for Upscaling and Verification in Database Semantics
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...
Roland Hausser
ACL
1996
15 years 7 months ago
Combining Trigram-based and Feature-based Methods for Context-Sensitive Spelling Correction
This paper addresses the problem of correcting spelling errors that result in valid, though unintended words (such as peace and piece, or quiet and quite) and also the problem of ...
Andrew R. Golding, Yves Schabes