Sciweavers

329 search results - page 41 / 66
» Stacking Dependency Parsers
Sort
View
COLING
1996
13 years 8 months ago
Modularizing Codescriptive Grammars for Efficient Parsing
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
Walter Kasper, Hans-Ulrich Krieger
ACL
1990
13 years 8 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
EMNLP
2009
13 years 5 months ago
Unsupervised Semantic Parsing
We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, r...
Hoifung Poon, Pedro Domingos
COLING
2010
13 years 2 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
CICLING
2010
Springer
13 years 7 months ago
Issues in Analyzing Telugu Sentences towards Building a Telugu Treebank
This paper describes an effort towards building a Telugu Dependency Treebank. We discuss the basic framework and issues we encountered while annotating. 1487 sentences have been an...
Chaitanya Vempaty, Viswanatha Naidu, Samar Husain,...