Sciweavers

60 search results - page 7 / 12
» Incremental Parser Generation for Tree Adjoining Grammars
Sort
View
TOOLS
1992
IEEE
13 years 11 months ago
Automating the Development of Syntax Tree Generators for an Evolving Language
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...
Per Grape, Kim Walden
COLING
2000
13 years 8 months ago
A Hybrid Japanese Parser with Hand-crafted Grammar and Statistics
This paper describes a hybrid parsing method for Japanese which uses both a hand-crafted grammar and a statistical technique. The key feature of our system is that in order to est...
Hiroshi Kanayama, Kentaro Torisawa, Yutaka Mitsuis...
COLING
2002
13 years 7 months ago
Creating a Finite-State Parser with Application Semantics
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...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
COGSCI
2004
82views more  COGSCI 2004»
13 years 7 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
LREC
2010
203views Education» more  LREC 2010»
13 years 8 months ago
Arabic Parsing Using Grammar Transforms
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
Lamia Tounsi, Josef van Genabith