Sciweavers

2783 search results - page 183 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
IJCAI
2007
15 years 3 months ago
The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
Alan M. Frisch, Matthew Grum, Christopher Jefferso...
ACL
2006
15 years 3 months ago
A Pipeline Framework for Dependency Parsing
Pipeline computation, in which a task is decomposed into several stages that are solved sequentially, is a common computational strategy in natural language processing. The key pr...
Ming-Wei Chang, Quang Do, Dan Roth
ACL
2006
15 years 3 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
ACL
2006
15 years 3 months ago
Factorizing Complex Models: A Case Study in Mention Detection
As natural language understanding research advances towards deeper knowledge modeling, the tasks become more and more complex: we are interested in more nuanced word characteristi...
Radu Florian, Hongyan Jing, Nanda Kambhatla, Imed ...
EACL
2003
ACL Anthology
15 years 3 months ago
An efficient implementation of a new DOP model
Two apparently opposing DOP models exist in the literature: one which computes the parse tree involving the most frequent subtrees from a treebank and one which computes the parse...
Rens Bod