Sciweavers

68 search results - page 9 / 14
» Lexical and Syntactic Rules in a Tree Adjoining Grammar
Sort
View
MLMTA
2003
13 years 8 months ago
Just-in-Time Grammar
In this paper, we attempt to explain why rule-based syntactic analysis systems have not so far worked as well as they could. This will motivate our approach, which is based on a n...
Stephen Beale, Sergei Nirenburg, Marjorie McShane
ACL
1997
13 years 8 months ago
Ambiguity Resolution for Machine Translation of Telegraphic Messages
Telegraphic messages with numerous instances of omission pose a new challenge to parsing in that a sentence with omission causes a higher degree of ambi6uity than a sentence witho...
Young-Suk Lee, Clifford J. Weinstein, Stephanie Se...
COGSCI
2004
92views more  COGSCI 2004»
13 years 7 months ago
Varieties of crossing dependencies: structure dependence and mild context sensitivity
Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on contex...
Edward P. Stabler Jr.
LRE
2008
100views more  LRE 2008»
13 years 7 months ago
LTAG-spinal and the Treebank
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
Libin Shen, Lucas Champollion, Aravind K. Joshi
COLING
2002
13 years 6 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...