Sciweavers

732 search results - page 31 / 147
» Using Types to Parse Natural Language
Sort
View
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
14 years 2 months ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt
ECAI
2000
Springer
14 years 22 days ago
Using Description Logics for Ontology Extraction
The paper presents a prototype of a system for querying the Web in natural language (French) for a limited domain. The domain knowledge, represented in description logics (DL), is ...
Amalia Todirascu, François de Bertrand de B...
EMNLP
2009
13 years 6 months ago
Unbounded Dependency Recovery for Parser Evaluation
This paper introduces a new parser evaluation corpus containing around 700 sentences annotated with unbounded dependencies, from seven different grammatical constructions. We run ...
Laura Rimell, Stephen Clark, Mark Steedman
NLPRS
2001
Springer
14 years 25 days ago
Incremental CFG Parsing with Statistical Lexical Dependencies
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,...
Takahisa Murase, Shigeki Matsubara, Yoshihide Kato...
EACL
1993
ACL Anthology
13 years 9 months ago
A Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
Josée S. Heemskerk