Sciweavers

182 search results - page 28 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
ACL
2001
13 years 9 months ago
Improvement of a Whole Sentence Maximum Entropy Language Model Using Grammatical Features
In this paper, we propose adding long-term grammatical information in a Whole Sentence Maximun Entropy Language Model (WSME) in order to improve the performance of the model. The ...
Fredy A. Amaya, José-Miguel Benedí
COLING
1996
13 years 9 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
NLPRS
2001
Springer
14 years 4 days ago
Resolving Ambiguity in Inter-chunk Dependency Parsing
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency gr...
Mi-Young Kim, Sin-Jae Kang, Jong-Hyeok Lee
TSE
2008
107views more  TSE 2008»
13 years 7 months ago
Interface Grammars for Modular Software Model Checking
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
Graham Hughes, Tevfik Bultan
EMNLP
2004
13 years 9 months ago
Bilingual Parsing with Factored Estimation: Using English to Parse Korean
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...
David A. Smith, Noah A. Smith