9 search results - page 2 / 2 » Capturing CFLs with Tree Adjoining Grammars |
ESSLLI
1999
Springer
13 years 10 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
AAAI
2000
13 years 7 months ago
2000
We present an approach to building a verb lexicon compatible with WordNet but with explicitly stated syntactic and semantic information, using Levin verb classes to systematically...
DEXA
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
TASLP
2008
13 years 5 months ago
2008
Abstract--Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic knowledge caused system performance to deteriorate. The most recent su...