1999 search results - page 56 / 400 » Dependently Typed Grammars |
130
click to vote
NLPRS
2001
Springer
15 years 6 months ago
2001
Springer
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
124
click to vote
ER
2008
Springer
15 years 3 months ago
2008
Springer
In a series of publications, we have proposed a foundational system of ontological categories which has been successfully used to evaluate and improve the quality of conceptual mod...
EMNLP
2006
15 years 3 months ago
2006
We propose a conditional random fieldbased method for supertagging, and apply it to the task of learning new lexical items for HPSG-based precision grammars of English and Japanes...
125
click to vote
COLING
2002
15 years 1 months ago
2002
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
130
click to vote
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...