Sciweavers

573 search results - page 5 / 115
» Probabilistic Parsing Strategies
Sort
View
ACL
1993
13 years 10 months ago
Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
Ezra Black, Frederick Jelinek, John D. Lafferty, D...
ACL
2000
13 years 10 months ago
Statistical Parsing with an Automatically-Extracted Tree Adjoining Grammar
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
David Chiang
ANLP
2000
118views more  ANLP 2000»
13 years 10 months ago
A Novel Use of Statistical Parsing to Extract Information from Text
Since 1995, a few statistical parsing algorithms have demonstrated a breakthrough in parsing accuracy, as measured against the UPenn TREEBANK as a gold standard. In this paper we ...
Scott Miller, Heidi Fox, Lance A. Ramshaw, Ralph M...
IWPT
2001
13 years 10 months ago
Bidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
Miguel A. Alonso, Víctor J. Díaz, Ma...
COLING
2010
13 years 3 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