1999 search results - page 52 / 400 » Dependently Typed Grammars |
122
click to vote
LACL
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
103
click to vote
TAPD
1998
15 years 3 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
ACL
2007
15 years 3 months ago
2007
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
ACTA
2002
15 years 1 months ago
2002
We consider XML documents described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties...
137
Voted
AAAI
2011
14 years 2 months ago
2011
We present a method for dependency grammar induction that utilizes sparse annotations of semantic relations. This induction set-up is attractive because such annotations provide u...