Sciweavers

2750 search results - page 19 / 550
» Learning Efficient Parsing
Sort
View
ANLP
2000
124views more  ANLP 2000»
13 years 11 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
Günter Neumann, Christian Braun, Jakub Piskor...
COLING
2010
13 years 4 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
ACL
1998
13 years 11 months ago
Translating a Unification Grammar with Disjunctions into Logical Constraints
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...
Mikio Nakano, Akira Shimazu
SETN
2010
Springer
14 years 4 months ago
A Feasibility Study on Low Level Techniques for Improving Parsing Accuracy for Spanish Using Maltparser
In the last years dependency parsing has been accomplished by machine learning–based systems showing great accuracy but usually under 90% for Labelled Attachment Score (LAS). Mal...
Miguel Ballesteros, Jesús Herrera, Virginia...
AAAI
2007
14 years 4 days ago
Two Approaches for Building an Unsupervised Dependency Parser and Their Other Applications
Much work has been done on building a parser for natural languages, but most of this work has concentrated on supervised parsing. Unsupervised parsing is a less explored area, and...
Jagadeesh Gorla, Amit Goyal, Rajeev Sangal