Sciweavers

742 search results - page 16 / 149
» Formal Grammar for Java
Sort
View
FINTAL
2006
13 years 11 months ago
Regular Approximation of Link Grammar
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
GRAMMARS
2000
89views more  GRAMMARS 2000»
13 years 7 months ago
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
Robert Frank, Seth Kulick, K. Vijay-Shanker
TAL
2004
Springer
14 years 1 months ago
Expressive Power and Consistency Properties of State-of-the-Art Natural Language Parsers
Abstract. We define Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, nam...
Gabriel G. Infante López, Maarten de Rijke
EJC
2007
13 years 9 months ago
Comparing the Use of Feature Structures in Nativism and in Database Semantics
Linguistics has always been a field with a great diversity of schools and sub-schools. This has naturally led to the question of whether different grammatical analyses of the sam...
Roland Hausser
COLING
2002
13 years 7 months ago
Lenient Default Unification for Robust Processing within Unification Based Grammar Formalisms
This paper describes new default unification, lenient default unification. It works efficiently, and gives more informative results because it maximizes the amount of information ...
Takashi Ninomiya, Yusuke Miyao, Jun-ichi Tsujii